./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix045_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 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/mix045_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix045_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 --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 11:53:36,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 11:53:36,422 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 11:53:36,426 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 11:53:36,426 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 11:53:36,450 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 11:53:36,451 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 11:53:36,451 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 11:53:36,452 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 11:53:36,455 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 11:53:36,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 11:53:36,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 11:53:36,456 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 11:53:36,457 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 11:53:36,457 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 11:53:36,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 11:53:36,458 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 11:53:36,458 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 11:53:36,458 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 11:53:36,458 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 11:53:36,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 11:53:36,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 11:53:36,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 11:53:36,459 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 11:53:36,460 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 11:53:36,460 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 11:53:36,460 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 11:53:36,460 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 11:53:36,461 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 11:53:36,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 11:53:36,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 11:53:36,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 11:53:36,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:53:36,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 11:53:36,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 11:53:36,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 11:53:36,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 11:53:36,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 11:53:36,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 11:53:36,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 11:53:36,464 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 11:53:36,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 11:53:36,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 11:53:36,464 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-05-12 11:53:36,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 11:53:36,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 11:53:36,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 11:53:36,804 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 11:53:36,805 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 11:53:36,806 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i [2024-05-12 11:53:38,039 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 11:53:38,234 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 11:53:38,235 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i [2024-05-12 11:53:38,248 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0ad9d6f6/32905220afc949f9824f83c4b6fa0533/FLAGbef8a37be [2024-05-12 11:53:38,262 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0ad9d6f6/32905220afc949f9824f83c4b6fa0533 [2024-05-12 11:53:38,264 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 11:53:38,265 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 11:53:38,265 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/mutex-meet/mix045_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-05-12 11:53:38,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 11:53:38,473 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 11:53:38,474 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 11:53:38,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 11:53:38,478 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 11:53:38,478 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:53:38" (1/2) ... [2024-05-12 11:53:38,479 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b4800a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:53:38, skipping insertion in model container [2024-05-12 11:53:38,479 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:53:38" (1/2) ... [2024-05-12 11:53:38,481 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@61e3d0df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:53:38, skipping insertion in model container [2024-05-12 11:53:38,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:53:38" (2/2) ... [2024-05-12 11:53:38,481 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b4800a8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:53:38, skipping insertion in model container [2024-05-12 11:53:38,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:53:38" (2/2) ... [2024-05-12 11:53:38,482 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 11:53:38,549 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 11:53:38,550 INFO L97 edCorrectnessWitness]: Location invariant before [L846-L846] (((((((((((((((((((! multithreaded || a$read_delayed_var == 0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )a$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff1 >= 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 )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_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )a$flush_delayed >= 0LL) && (long long )a + (long long )a$mem_tmp >= 0LL) && (long long )a + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a + (long long )a$read_delayed >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )a$flush_delayed + (long long )a$mem_tmp >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$flush_delayed + (long long )x >= 0LL) && (long long )a$flush_delayed + (long long )y >= 0LL) && (long long )a$flush_delayed + (long long )z >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff1 >= 0LL) && (long long )a$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )a$mem_tmp + (long long )x >= 0LL) && (long long )a$mem_tmp + (long long )y >= 0LL) && (long long )a$mem_tmp + (long long )z >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )x >= 0LL) && (long long )a$r_buff0_thd0 + (long long )y >= 0LL) && (long long )a$r_buff0_thd0 + (long long )z >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )x >= 0LL) && (long long )a$r_buff0_thd2 + (long long )y >= 0LL) && (long long )a$r_buff0_thd2 + (long long )z >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )x >= 0LL) && (long long )a$r_buff0_thd3 + (long long )y >= 0LL) && (long long )a$r_buff0_thd3 + (long long )z >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )x >= 0LL) && (long long )a$r_buff1_thd0 + (long long )y >= 0LL) && (long long )a$r_buff1_thd0 + (long long )z >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )x >= 0LL) && (long long )a$r_buff1_thd2 + (long long )y >= 0LL) && (long long )a$r_buff1_thd2 + (long long )z >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )x >= 0LL) && (long long )a$r_buff1_thd3 + (long long )y >= 0LL) && (long long )a$r_buff1_thd3 + (long long )z >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$read_delayed + (long long )x >= 0LL) && (long long )a$read_delayed + (long long )y >= 0LL) && (long long )a$read_delayed + (long long )z >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff1 + (long long )x >= 0LL) && (long long )a$w_buff1 + (long long )y >= 0LL) && (long long )a$w_buff1 + (long long )z >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 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 )y >= 0LL) && (long long )x + (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 )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 )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$w_buff0) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$read_delayed >= 0LL) && (long long )a - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a - (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= a$mem_tmp) && 0 <= a$w_buff0) && 0 <= a$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && a$mem_tmp <= 1) && a$w_buff0 <= 1) && a$w_buff1 <= 1) && z <= 1) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2))) [2024-05-12 11:53:38,551 INFO L97 edCorrectnessWitness]: Location invariant before [L844-L844] (((((((((((((((((((! multithreaded || a$read_delayed_var == 0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )a$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff1 >= 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 )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_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )a$flush_delayed >= 0LL) && (long long )a + (long long )a$mem_tmp >= 0LL) && (long long )a + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a + (long long )a$read_delayed >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )a$flush_delayed + (long long )a$mem_tmp >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$flush_delayed + (long long )x >= 0LL) && (long long )a$flush_delayed + (long long )y >= 0LL) && (long long )a$flush_delayed + (long long )z >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff1 >= 0LL) && (long long )a$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )a$mem_tmp + (long long )x >= 0LL) && (long long )a$mem_tmp + (long long )y >= 0LL) && (long long )a$mem_tmp + (long long )z >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )x >= 0LL) && (long long )a$r_buff0_thd0 + (long long )y >= 0LL) && (long long )a$r_buff0_thd0 + (long long )z >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )x >= 0LL) && (long long )a$r_buff0_thd2 + (long long )y >= 0LL) && (long long )a$r_buff0_thd2 + (long long )z >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )x >= 0LL) && (long long )a$r_buff0_thd3 + (long long )y >= 0LL) && (long long )a$r_buff0_thd3 + (long long )z >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )x >= 0LL) && (long long )a$r_buff1_thd0 + (long long )y >= 0LL) && (long long )a$r_buff1_thd0 + (long long )z >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )x >= 0LL) && (long long )a$r_buff1_thd2 + (long long )y >= 0LL) && (long long )a$r_buff1_thd2 + (long long )z >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )x >= 0LL) && (long long )a$r_buff1_thd3 + (long long )y >= 0LL) && (long long )a$r_buff1_thd3 + (long long )z >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$read_delayed + (long long )x >= 0LL) && (long long )a$read_delayed + (long long )y >= 0LL) && (long long )a$read_delayed + (long long )z >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff1 + (long long )x >= 0LL) && (long long )a$w_buff1 + (long long )y >= 0LL) && (long long )a$w_buff1 + (long long )z >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 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 )y >= 0LL) && (long long )x + (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 )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 )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$w_buff0) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$read_delayed >= 0LL) && (long long )a - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a - (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= a$mem_tmp) && 0 <= a$w_buff0) && 0 <= a$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && a$mem_tmp <= 1) && a$w_buff0 <= 1) && a$w_buff1 <= 1) && z <= 1) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2))) [2024-05-12 11:53:38,551 INFO L97 edCorrectnessWitness]: Location invariant before [L847-L847] (((((((((((((((((((! multithreaded || a$read_delayed_var == 0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )a$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff1 >= 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 )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_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )a$flush_delayed >= 0LL) && (long long )a + (long long )a$mem_tmp >= 0LL) && (long long )a + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a + (long long )a$read_delayed >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )a$flush_delayed + (long long )a$mem_tmp >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$flush_delayed + (long long )x >= 0LL) && (long long )a$flush_delayed + (long long )y >= 0LL) && (long long )a$flush_delayed + (long long )z >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff1 >= 0LL) && (long long )a$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )a$mem_tmp + (long long )x >= 0LL) && (long long )a$mem_tmp + (long long )y >= 0LL) && (long long )a$mem_tmp + (long long )z >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )x >= 0LL) && (long long )a$r_buff0_thd0 + (long long )y >= 0LL) && (long long )a$r_buff0_thd0 + (long long )z >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )x >= 0LL) && (long long )a$r_buff0_thd2 + (long long )y >= 0LL) && (long long )a$r_buff0_thd2 + (long long )z >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )x >= 0LL) && (long long )a$r_buff0_thd3 + (long long )y >= 0LL) && (long long )a$r_buff0_thd3 + (long long )z >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )x >= 0LL) && (long long )a$r_buff1_thd0 + (long long )y >= 0LL) && (long long )a$r_buff1_thd0 + (long long )z >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )x >= 0LL) && (long long )a$r_buff1_thd2 + (long long )y >= 0LL) && (long long )a$r_buff1_thd2 + (long long )z >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )x >= 0LL) && (long long )a$r_buff1_thd3 + (long long )y >= 0LL) && (long long )a$r_buff1_thd3 + (long long )z >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$read_delayed + (long long )x >= 0LL) && (long long )a$read_delayed + (long long )y >= 0LL) && (long long )a$read_delayed + (long long )z >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff1 + (long long )x >= 0LL) && (long long )a$w_buff1 + (long long )y >= 0LL) && (long long )a$w_buff1 + (long long )z >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 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 )y >= 0LL) && (long long )x + (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 )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 )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$w_buff0) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$read_delayed >= 0LL) && (long long )a - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a - (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= a$mem_tmp) && 0 <= a$w_buff0) && 0 <= a$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && a$mem_tmp <= 1) && a$w_buff0 <= 1) && a$w_buff1 <= 1) && z <= 1) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2))) [2024-05-12 11:53:38,552 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 11:53:38,552 INFO L106 edCorrectnessWitness]: ghost_update [L842-L842] multithreaded = 1; [2024-05-12 11:53:38,589 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 11:53:38,723 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-05-12 11:53:38,887 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:53:38,908 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 11:53:38,943 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i[969,982] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 11:53:39,345 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:53:39,380 INFO L206 MainTranslator]: Completed translation [2024-05-12 11:53:39,381 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:53:39 WrapperNode [2024-05-12 11:53:39,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 11:53:39,382 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 11:53:39,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 11:53:39,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 11:53:39,387 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 12.05 11:53:39" (1/1) ... [2024-05-12 11:53:39,423 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 12.05 11:53:39" (1/1) ... [2024-05-12 11:53:39,535 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134 [2024-05-12 11:53:39,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 11:53:39,536 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 11:53:39,536 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 11:53:39,536 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 11:53:39,545 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:53:39" (1/1) ... [2024-05-12 11:53:39,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:53:39" (1/1) ... [2024-05-12 11:53:39,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:53:39" (1/1) ... [2024-05-12 11:53:39,637 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-05-12 11:53:39,637 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:53:39" (1/1) ... [2024-05-12 11:53:39,637 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:53:39" (1/1) ... [2024-05-12 11:53:39,674 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:53:39" (1/1) ... [2024-05-12 11:53:39,676 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:53:39" (1/1) ... [2024-05-12 11:53:39,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:53:39" (1/1) ... [2024-05-12 11:53:39,706 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:53:39" (1/1) ... [2024-05-12 11:53:39,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 11:53:39,729 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 11:53:39,729 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 11:53:39,729 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 11:53:39,730 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:53:39" (1/1) ... [2024-05-12 11:53:39,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:53:39,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:53:39,757 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-05-12 11:53:39,776 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-05-12 11:53:39,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 11:53:39,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 11:53:39,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 11:53:39,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-05-12 11:53:39,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 11:53:39,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 11:53:39,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 11:53:39,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 11:53:39,788 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-12 11:53:39,789 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-12 11:53:39,789 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-12 11:53:39,789 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-12 11:53:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-12 11:53:39,790 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-12 11:53:39,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 11:53:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 11:53:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 11:53:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-05-12 11:53:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 11:53:39,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 11:53:39,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 11:53:39,793 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 11:53:39,891 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 11:53:39,893 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 11:53:41,154 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 11:53:41,154 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 11:53:41,448 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 11:53:41,448 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 11:53:41,449 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:53:41 BoogieIcfgContainer [2024-05-12 11:53:41,449 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 11:53:41,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 11:53:41,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 11:53:41,454 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 11:53:41,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 11:53:38" (1/4) ... [2024-05-12 11:53:41,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6598c3df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:53:41, skipping insertion in model container [2024-05-12 11:53:41,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:53:38" (2/4) ... [2024-05-12 11:53:41,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6598c3df and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 11:53:41, skipping insertion in model container [2024-05-12 11:53:41,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:53:39" (3/4) ... [2024-05-12 11:53:41,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6598c3df and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 11:53:41, skipping insertion in model container [2024-05-12 11:53:41,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:53:41" (4/4) ... [2024-05-12 11:53:41,457 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_power.oepc_pso.oepc_rmo.oepc.i [2024-05-12 11:53:41,470 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 11:53:41,470 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-05-12 11:53:41,470 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 11:53:41,612 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 11:53:41,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 49 transitions, 110 flow [2024-05-12 11:53:41,686 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2024-05-12 11:53:41,686 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:53:41,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2024-05-12 11:53:41,690 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 49 transitions, 110 flow [2024-05-12 11:53:41,694 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 46 transitions, 101 flow [2024-05-12 11:53:41,704 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 11:53:41,712 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;@27575e47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 11:53:41,713 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-05-12 11:53:41,717 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 11:53:41,717 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 11:53:41,717 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:53:41,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:53:41,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 11:53:41,718 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:53:41,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:53:41,721 INFO L85 PathProgramCache]: Analyzing trace with hash -2083500291, now seen corresponding path program 1 times [2024-05-12 11:53:41,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:53:41,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871067496] [2024-05-12 11:53:41,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:53:41,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:53:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:53:42,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:53:42,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:53:42,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871067496] [2024-05-12 11:53:42,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871067496] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:53:42,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:53:42,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 11:53:42,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948810076] [2024-05-12 11:53:42,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:53:42,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:53:42,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:53:42,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:53:42,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:53:42,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 49 [2024-05-12 11:53:42,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:53:42,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:53:42,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 49 [2024-05-12 11:53:42,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:53:42,538 INFO L124 PetriNetUnfolderBase]: 637/1223 cut-off events. [2024-05-12 11:53:42,538 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-05-12 11:53:42,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2238 conditions, 1223 events. 637/1223 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7544 event pairs, 489 based on Foata normal form. 36/1202 useless extension candidates. Maximal degree in co-relation 2223. Up to 793 conditions per place. [2024-05-12 11:53:42,550 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 35 selfloop transitions, 2 changer transitions 2/60 dead transitions. [2024-05-12 11:53:42,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 60 transitions, 213 flow [2024-05-12 11:53:42,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:53:42,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:53:42,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-05-12 11:53:42,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7755102040816326 [2024-05-12 11:53:42,561 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 101 flow. Second operand 3 states and 114 transitions. [2024-05-12 11:53:42,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 60 transitions, 213 flow [2024-05-12 11:53:42,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 208 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-05-12 11:53:42,568 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 96 flow [2024-05-12 11:53:42,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2024-05-12 11:53:42,572 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -2 predicate places. [2024-05-12 11:53:42,572 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 96 flow [2024-05-12 11:53:42,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:53:42,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:53:42,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 11:53:42,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 11:53:42,573 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:53:42,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:53:42,574 INFO L85 PathProgramCache]: Analyzing trace with hash -2083500349, now seen corresponding path program 1 times [2024-05-12 11:53:42,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:53:42,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120582925] [2024-05-12 11:53:42,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:53:42,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:53:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:53:48,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:53:48,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:53:48,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120582925] [2024-05-12 11:53:48,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120582925] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:53:48,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:53:48,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 11:53:48,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301945554] [2024-05-12 11:53:48,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:53:48,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:53:48,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:53:48,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:53:48,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:53:48,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:53:48,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:53:48,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:53:48,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:53:48,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:53:49,514 INFO L124 PetriNetUnfolderBase]: 3819/5688 cut-off events. [2024-05-12 11:53:49,515 INFO L125 PetriNetUnfolderBase]: For 277/277 co-relation queries the response was YES. [2024-05-12 11:53:49,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11554 conditions, 5688 events. 3819/5688 cut-off events. For 277/277 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 31558 event pairs, 2393 based on Foata normal form. 1/5609 useless extension candidates. Maximal degree in co-relation 11540. Up to 5486 conditions per place. [2024-05-12 11:53:49,541 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 42 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2024-05-12 11:53:49,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 56 transitions, 220 flow [2024-05-12 11:53:49,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:53:49,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:53:49,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-05-12 11:53:49,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5986394557823129 [2024-05-12 11:53:49,544 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 96 flow. Second operand 3 states and 88 transitions. [2024-05-12 11:53:49,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 56 transitions, 220 flow [2024-05-12 11:53:49,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 56 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 11:53:49,546 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 122 flow [2024-05-12 11:53:49,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2024-05-12 11:53:49,547 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -2 predicate places. [2024-05-12 11:53:49,547 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 122 flow [2024-05-12 11:53:49,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:53:49,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:53:49,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:53:49,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 11:53:49,548 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:53:49,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:53:49,548 INFO L85 PathProgramCache]: Analyzing trace with hash -789038975, now seen corresponding path program 1 times [2024-05-12 11:53:49,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:53:49,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905732668] [2024-05-12 11:53:49,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:53:49,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:53:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:53:54,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:53:54,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:53:54,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905732668] [2024-05-12 11:53:54,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905732668] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:53:54,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:53:54,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 11:53:54,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76361966] [2024-05-12 11:53:54,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:53:54,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 11:53:54,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:53:54,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 11:53:54,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 11:53:54,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:53:54,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:53:54,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:53:54,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:53:54,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:53:56,191 INFO L124 PetriNetUnfolderBase]: 3818/6211 cut-off events. [2024-05-12 11:53:56,191 INFO L125 PetriNetUnfolderBase]: For 848/848 co-relation queries the response was YES. [2024-05-12 11:53:56,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12878 conditions, 6211 events. 3818/6211 cut-off events. For 848/848 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 39024 event pairs, 2370 based on Foata normal form. 3/5996 useless extension candidates. Maximal degree in co-relation 12863. Up to 5467 conditions per place. [2024-05-12 11:53:56,221 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 53 selfloop transitions, 8 changer transitions 0/71 dead transitions. [2024-05-12 11:53:56,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 71 transitions, 315 flow [2024-05-12 11:53:56,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 11:53:56,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 11:53:56,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2024-05-12 11:53:56,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.576530612244898 [2024-05-12 11:53:56,226 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 122 flow. Second operand 4 states and 113 transitions. [2024-05-12 11:53:56,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 71 transitions, 315 flow [2024-05-12 11:53:56,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 71 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 11:53:56,229 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 187 flow [2024-05-12 11:53:56,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=187, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2024-05-12 11:53:56,230 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2024-05-12 11:53:56,230 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 187 flow [2024-05-12 11:53:56,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:53:56,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:53:56,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:53:56,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 11:53:56,231 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:53:56,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:53:56,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1309596782, now seen corresponding path program 1 times [2024-05-12 11:53:56,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:53:56,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212699639] [2024-05-12 11:53:56,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:53:56,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:53:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:54:00,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:54:00,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:54:00,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212699639] [2024-05-12 11:54:00,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212699639] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:54:00,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:54:00,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 11:54:00,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98800915] [2024-05-12 11:54:00,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:54:00,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 11:54:00,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:54:00,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 11:54:00,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 11:54:01,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:54:01,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 187 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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-05-12 11:54:01,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:54:01,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:54:01,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:54:02,447 INFO L124 PetriNetUnfolderBase]: 3850/6335 cut-off events. [2024-05-12 11:54:02,448 INFO L125 PetriNetUnfolderBase]: For 2557/2557 co-relation queries the response was YES. [2024-05-12 11:54:02,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14410 conditions, 6335 events. 3850/6335 cut-off events. For 2557/2557 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 40111 event pairs, 2344 based on Foata normal form. 5/6130 useless extension candidates. Maximal degree in co-relation 14392. Up to 5419 conditions per place. [2024-05-12 11:54:02,488 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 69 selfloop transitions, 18 changer transitions 0/97 dead transitions. [2024-05-12 11:54:02,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 97 transitions, 503 flow [2024-05-12 11:54:02,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:54:02,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:54:02,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2024-05-12 11:54:02,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-05-12 11:54:02,490 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 187 flow. Second operand 5 states and 147 transitions. [2024-05-12 11:54:02,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 97 transitions, 503 flow [2024-05-12 11:54:02,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 97 transitions, 492 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-05-12 11:54:02,497 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 301 flow [2024-05-12 11:54:02,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=301, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2024-05-12 11:54:02,498 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2024-05-12 11:54:02,498 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 301 flow [2024-05-12 11:54:02,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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-05-12 11:54:02,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:54:02,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:54:02,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 11:54:02,499 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:54:02,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:54:02,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1970501470, now seen corresponding path program 1 times [2024-05-12 11:54:02,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:54:02,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661720143] [2024-05-12 11:54:02,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:54:02,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:54:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:54:07,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:54:07,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:54:07,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661720143] [2024-05-12 11:54:07,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661720143] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:54:07,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:54:07,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:54:07,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474585259] [2024-05-12 11:54:07,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:54:07,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:54:07,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:54:07,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:54:07,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:54:07,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:54:07,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 301 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:54:07,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:54:07,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:54:07,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:54:09,185 INFO L124 PetriNetUnfolderBase]: 3872/5886 cut-off events. [2024-05-12 11:54:09,185 INFO L125 PetriNetUnfolderBase]: For 6312/6315 co-relation queries the response was YES. [2024-05-12 11:54:09,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16283 conditions, 5886 events. 3872/5886 cut-off events. For 6312/6315 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 33736 event pairs, 1402 based on Foata normal form. 7/5825 useless extension candidates. Maximal degree in co-relation 16261. Up to 5385 conditions per place. [2024-05-12 11:54:09,214 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 81 selfloop transitions, 33 changer transitions 0/124 dead transitions. [2024-05-12 11:54:09,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 124 transitions, 761 flow [2024-05-12 11:54:09,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:54:09,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:54:09,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 175 transitions. [2024-05-12 11:54:09,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2024-05-12 11:54:09,216 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 301 flow. Second operand 6 states and 175 transitions. [2024-05-12 11:54:09,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 124 transitions, 761 flow [2024-05-12 11:54:09,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 124 transitions, 753 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-05-12 11:54:09,221 INFO L231 Difference]: Finished difference. Result has 72 places, 80 transitions, 511 flow [2024-05-12 11:54:09,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=511, PETRI_PLACES=72, PETRI_TRANSITIONS=80} [2024-05-12 11:54:09,222 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 17 predicate places. [2024-05-12 11:54:09,222 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 80 transitions, 511 flow [2024-05-12 11:54:09,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:54:09,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:54:09,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:54:09,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 11:54:09,223 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:54:09,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:54:09,223 INFO L85 PathProgramCache]: Analyzing trace with hash 956004719, now seen corresponding path program 1 times [2024-05-12 11:54:09,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:54:09,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074162179] [2024-05-12 11:54:09,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:54:09,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:54:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:54:14,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:54:14,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:54:14,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074162179] [2024-05-12 11:54:14,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074162179] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:54:14,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:54:14,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:54:14,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059334278] [2024-05-12 11:54:14,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:54:14,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:54:14,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:54:14,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:54:14,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:54:14,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:54:14,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 80 transitions, 511 flow. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:54:14,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:54:14,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:54:14,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:54:16,397 INFO L124 PetriNetUnfolderBase]: 3899/5927 cut-off events. [2024-05-12 11:54:16,398 INFO L125 PetriNetUnfolderBase]: For 12664/12670 co-relation queries the response was YES. [2024-05-12 11:54:16,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19065 conditions, 5927 events. 3899/5927 cut-off events. For 12664/12670 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 34017 event pairs, 1092 based on Foata normal form. 14/5873 useless extension candidates. Maximal degree in co-relation 19037. Up to 5350 conditions per place. [2024-05-12 11:54:16,428 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 88 selfloop transitions, 36 changer transitions 0/134 dead transitions. [2024-05-12 11:54:16,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 134 transitions, 957 flow [2024-05-12 11:54:16,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:54:16,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:54:16,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 198 transitions. [2024-05-12 11:54:16,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.577259475218659 [2024-05-12 11:54:16,430 INFO L175 Difference]: Start difference. First operand has 72 places, 80 transitions, 511 flow. Second operand 7 states and 198 transitions. [2024-05-12 11:54:16,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 134 transitions, 957 flow [2024-05-12 11:54:16,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 134 transitions, 923 flow, removed 17 selfloop flow, removed 0 redundant places. [2024-05-12 11:54:16,440 INFO L231 Difference]: Finished difference. Result has 78 places, 82 transitions, 581 flow [2024-05-12 11:54:16,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=581, PETRI_PLACES=78, PETRI_TRANSITIONS=82} [2024-05-12 11:54:16,441 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 23 predicate places. [2024-05-12 11:54:16,441 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 82 transitions, 581 flow [2024-05-12 11:54:16,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:54:16,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:54:16,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:54:16,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 11:54:16,442 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:54:16,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:54:16,442 INFO L85 PathProgramCache]: Analyzing trace with hash -596312106, now seen corresponding path program 1 times [2024-05-12 11:54:16,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:54:16,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720210704] [2024-05-12 11:54:16,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:54:16,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:54:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:54:27,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:54:27,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:54:27,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720210704] [2024-05-12 11:54:27,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720210704] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:54:27,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:54:27,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:54:27,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376457902] [2024-05-12 11:54:27,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:54:27,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:54:27,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:54:27,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:54:27,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:54:27,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:54:27,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 82 transitions, 581 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:54:27,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:54:27,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:54:27,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:54:29,807 INFO L124 PetriNetUnfolderBase]: 4541/7399 cut-off events. [2024-05-12 11:54:29,807 INFO L125 PetriNetUnfolderBase]: For 15953/15953 co-relation queries the response was YES. [2024-05-12 11:54:29,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22466 conditions, 7399 events. 4541/7399 cut-off events. For 15953/15953 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 47105 event pairs, 1945 based on Foata normal form. 2/7181 useless extension candidates. Maximal degree in co-relation 22435. Up to 6479 conditions per place. [2024-05-12 11:54:29,843 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 76 selfloop transitions, 14 changer transitions 0/99 dead transitions. [2024-05-12 11:54:29,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 99 transitions, 801 flow [2024-05-12 11:54:29,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:54:29,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:54:29,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2024-05-12 11:54:29,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2024-05-12 11:54:29,845 INFO L175 Difference]: Start difference. First operand has 78 places, 82 transitions, 581 flow. Second operand 5 states and 120 transitions. [2024-05-12 11:54:29,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 99 transitions, 801 flow [2024-05-12 11:54:29,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 99 transitions, 711 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-05-12 11:54:29,854 INFO L231 Difference]: Finished difference. Result has 78 places, 82 transitions, 531 flow [2024-05-12 11:54:29,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=531, PETRI_PLACES=78, PETRI_TRANSITIONS=82} [2024-05-12 11:54:29,855 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 23 predicate places. [2024-05-12 11:54:29,855 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 82 transitions, 531 flow [2024-05-12 11:54:29,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:54:29,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:54:29,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:54:29,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 11:54:29,856 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:54:29,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:54:29,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1306842295, now seen corresponding path program 1 times [2024-05-12 11:54:29,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:54:29,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941805643] [2024-05-12 11:54:29,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:54:29,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:54:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:54:42,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:54:42,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:54:42,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941805643] [2024-05-12 11:54:42,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941805643] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:54:42,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:54:42,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:54:42,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718689546] [2024-05-12 11:54:42,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:54:42,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:54:42,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:54:42,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:54:42,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:54:42,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:54:42,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 82 transitions, 531 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:54:42,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:54:42,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:54:42,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:54:44,568 INFO L124 PetriNetUnfolderBase]: 4569/7471 cut-off events. [2024-05-12 11:54:44,569 INFO L125 PetriNetUnfolderBase]: For 17084/17084 co-relation queries the response was YES. [2024-05-12 11:54:44,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22432 conditions, 7471 events. 4569/7471 cut-off events. For 17084/17084 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 47709 event pairs, 1838 based on Foata normal form. 6/7288 useless extension candidates. Maximal degree in co-relation 22399. Up to 6397 conditions per place. [2024-05-12 11:54:44,608 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 94 selfloop transitions, 21 changer transitions 0/124 dead transitions. [2024-05-12 11:54:44,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 124 transitions, 931 flow [2024-05-12 11:54:44,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:54:44,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:54:44,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-05-12 11:54:44,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5136054421768708 [2024-05-12 11:54:44,610 INFO L175 Difference]: Start difference. First operand has 78 places, 82 transitions, 531 flow. Second operand 6 states and 151 transitions. [2024-05-12 11:54:44,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 124 transitions, 931 flow [2024-05-12 11:54:44,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 124 transitions, 892 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-05-12 11:54:44,622 INFO L231 Difference]: Finished difference. Result has 82 places, 93 transitions, 641 flow [2024-05-12 11:54:44,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=641, PETRI_PLACES=82, PETRI_TRANSITIONS=93} [2024-05-12 11:54:44,623 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 27 predicate places. [2024-05-12 11:54:44,623 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 93 transitions, 641 flow [2024-05-12 11:54:44,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:54:44,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:54:44,624 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:54:44,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 11:54:44,624 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:54:44,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:54:44,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1832624440, now seen corresponding path program 1 times [2024-05-12 11:54:44,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:54:44,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081084289] [2024-05-12 11:54:44,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:54:44,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:54:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:54:53,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:54:53,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:54:53,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081084289] [2024-05-12 11:54:53,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081084289] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:54:53,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:54:53,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:54:53,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188789185] [2024-05-12 11:54:53,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:54:53,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:54:53,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:54:53,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:54:53,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:54:53,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:54:53,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 93 transitions, 641 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:54:53,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:54:53,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:54:53,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:54:56,210 INFO L124 PetriNetUnfolderBase]: 4587/7379 cut-off events. [2024-05-12 11:54:56,210 INFO L125 PetriNetUnfolderBase]: For 23148/23157 co-relation queries the response was YES. [2024-05-12 11:54:56,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24515 conditions, 7379 events. 4587/7379 cut-off events. For 23148/23157 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 45916 event pairs, 1684 based on Foata normal form. 10/7201 useless extension candidates. Maximal degree in co-relation 24480. Up to 6425 conditions per place. [2024-05-12 11:54:56,249 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 96 selfloop transitions, 21 changer transitions 0/126 dead transitions. [2024-05-12 11:54:56,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 126 transitions, 1013 flow [2024-05-12 11:54:56,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:54:56,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:54:56,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-05-12 11:54:56,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5136054421768708 [2024-05-12 11:54:56,251 INFO L175 Difference]: Start difference. First operand has 82 places, 93 transitions, 641 flow. Second operand 6 states and 151 transitions. [2024-05-12 11:54:56,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 126 transitions, 1013 flow [2024-05-12 11:54:56,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 126 transitions, 995 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-05-12 11:54:56,266 INFO L231 Difference]: Finished difference. Result has 87 places, 96 transitions, 709 flow [2024-05-12 11:54:56,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=709, PETRI_PLACES=87, PETRI_TRANSITIONS=96} [2024-05-12 11:54:56,267 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 32 predicate places. [2024-05-12 11:54:56,268 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 96 transitions, 709 flow [2024-05-12 11:54:56,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:54:56,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:54:56,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:54:56,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 11:54:56,268 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:54:56,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:54:56,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1824431140, now seen corresponding path program 2 times [2024-05-12 11:54:56,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:54:56,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754416358] [2024-05-12 11:54:56,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:54:56,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:54:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:55:04,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:55:04,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:55:04,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754416358] [2024-05-12 11:55:04,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754416358] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:55:04,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:55:04,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:55:04,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831191207] [2024-05-12 11:55:04,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:55:04,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:55:04,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:55:04,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:55:04,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:55:05,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:55:05,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 96 transitions, 709 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:55:05,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:55:05,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:55:05,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:55:07,420 INFO L124 PetriNetUnfolderBase]: 4572/7479 cut-off events. [2024-05-12 11:55:07,421 INFO L125 PetriNetUnfolderBase]: For 24263/24263 co-relation queries the response was YES. [2024-05-12 11:55:07,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24638 conditions, 7479 events. 4572/7479 cut-off events. For 24263/24263 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 47760 event pairs, 1899 based on Foata normal form. 2/7292 useless extension candidates. Maximal degree in co-relation 24600. Up to 6508 conditions per place. [2024-05-12 11:55:07,461 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 97 selfloop transitions, 13 changer transitions 0/119 dead transitions. [2024-05-12 11:55:07,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 119 transitions, 987 flow [2024-05-12 11:55:07,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:55:07,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:55:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2024-05-12 11:55:07,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47959183673469385 [2024-05-12 11:55:07,463 INFO L175 Difference]: Start difference. First operand has 87 places, 96 transitions, 709 flow. Second operand 6 states and 141 transitions. [2024-05-12 11:55:07,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 119 transitions, 987 flow [2024-05-12 11:55:07,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 119 transitions, 954 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-05-12 11:55:07,481 INFO L231 Difference]: Finished difference. Result has 90 places, 96 transitions, 710 flow [2024-05-12 11:55:07,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=710, PETRI_PLACES=90, PETRI_TRANSITIONS=96} [2024-05-12 11:55:07,482 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 35 predicate places. [2024-05-12 11:55:07,482 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 96 transitions, 710 flow [2024-05-12 11:55:07,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:55:07,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:55:07,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:55:07,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 11:55:07,483 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:55:07,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:55:07,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1382603519, now seen corresponding path program 1 times [2024-05-12 11:55:07,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:55:07,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474265667] [2024-05-12 11:55:07,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:55:07,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:55:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:55:17,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:55:17,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:55:17,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474265667] [2024-05-12 11:55:17,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474265667] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:55:17,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:55:17,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:55:17,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815485197] [2024-05-12 11:55:17,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:55:17,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:55:17,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:55:17,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:55:17,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:55:17,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:55:17,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 96 transitions, 710 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:55:17,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:55:17,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:55:17,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:55:19,730 INFO L124 PetriNetUnfolderBase]: 4996/7978 cut-off events. [2024-05-12 11:55:19,730 INFO L125 PetriNetUnfolderBase]: For 27912/27912 co-relation queries the response was YES. [2024-05-12 11:55:19,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26780 conditions, 7978 events. 4996/7978 cut-off events. For 27912/27912 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 49733 event pairs, 1487 based on Foata normal form. 12/7794 useless extension candidates. Maximal degree in co-relation 26741. Up to 6382 conditions per place. [2024-05-12 11:55:19,774 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 129 selfloop transitions, 37 changer transitions 0/175 dead transitions. [2024-05-12 11:55:19,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 175 transitions, 1458 flow [2024-05-12 11:55:19,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:55:19,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:55:19,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2024-05-12 11:55:19,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2024-05-12 11:55:19,778 INFO L175 Difference]: Start difference. First operand has 90 places, 96 transitions, 710 flow. Second operand 8 states and 210 transitions. [2024-05-12 11:55:19,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 175 transitions, 1458 flow [2024-05-12 11:55:19,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 175 transitions, 1402 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-05-12 11:55:19,805 INFO L231 Difference]: Finished difference. Result has 96 places, 120 transitions, 978 flow [2024-05-12 11:55:19,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=978, PETRI_PLACES=96, PETRI_TRANSITIONS=120} [2024-05-12 11:55:19,806 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 41 predicate places. [2024-05-12 11:55:19,806 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 120 transitions, 978 flow [2024-05-12 11:55:19,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:55:19,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:55:19,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:55:19,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 11:55:19,807 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:55:19,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:55:19,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1741053403, now seen corresponding path program 2 times [2024-05-12 11:55:19,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:55:19,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349713814] [2024-05-12 11:55:19,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:55:19,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:55:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:55:29,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-05-12 11:55:29,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:55:29,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349713814] [2024-05-12 11:55:29,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349713814] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:55:29,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:55:29,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:55:29,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356593855] [2024-05-12 11:55:29,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:55:29,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:55:29,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:55:29,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:55:29,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:55:29,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:55:29,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 120 transitions, 978 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:55:29,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:55:29,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:55:29,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:55:31,705 INFO L124 PetriNetUnfolderBase]: 5080/8249 cut-off events. [2024-05-12 11:55:31,705 INFO L125 PetriNetUnfolderBase]: For 41067/41067 co-relation queries the response was YES. [2024-05-12 11:55:31,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31908 conditions, 8249 events. 5080/8249 cut-off events. For 41067/41067 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 52969 event pairs, 1829 based on Foata normal form. 6/8048 useless extension candidates. Maximal degree in co-relation 31865. Up to 6988 conditions per place. [2024-05-12 11:55:31,756 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 132 selfloop transitions, 27 changer transitions 0/168 dead transitions. [2024-05-12 11:55:31,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 168 transitions, 1582 flow [2024-05-12 11:55:31,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:55:31,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:55:31,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2024-05-12 11:55:31,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5131195335276968 [2024-05-12 11:55:31,758 INFO L175 Difference]: Start difference. First operand has 96 places, 120 transitions, 978 flow. Second operand 7 states and 176 transitions. [2024-05-12 11:55:31,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 168 transitions, 1582 flow [2024-05-12 11:55:31,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 168 transitions, 1538 flow, removed 21 selfloop flow, removed 1 redundant places. [2024-05-12 11:55:31,789 INFO L231 Difference]: Finished difference. Result has 103 places, 128 transitions, 1090 flow [2024-05-12 11:55:31,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=942, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1090, PETRI_PLACES=103, PETRI_TRANSITIONS=128} [2024-05-12 11:55:31,789 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 48 predicate places. [2024-05-12 11:55:31,790 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 128 transitions, 1090 flow [2024-05-12 11:55:31,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:55:31,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:55:31,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:55:31,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 11:55:31,790 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:55:31,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:55:31,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1740787423, now seen corresponding path program 3 times [2024-05-12 11:55:31,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:55:31,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340030511] [2024-05-12 11:55:31,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:55:31,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:55:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:55:40,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:55:40,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:55:40,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340030511] [2024-05-12 11:55:40,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340030511] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:55:40,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:55:40,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:55:40,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639052533] [2024-05-12 11:55:40,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:55:40,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:55:40,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:55:40,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:55:40,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:55:40,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:55:40,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 128 transitions, 1090 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:55:40,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:55:40,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:55:40,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:55:43,385 INFO L124 PetriNetUnfolderBase]: 5108/8291 cut-off events. [2024-05-12 11:55:43,386 INFO L125 PetriNetUnfolderBase]: For 47698/47698 co-relation queries the response was YES. [2024-05-12 11:55:43,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33137 conditions, 8291 events. 5108/8291 cut-off events. For 47698/47698 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 53233 event pairs, 1827 based on Foata normal form. 6/8090 useless extension candidates. Maximal degree in co-relation 33090. Up to 7155 conditions per place. [2024-05-12 11:55:43,433 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 133 selfloop transitions, 26 changer transitions 0/168 dead transitions. [2024-05-12 11:55:43,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 168 transitions, 1613 flow [2024-05-12 11:55:43,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:55:43,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:55:43,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2024-05-12 11:55:43,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49854227405247814 [2024-05-12 11:55:43,435 INFO L175 Difference]: Start difference. First operand has 103 places, 128 transitions, 1090 flow. Second operand 7 states and 171 transitions. [2024-05-12 11:55:43,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 168 transitions, 1613 flow [2024-05-12 11:55:43,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 168 transitions, 1563 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-05-12 11:55:43,473 INFO L231 Difference]: Finished difference. Result has 109 places, 136 transitions, 1208 flow [2024-05-12 11:55:43,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1044, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1208, PETRI_PLACES=109, PETRI_TRANSITIONS=136} [2024-05-12 11:55:43,474 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 54 predicate places. [2024-05-12 11:55:43,474 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 136 transitions, 1208 flow [2024-05-12 11:55:43,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:55:43,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:55:43,474 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:55:43,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 11:55:43,475 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:55:43,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:55:43,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1740777534, now seen corresponding path program 1 times [2024-05-12 11:55:43,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:55:43,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207715450] [2024-05-12 11:55:43,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:55:43,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:55:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:55:55,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:55:55,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:55:55,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207715450] [2024-05-12 11:55:55,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207715450] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:55:55,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:55:55,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:55:55,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776306702] [2024-05-12 11:55:55,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:55:55,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:55:55,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:55:55,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:55:55,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:55:55,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:55:55,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 136 transitions, 1208 flow. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:55:55,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:55:55,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:55:55,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:55:58,174 INFO L124 PetriNetUnfolderBase]: 5131/8348 cut-off events. [2024-05-12 11:55:58,174 INFO L125 PetriNetUnfolderBase]: For 51128/51128 co-relation queries the response was YES. [2024-05-12 11:55:58,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33812 conditions, 8348 events. 5131/8348 cut-off events. For 51128/51128 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 53874 event pairs, 1766 based on Foata normal form. 6/8138 useless extension candidates. Maximal degree in co-relation 33761. Up to 7108 conditions per place. [2024-05-12 11:55:58,230 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 136 selfloop transitions, 33 changer transitions 0/178 dead transitions. [2024-05-12 11:55:58,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 178 transitions, 1742 flow [2024-05-12 11:55:58,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:55:58,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:55:58,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2024-05-12 11:55:58,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2024-05-12 11:55:58,234 INFO L175 Difference]: Start difference. First operand has 109 places, 136 transitions, 1208 flow. Second operand 7 states and 175 transitions. [2024-05-12 11:55:58,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 178 transitions, 1742 flow [2024-05-12 11:55:58,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 178 transitions, 1677 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-05-12 11:55:58,269 INFO L231 Difference]: Finished difference. Result has 112 places, 139 transitions, 1255 flow [2024-05-12 11:55:58,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1143, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1255, PETRI_PLACES=112, PETRI_TRANSITIONS=139} [2024-05-12 11:55:58,271 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 57 predicate places. [2024-05-12 11:55:58,271 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 139 transitions, 1255 flow [2024-05-12 11:55:58,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:55:58,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:55:58,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:55:58,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 11:55:58,272 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:55:58,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:55:58,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1395292197, now seen corresponding path program 1 times [2024-05-12 11:55:58,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:55:58,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535287413] [2024-05-12 11:55:58,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:55:58,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:55:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:56:11,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:56:11,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:56:11,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535287413] [2024-05-12 11:56:11,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535287413] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:56:11,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:56:11,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:56:11,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203399648] [2024-05-12 11:56:11,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:56:11,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:56:11,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:56:11,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:56:11,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:56:12,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:56:12,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 139 transitions, 1255 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:56:12,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:56:12,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:56:12,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:56:14,526 INFO L124 PetriNetUnfolderBase]: 5128/8332 cut-off events. [2024-05-12 11:56:14,526 INFO L125 PetriNetUnfolderBase]: For 55357/55357 co-relation queries the response was YES. [2024-05-12 11:56:14,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34558 conditions, 8332 events. 5128/8332 cut-off events. For 55357/55357 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 53619 event pairs, 1834 based on Foata normal form. 1/8122 useless extension candidates. Maximal degree in co-relation 34506. Up to 7288 conditions per place. [2024-05-12 11:56:14,581 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 130 selfloop transitions, 14 changer transitions 0/153 dead transitions. [2024-05-12 11:56:14,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 153 transitions, 1575 flow [2024-05-12 11:56:14,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:56:14,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:56:14,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2024-05-12 11:56:14,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47346938775510206 [2024-05-12 11:56:14,583 INFO L175 Difference]: Start difference. First operand has 112 places, 139 transitions, 1255 flow. Second operand 5 states and 116 transitions. [2024-05-12 11:56:14,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 153 transitions, 1575 flow [2024-05-12 11:56:14,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 153 transitions, 1473 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-05-12 11:56:14,626 INFO L231 Difference]: Finished difference. Result has 112 places, 139 transitions, 1191 flow [2024-05-12 11:56:14,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1191, PETRI_PLACES=112, PETRI_TRANSITIONS=139} [2024-05-12 11:56:14,626 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 57 predicate places. [2024-05-12 11:56:14,627 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 139 transitions, 1191 flow [2024-05-12 11:56:14,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:56:14,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:56:14,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:56:14,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 11:56:14,627 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:56:14,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:56:14,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1505721649, now seen corresponding path program 1 times [2024-05-12 11:56:14,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:56:14,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30006156] [2024-05-12 11:56:14,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:56:14,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:56:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:56:26,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:56:26,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:56:26,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30006156] [2024-05-12 11:56:26,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30006156] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:56:26,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:56:26,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:56:26,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295194988] [2024-05-12 11:56:26,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:56:26,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:56:26,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:56:26,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:56:26,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:56:26,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:56:26,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 139 transitions, 1191 flow. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:56:26,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:56:26,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:56:26,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:56:29,046 INFO L124 PetriNetUnfolderBase]: 5138/8230 cut-off events. [2024-05-12 11:56:29,046 INFO L125 PetriNetUnfolderBase]: For 56780/56780 co-relation queries the response was YES. [2024-05-12 11:56:29,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34349 conditions, 8230 events. 5138/8230 cut-off events. For 56780/56780 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 51726 event pairs, 1550 based on Foata normal form. 2/8017 useless extension candidates. Maximal degree in co-relation 34296. Up to 7117 conditions per place. [2024-05-12 11:56:29,107 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 161 selfloop transitions, 29 changer transitions 0/199 dead transitions. [2024-05-12 11:56:29,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 199 transitions, 1785 flow [2024-05-12 11:56:29,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:56:29,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:56:29,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 220 transitions. [2024-05-12 11:56:29,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4988662131519274 [2024-05-12 11:56:29,121 INFO L175 Difference]: Start difference. First operand has 112 places, 139 transitions, 1191 flow. Second operand 9 states and 220 transitions. [2024-05-12 11:56:29,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 199 transitions, 1785 flow [2024-05-12 11:56:29,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 199 transitions, 1742 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-05-12 11:56:29,169 INFO L231 Difference]: Finished difference. Result has 118 places, 146 transitions, 1292 flow [2024-05-12 11:56:29,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1148, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1292, PETRI_PLACES=118, PETRI_TRANSITIONS=146} [2024-05-12 11:56:29,170 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 63 predicate places. [2024-05-12 11:56:29,170 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 146 transitions, 1292 flow [2024-05-12 11:56:29,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:56:29,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:56:29,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:56:29,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 11:56:29,171 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:56:29,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:56:29,172 INFO L85 PathProgramCache]: Analyzing trace with hash -220769128, now seen corresponding path program 1 times [2024-05-12 11:56:29,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:56:29,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869352457] [2024-05-12 11:56:29,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:56:29,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:56:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:56:39,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:56:39,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:56:39,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869352457] [2024-05-12 11:56:39,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869352457] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:56:39,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:56:39,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:56:39,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653516960] [2024-05-12 11:56:39,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:56:39,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:56:39,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:56:39,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:56:39,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:56:39,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:56:39,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 146 transitions, 1292 flow. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:56:39,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:56:39,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:56:39,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:56:41,933 INFO L124 PetriNetUnfolderBase]: 5318/8458 cut-off events. [2024-05-12 11:56:41,933 INFO L125 PetriNetUnfolderBase]: For 66738/66741 co-relation queries the response was YES. [2024-05-12 11:56:41,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36904 conditions, 8458 events. 5318/8458 cut-off events. For 66738/66741 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 52843 event pairs, 1484 based on Foata normal form. 8/8261 useless extension candidates. Maximal degree in co-relation 36850. Up to 6607 conditions per place. [2024-05-12 11:56:41,989 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 140 selfloop transitions, 52 changer transitions 0/201 dead transitions. [2024-05-12 11:56:41,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 201 transitions, 2086 flow [2024-05-12 11:56:41,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:56:41,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:56:41,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 186 transitions. [2024-05-12 11:56:41,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5422740524781341 [2024-05-12 11:56:41,990 INFO L175 Difference]: Start difference. First operand has 118 places, 146 transitions, 1292 flow. Second operand 7 states and 186 transitions. [2024-05-12 11:56:41,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 201 transitions, 2086 flow [2024-05-12 11:56:42,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 201 transitions, 2008 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-05-12 11:56:42,040 INFO L231 Difference]: Finished difference. Result has 121 places, 155 transitions, 1480 flow [2024-05-12 11:56:42,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1214, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1480, PETRI_PLACES=121, PETRI_TRANSITIONS=155} [2024-05-12 11:56:42,042 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 66 predicate places. [2024-05-12 11:56:42,042 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 155 transitions, 1480 flow [2024-05-12 11:56:42,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:56:42,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:56:42,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:56:42,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 11:56:42,043 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:56:42,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:56:42,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1505869674, now seen corresponding path program 2 times [2024-05-12 11:56:42,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:56:42,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659232461] [2024-05-12 11:56:42,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:56:42,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:56:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:56:52,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:56:52,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:56:52,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659232461] [2024-05-12 11:56:52,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659232461] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:56:52,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:56:52,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:56:52,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096546282] [2024-05-12 11:56:52,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:56:52,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:56:52,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:56:52,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:56:52,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:56:52,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:56:52,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 155 transitions, 1480 flow. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:56:52,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:56:52,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:56:52,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:56:54,757 INFO L124 PetriNetUnfolderBase]: 5306/8450 cut-off events. [2024-05-12 11:56:54,758 INFO L125 PetriNetUnfolderBase]: For 76488/76491 co-relation queries the response was YES. [2024-05-12 11:56:54,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38777 conditions, 8450 events. 5306/8450 cut-off events. For 76488/76491 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 52907 event pairs, 1493 based on Foata normal form. 8/8251 useless extension candidates. Maximal degree in co-relation 38720. Up to 6601 conditions per place. [2024-05-12 11:56:54,825 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 141 selfloop transitions, 55 changer transitions 0/205 dead transitions. [2024-05-12 11:56:54,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 205 transitions, 2200 flow [2024-05-12 11:56:54,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:56:54,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:56:54,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 189 transitions. [2024-05-12 11:56:54,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5510204081632653 [2024-05-12 11:56:54,827 INFO L175 Difference]: Start difference. First operand has 121 places, 155 transitions, 1480 flow. Second operand 7 states and 189 transitions. [2024-05-12 11:56:54,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 205 transitions, 2200 flow [2024-05-12 11:56:54,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 205 transitions, 2099 flow, removed 24 selfloop flow, removed 3 redundant places. [2024-05-12 11:56:54,918 INFO L231 Difference]: Finished difference. Result has 127 places, 158 transitions, 1594 flow [2024-05-12 11:56:54,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1380, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1594, PETRI_PLACES=127, PETRI_TRANSITIONS=158} [2024-05-12 11:56:54,918 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 72 predicate places. [2024-05-12 11:56:54,918 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 158 transitions, 1594 flow [2024-05-12 11:56:54,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:56:54,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:56:54,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:56:54,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 11:56:54,919 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:56:54,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:56:54,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1226297870, now seen corresponding path program 3 times [2024-05-12 11:56:54,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:56:54,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115074753] [2024-05-12 11:56:54,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:56:54,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:56:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:57:02,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:57:02,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:57:02,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115074753] [2024-05-12 11:57:02,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115074753] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:57:02,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:57:02,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:57:02,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623309847] [2024-05-12 11:57:02,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:57:02,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 11:57:02,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:57:02,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 11:57:02,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 11:57:02,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:57:02,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 158 transitions, 1594 flow. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:57:02,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:57:02,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:57:02,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:57:05,315 INFO L124 PetriNetUnfolderBase]: 5334/8372 cut-off events. [2024-05-12 11:57:05,315 INFO L125 PetriNetUnfolderBase]: For 82609/82621 co-relation queries the response was YES. [2024-05-12 11:57:05,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39802 conditions, 8372 events. 5334/8372 cut-off events. For 82609/82621 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 51834 event pairs, 1824 based on Foata normal form. 14/8246 useless extension candidates. Maximal degree in co-relation 39742. Up to 7396 conditions per place. [2024-05-12 11:57:05,380 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 159 selfloop transitions, 28 changer transitions 0/196 dead transitions. [2024-05-12 11:57:05,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 196 transitions, 2162 flow [2024-05-12 11:57:05,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:57:05,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:57:05,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2024-05-12 11:57:05,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5043731778425656 [2024-05-12 11:57:05,382 INFO L175 Difference]: Start difference. First operand has 127 places, 158 transitions, 1594 flow. Second operand 7 states and 173 transitions. [2024-05-12 11:57:05,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 196 transitions, 2162 flow [2024-05-12 11:57:05,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 196 transitions, 2054 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-05-12 11:57:05,455 INFO L231 Difference]: Finished difference. Result has 129 places, 162 transitions, 1621 flow [2024-05-12 11:57:05,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1493, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1621, PETRI_PLACES=129, PETRI_TRANSITIONS=162} [2024-05-12 11:57:05,456 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 74 predicate places. [2024-05-12 11:57:05,456 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 162 transitions, 1621 flow [2024-05-12 11:57:05,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:57:05,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:57:05,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:57:05,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 11:57:05,457 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:57:05,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:57:05,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1698831277, now seen corresponding path program 1 times [2024-05-12 11:57:05,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:57:05,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30021955] [2024-05-12 11:57:05,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:57:05,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:57:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:57:14,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:57:14,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:57:14,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30021955] [2024-05-12 11:57:14,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30021955] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:57:14,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:57:14,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:57:14,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039169711] [2024-05-12 11:57:14,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:57:14,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:57:14,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:57:14,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:57:14,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:57:15,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:57:15,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 162 transitions, 1621 flow. Second operand has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:57:15,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:57:15,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:57:15,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:57:17,814 INFO L124 PetriNetUnfolderBase]: 5353/8427 cut-off events. [2024-05-12 11:57:17,815 INFO L125 PetriNetUnfolderBase]: For 87440/87440 co-relation queries the response was YES. [2024-05-12 11:57:17,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39819 conditions, 8427 events. 5353/8427 cut-off events. For 87440/87440 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 52540 event pairs, 1782 based on Foata normal form. 3/8282 useless extension candidates. Maximal degree in co-relation 39759. Up to 7437 conditions per place. [2024-05-12 11:57:17,882 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 160 selfloop transitions, 37 changer transitions 0/206 dead transitions. [2024-05-12 11:57:17,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 206 transitions, 2265 flow [2024-05-12 11:57:17,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:57:17,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:57:17,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2024-05-12 11:57:17,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5014577259475219 [2024-05-12 11:57:17,884 INFO L175 Difference]: Start difference. First operand has 129 places, 162 transitions, 1621 flow. Second operand 7 states and 172 transitions. [2024-05-12 11:57:17,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 206 transitions, 2265 flow [2024-05-12 11:57:17,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 206 transitions, 2188 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-05-12 11:57:17,968 INFO L231 Difference]: Finished difference. Result has 133 places, 175 transitions, 1816 flow [2024-05-12 11:57:17,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1544, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1816, PETRI_PLACES=133, PETRI_TRANSITIONS=175} [2024-05-12 11:57:17,969 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 78 predicate places. [2024-05-12 11:57:17,969 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 175 transitions, 1816 flow [2024-05-12 11:57:17,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:57:17,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:57:17,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:57:17,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 11:57:17,970 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:57:17,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:57:17,970 INFO L85 PathProgramCache]: Analyzing trace with hash 304386480, now seen corresponding path program 1 times [2024-05-12 11:57:17,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:57:17,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595574338] [2024-05-12 11:57:17,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:57:17,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:57:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:57:33,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-05-12 11:57:33,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:57:33,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595574338] [2024-05-12 11:57:33,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595574338] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:57:33,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:57:33,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:57:33,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866702578] [2024-05-12 11:57:33,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:57:33,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:57:33,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:57:33,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:57:33,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:57:33,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 49 [2024-05-12 11:57:33,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 175 transitions, 1816 flow. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:57:33,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:57:33,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 49 [2024-05-12 11:57:33,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:57:35,978 INFO L124 PetriNetUnfolderBase]: 5986/9173 cut-off events. [2024-05-12 11:57:35,979 INFO L125 PetriNetUnfolderBase]: For 108756/108756 co-relation queries the response was YES. [2024-05-12 11:57:36,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45570 conditions, 9173 events. 5986/9173 cut-off events. For 108756/108756 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 55688 event pairs, 2067 based on Foata normal form. 1/9007 useless extension candidates. Maximal degree in co-relation 45507. Up to 8471 conditions per place. [2024-05-12 11:57:36,057 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 172 selfloop transitions, 17 changer transitions 0/197 dead transitions. [2024-05-12 11:57:36,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 197 transitions, 2278 flow [2024-05-12 11:57:36,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:57:36,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:57:36,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2024-05-12 11:57:36,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445578231292517 [2024-05-12 11:57:36,059 INFO L175 Difference]: Start difference. First operand has 133 places, 175 transitions, 1816 flow. Second operand 6 states and 131 transitions. [2024-05-12 11:57:36,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 197 transitions, 2278 flow [2024-05-12 11:57:36,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 197 transitions, 2188 flow, removed 26 selfloop flow, removed 3 redundant places. [2024-05-12 11:57:36,150 INFO L231 Difference]: Finished difference. Result has 136 places, 178 transitions, 1803 flow [2024-05-12 11:57:36,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1726, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1803, PETRI_PLACES=136, PETRI_TRANSITIONS=178} [2024-05-12 11:57:36,151 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 81 predicate places. [2024-05-12 11:57:36,151 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 178 transitions, 1803 flow [2024-05-12 11:57:36,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:57:36,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:57:36,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:57:36,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 11:57:36,151 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:57:36,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:57:36,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1627767272, now seen corresponding path program 1 times [2024-05-12 11:57:36,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:57:36,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970941340] [2024-05-12 11:57:36,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:57:36,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:57:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:57:46,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:57:46,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:57:46,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970941340] [2024-05-12 11:57:46,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970941340] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:57:46,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:57:46,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:57:46,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745604485] [2024-05-12 11:57:46,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:57:46,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:57:46,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:57:46,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:57:46,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:57:46,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:57:46,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 178 transitions, 1803 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:57:46,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:57:46,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:57:46,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:57:49,615 INFO L124 PetriNetUnfolderBase]: 5580/8661 cut-off events. [2024-05-12 11:57:49,615 INFO L125 PetriNetUnfolderBase]: For 116541/116556 co-relation queries the response was YES. [2024-05-12 11:57:49,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44644 conditions, 8661 events. 5580/8661 cut-off events. For 116541/116556 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 53406 event pairs, 1214 based on Foata normal form. 14/8503 useless extension candidates. Maximal degree in co-relation 44580. Up to 7531 conditions per place. [2024-05-12 11:57:49,684 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 195 selfloop transitions, 31 changer transitions 0/236 dead transitions. [2024-05-12 11:57:49,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 236 transitions, 2597 flow [2024-05-12 11:57:49,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:57:49,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:57:49,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 201 transitions. [2024-05-12 11:57:49,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5127551020408163 [2024-05-12 11:57:49,689 INFO L175 Difference]: Start difference. First operand has 136 places, 178 transitions, 1803 flow. Second operand 8 states and 201 transitions. [2024-05-12 11:57:49,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 236 transitions, 2597 flow [2024-05-12 11:57:49,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 236 transitions, 2544 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-05-12 11:57:49,774 INFO L231 Difference]: Finished difference. Result has 141 places, 185 transitions, 1936 flow [2024-05-12 11:57:49,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1750, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1936, PETRI_PLACES=141, PETRI_TRANSITIONS=185} [2024-05-12 11:57:49,774 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 86 predicate places. [2024-05-12 11:57:49,775 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 185 transitions, 1936 flow [2024-05-12 11:57:49,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:57:49,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:57:49,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:57:49,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 11:57:49,777 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:57:49,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:57:49,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1655304542, now seen corresponding path program 1 times [2024-05-12 11:57:49,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:57:49,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809190464] [2024-05-12 11:57:49,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:57:49,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:57:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:57:58,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:57:58,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:57:58,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809190464] [2024-05-12 11:57:58,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809190464] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:57:58,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:57:58,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:57:58,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864101670] [2024-05-12 11:57:58,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:57:58,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:57:58,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:57:58,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:57:58,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:57:58,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 49 [2024-05-12 11:57:58,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 185 transitions, 1936 flow. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 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-05-12 11:57:58,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:57:58,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 49 [2024-05-12 11:57:58,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:58:00,611 INFO L124 PetriNetUnfolderBase]: 4926/7564 cut-off events. [2024-05-12 11:58:00,611 INFO L125 PetriNetUnfolderBase]: For 120577/120580 co-relation queries the response was YES. [2024-05-12 11:58:00,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41466 conditions, 7564 events. 4926/7564 cut-off events. For 120577/120580 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 45876 event pairs, 1043 based on Foata normal form. 6/7466 useless extension candidates. Maximal degree in co-relation 41400. Up to 5469 conditions per place. [2024-05-12 11:58:00,674 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 175 selfloop transitions, 78 changer transitions 0/264 dead transitions. [2024-05-12 11:58:00,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 264 transitions, 3215 flow [2024-05-12 11:58:00,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 11:58:00,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 11:58:00,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 208 transitions. [2024-05-12 11:58:00,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6064139941690962 [2024-05-12 11:58:00,676 INFO L175 Difference]: Start difference. First operand has 141 places, 185 transitions, 1936 flow. Second operand 7 states and 208 transitions. [2024-05-12 11:58:00,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 264 transitions, 3215 flow [2024-05-12 11:58:00,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 264 transitions, 3131 flow, removed 26 selfloop flow, removed 4 redundant places. [2024-05-12 11:58:00,781 INFO L231 Difference]: Finished difference. Result has 147 places, 202 transitions, 2288 flow [2024-05-12 11:58:00,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1855, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2288, PETRI_PLACES=147, PETRI_TRANSITIONS=202} [2024-05-12 11:58:00,782 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 92 predicate places. [2024-05-12 11:58:00,782 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 202 transitions, 2288 flow [2024-05-12 11:58:00,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 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-05-12 11:58:00,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:58:00,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:58:00,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 11:58:00,783 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:58:00,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:58:00,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1627827722, now seen corresponding path program 2 times [2024-05-12 11:58:00,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:58:00,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924477216] [2024-05-12 11:58:00,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:58:00,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:58:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:58:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:58:12,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:58:12,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924477216] [2024-05-12 11:58:12,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924477216] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:58:12,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:58:12,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:58:12,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433189317] [2024-05-12 11:58:12,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:58:12,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:58:12,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:58:12,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:58:12,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:58:12,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:58:12,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 202 transitions, 2288 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:58:12,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:58:12,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:58:12,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:58:15,694 INFO L124 PetriNetUnfolderBase]: 5771/8656 cut-off events. [2024-05-12 11:58:15,694 INFO L125 PetriNetUnfolderBase]: For 146772/146787 co-relation queries the response was YES. [2024-05-12 11:58:15,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50382 conditions, 8656 events. 5771/8656 cut-off events. For 146772/146787 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 50544 event pairs, 1278 based on Foata normal form. 14/8597 useless extension candidates. Maximal degree in co-relation 50312. Up to 7874 conditions per place. [2024-05-12 11:58:15,764 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 202 selfloop transitions, 51 changer transitions 0/263 dead transitions. [2024-05-12 11:58:15,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 263 transitions, 3197 flow [2024-05-12 11:58:15,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:58:15,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:58:15,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions. [2024-05-12 11:58:15,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076530612244898 [2024-05-12 11:58:15,766 INFO L175 Difference]: Start difference. First operand has 147 places, 202 transitions, 2288 flow. Second operand 8 states and 199 transitions. [2024-05-12 11:58:15,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 263 transitions, 3197 flow [2024-05-12 11:58:15,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 263 transitions, 3086 flow, removed 43 selfloop flow, removed 1 redundant places. [2024-05-12 11:58:15,936 INFO L231 Difference]: Finished difference. Result has 156 places, 213 transitions, 2548 flow [2024-05-12 11:58:15,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2183, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2548, PETRI_PLACES=156, PETRI_TRANSITIONS=213} [2024-05-12 11:58:15,936 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 101 predicate places. [2024-05-12 11:58:15,936 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 213 transitions, 2548 flow [2024-05-12 11:58:15,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:58:15,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:58:15,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:58:15,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 11:58:15,937 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:58:15,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:58:15,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1652503382, now seen corresponding path program 2 times [2024-05-12 11:58:15,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:58:15,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911243973] [2024-05-12 11:58:15,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:58:15,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:58:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:58:25,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-05-12 11:58:25,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:58:25,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911243973] [2024-05-12 11:58:25,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911243973] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:58:25,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:58:25,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:58:25,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077321994] [2024-05-12 11:58:25,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:58:25,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:58:25,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:58:25,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:58:25,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:58:25,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:58:25,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 213 transitions, 2548 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:58:25,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:58:25,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:58:25,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:58:28,714 INFO L124 PetriNetUnfolderBase]: 5885/9047 cut-off events. [2024-05-12 11:58:28,714 INFO L125 PetriNetUnfolderBase]: For 159433/159433 co-relation queries the response was YES. [2024-05-12 11:58:28,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52269 conditions, 9047 events. 5885/9047 cut-off events. For 159433/159433 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 55326 event pairs, 1363 based on Foata normal form. 6/8900 useless extension candidates. Maximal degree in co-relation 52194. Up to 7281 conditions per place. [2024-05-12 11:58:28,795 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 204 selfloop transitions, 60 changer transitions 0/274 dead transitions. [2024-05-12 11:58:28,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 274 transitions, 3463 flow [2024-05-12 11:58:28,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:58:28,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:58:28,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 233 transitions. [2024-05-12 11:58:28,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.528344671201814 [2024-05-12 11:58:28,797 INFO L175 Difference]: Start difference. First operand has 156 places, 213 transitions, 2548 flow. Second operand 9 states and 233 transitions. [2024-05-12 11:58:28,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 274 transitions, 3463 flow [2024-05-12 11:58:28,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 274 transitions, 3287 flow, removed 72 selfloop flow, removed 3 redundant places. [2024-05-12 11:58:28,992 INFO L231 Difference]: Finished difference. Result has 162 places, 217 transitions, 2572 flow [2024-05-12 11:58:28,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2372, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2572, PETRI_PLACES=162, PETRI_TRANSITIONS=217} [2024-05-12 11:58:28,993 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 107 predicate places. [2024-05-12 11:58:28,993 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 217 transitions, 2572 flow [2024-05-12 11:58:28,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:58:28,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:58:28,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:58:28,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-05-12 11:58:28,995 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:58:28,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:58:28,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1630624356, now seen corresponding path program 3 times [2024-05-12 11:58:28,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:58:28,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151283268] [2024-05-12 11:58:28,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:58:28,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:58:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:58:40,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:58:40,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:58:40,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151283268] [2024-05-12 11:58:40,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151283268] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:58:40,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:58:40,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:58:40,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159671616] [2024-05-12 11:58:40,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:58:40,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:58:40,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:58:40,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:58:40,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:58:41,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:58:41,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 217 transitions, 2572 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:58:41,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:58:41,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:58:41,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:58:44,248 INFO L124 PetriNetUnfolderBase]: 6029/9241 cut-off events. [2024-05-12 11:58:44,249 INFO L125 PetriNetUnfolderBase]: For 172655/172658 co-relation queries the response was YES. [2024-05-12 11:58:44,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54761 conditions, 9241 events. 6029/9241 cut-off events. For 172655/172658 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 56429 event pairs, 1408 based on Foata normal form. 8/9097 useless extension candidates. Maximal degree in co-relation 54684. Up to 7327 conditions per place. [2024-05-12 11:58:44,338 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 203 selfloop transitions, 64 changer transitions 0/277 dead transitions. [2024-05-12 11:58:44,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 277 transitions, 3596 flow [2024-05-12 11:58:44,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:58:44,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:58:44,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 212 transitions. [2024-05-12 11:58:44,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5408163265306123 [2024-05-12 11:58:44,340 INFO L175 Difference]: Start difference. First operand has 162 places, 217 transitions, 2572 flow. Second operand 8 states and 212 transitions. [2024-05-12 11:58:44,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 277 transitions, 3596 flow [2024-05-12 11:58:44,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 277 transitions, 3433 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-05-12 11:58:44,549 INFO L231 Difference]: Finished difference. Result has 164 places, 225 transitions, 2694 flow [2024-05-12 11:58:44,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2409, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2694, PETRI_PLACES=164, PETRI_TRANSITIONS=225} [2024-05-12 11:58:44,550 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 109 predicate places. [2024-05-12 11:58:44,550 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 225 transitions, 2694 flow [2024-05-12 11:58:44,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:58:44,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:58:44,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:58:44,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-12 11:58:44,550 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:58:44,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:58:44,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1630624232, now seen corresponding path program 3 times [2024-05-12 11:58:44,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:58:44,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179127915] [2024-05-12 11:58:44,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:58:44,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:58:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:58:55,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:58:55,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:58:55,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179127915] [2024-05-12 11:58:55,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179127915] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:58:55,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:58:55,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:58:55,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108727637] [2024-05-12 11:58:55,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:58:55,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:58:55,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:58:55,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:58:55,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:58:55,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:58:55,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 225 transitions, 2694 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:58:55,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:58:55,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:58:55,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:58:58,798 INFO L124 PetriNetUnfolderBase]: 6009/9259 cut-off events. [2024-05-12 11:58:58,798 INFO L125 PetriNetUnfolderBase]: For 182301/182316 co-relation queries the response was YES. [2024-05-12 11:58:58,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55283 conditions, 9259 events. 6009/9259 cut-off events. For 182301/182316 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 56981 event pairs, 1536 based on Foata normal form. 14/9100 useless extension candidates. Maximal degree in co-relation 55204. Up to 8300 conditions per place. [2024-05-12 11:58:58,888 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 234 selfloop transitions, 26 changer transitions 0/270 dead transitions. [2024-05-12 11:58:58,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 270 transitions, 3366 flow [2024-05-12 11:58:58,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:58:58,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:58:58,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2024-05-12 11:58:58,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49744897959183676 [2024-05-12 11:58:58,890 INFO L175 Difference]: Start difference. First operand has 164 places, 225 transitions, 2694 flow. Second operand 8 states and 195 transitions. [2024-05-12 11:58:58,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 270 transitions, 3366 flow [2024-05-12 11:58:59,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 270 transitions, 3214 flow, removed 44 selfloop flow, removed 4 redundant places. [2024-05-12 11:58:59,240 INFO L231 Difference]: Finished difference. Result has 168 places, 225 transitions, 2601 flow [2024-05-12 11:58:59,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2542, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2601, PETRI_PLACES=168, PETRI_TRANSITIONS=225} [2024-05-12 11:58:59,241 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 113 predicate places. [2024-05-12 11:58:59,241 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 225 transitions, 2601 flow [2024-05-12 11:58:59,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:58:59,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:58:59,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:58:59,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-12 11:58:59,241 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:58:59,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:58:59,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1745915526, now seen corresponding path program 4 times [2024-05-12 11:58:59,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:58:59,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181358953] [2024-05-12 11:58:59,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:58:59,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:58:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:59:11,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:59:11,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:59:11,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181358953] [2024-05-12 11:59:11,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181358953] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:59:11,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:59:11,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:59:11,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685213408] [2024-05-12 11:59:11,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:59:11,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:59:11,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:59:11,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:59:11,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:59:11,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:59:11,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 225 transitions, 2601 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:59:11,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:59:11,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:59:11,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:59:14,838 INFO L124 PetriNetUnfolderBase]: 6163/9466 cut-off events. [2024-05-12 11:59:14,838 INFO L125 PetriNetUnfolderBase]: For 188490/188490 co-relation queries the response was YES. [2024-05-12 11:59:14,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56826 conditions, 9466 events. 6163/9466 cut-off events. For 188490/188490 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 58367 event pairs, 1348 based on Foata normal form. 6/9307 useless extension candidates. Maximal degree in co-relation 56745. Up to 7418 conditions per place. [2024-05-12 11:59:14,922 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 221 selfloop transitions, 69 changer transitions 0/300 dead transitions. [2024-05-12 11:59:14,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 300 transitions, 3841 flow [2024-05-12 11:59:14,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:59:14,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:59:14,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 242 transitions. [2024-05-12 11:59:14,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5487528344671202 [2024-05-12 11:59:14,924 INFO L175 Difference]: Start difference. First operand has 168 places, 225 transitions, 2601 flow. Second operand 9 states and 242 transitions. [2024-05-12 11:59:14,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 300 transitions, 3841 flow [2024-05-12 11:59:15,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 300 transitions, 3788 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-05-12 11:59:15,139 INFO L231 Difference]: Finished difference. Result has 173 places, 234 transitions, 2880 flow [2024-05-12 11:59:15,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2548, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2880, PETRI_PLACES=173, PETRI_TRANSITIONS=234} [2024-05-12 11:59:15,143 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 118 predicate places. [2024-05-12 11:59:15,144 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 234 transitions, 2880 flow [2024-05-12 11:59:15,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:59:15,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:59:15,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:59:15,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-12 11:59:15,144 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:59:15,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:59:15,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1745920176, now seen corresponding path program 5 times [2024-05-12 11:59:15,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:59:15,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689867272] [2024-05-12 11:59:15,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:59:15,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:59:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:59:24,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:59:24,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:59:24,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689867272] [2024-05-12 11:59:24,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689867272] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:59:24,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:59:24,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:59:24,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716631904] [2024-05-12 11:59:24,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:59:24,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:59:24,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:59:24,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:59:24,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:59:24,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:59:24,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 234 transitions, 2880 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:59:24,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:59:24,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:59:24,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:59:27,873 INFO L124 PetriNetUnfolderBase]: 6246/9600 cut-off events. [2024-05-12 11:59:27,873 INFO L125 PetriNetUnfolderBase]: For 209985/209988 co-relation queries the response was YES. [2024-05-12 11:59:27,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59624 conditions, 9600 events. 6246/9600 cut-off events. For 209985/209988 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 59246 event pairs, 1381 based on Foata normal form. 8/9437 useless extension candidates. Maximal degree in co-relation 59541. Up to 7781 conditions per place. [2024-05-12 11:59:27,972 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 220 selfloop transitions, 62 changer transitions 0/292 dead transitions. [2024-05-12 11:59:27,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 292 transitions, 3876 flow [2024-05-12 11:59:27,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 11:59:27,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 11:59:27,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 213 transitions. [2024-05-12 11:59:27,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5433673469387755 [2024-05-12 11:59:27,981 INFO L175 Difference]: Start difference. First operand has 173 places, 234 transitions, 2880 flow. Second operand 8 states and 213 transitions. [2024-05-12 11:59:27,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 292 transitions, 3876 flow [2024-05-12 11:59:28,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 292 transitions, 3729 flow, removed 43 selfloop flow, removed 4 redundant places. [2024-05-12 11:59:28,370 INFO L231 Difference]: Finished difference. Result has 177 places, 238 transitions, 2964 flow [2024-05-12 11:59:28,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2739, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2964, PETRI_PLACES=177, PETRI_TRANSITIONS=238} [2024-05-12 11:59:28,372 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 122 predicate places. [2024-05-12 11:59:28,372 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 238 transitions, 2964 flow [2024-05-12 11:59:28,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:59:28,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:59:28,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:59:28,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-12 11:59:28,373 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:59:28,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:59:28,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1537032288, now seen corresponding path program 1 times [2024-05-12 11:59:28,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:59:28,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971404425] [2024-05-12 11:59:28,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:59:28,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:59:28,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:59:38,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:59:38,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:59:38,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971404425] [2024-05-12 11:59:38,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971404425] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:59:38,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:59:38,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:59:38,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505326219] [2024-05-12 11:59:38,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:59:38,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:59:38,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:59:38,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:59:38,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:59:38,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:59:38,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 238 transitions, 2964 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:59:38,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:59:38,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:59:38,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:59:42,127 INFO L124 PetriNetUnfolderBase]: 6393/9811 cut-off events. [2024-05-12 11:59:42,127 INFO L125 PetriNetUnfolderBase]: For 227482/227482 co-relation queries the response was YES. [2024-05-12 11:59:42,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61738 conditions, 9811 events. 6393/9811 cut-off events. For 227482/227482 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 60708 event pairs, 1384 based on Foata normal form. 12/9652 useless extension candidates. Maximal degree in co-relation 61653. Up to 7950 conditions per place. [2024-05-12 11:59:42,222 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 229 selfloop transitions, 60 changer transitions 0/299 dead transitions. [2024-05-12 11:59:42,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 299 transitions, 3974 flow [2024-05-12 11:59:42,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:59:42,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:59:42,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 233 transitions. [2024-05-12 11:59:42,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.528344671201814 [2024-05-12 11:59:42,224 INFO L175 Difference]: Start difference. First operand has 177 places, 238 transitions, 2964 flow. Second operand 9 states and 233 transitions. [2024-05-12 11:59:42,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 299 transitions, 3974 flow [2024-05-12 11:59:42,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 299 transitions, 3797 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-05-12 11:59:42,472 INFO L231 Difference]: Finished difference. Result has 180 places, 242 transitions, 3004 flow [2024-05-12 11:59:42,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2787, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3004, PETRI_PLACES=180, PETRI_TRANSITIONS=242} [2024-05-12 11:59:42,473 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 125 predicate places. [2024-05-12 11:59:42,473 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 242 transitions, 3004 flow [2024-05-12 11:59:42,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:59:42,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:59:42,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:59:42,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-12 11:59:42,474 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:59:42,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:59:42,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1537039232, now seen corresponding path program 6 times [2024-05-12 11:59:42,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:59:42,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217599966] [2024-05-12 11:59:42,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:59:42,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:59:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:59:54,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:59:54,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:59:54,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217599966] [2024-05-12 11:59:54,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217599966] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:59:54,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:59:54,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 11:59:54,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6896404] [2024-05-12 11:59:54,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:59:54,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 11:59:54,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:59:54,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 11:59:54,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 11:59:54,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 11:59:54,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 242 transitions, 3004 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:59:54,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:59:54,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 11:59:54,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:59:57,942 INFO L124 PetriNetUnfolderBase]: 6465/9927 cut-off events. [2024-05-12 11:59:57,942 INFO L125 PetriNetUnfolderBase]: For 238773/238773 co-relation queries the response was YES. [2024-05-12 11:59:58,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63503 conditions, 9927 events. 6465/9927 cut-off events. For 238773/238773 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 61560 event pairs, 1357 based on Foata normal form. 6/9759 useless extension candidates. Maximal degree in co-relation 63417. Up to 8096 conditions per place. [2024-05-12 11:59:58,046 INFO L140 encePairwiseOnDemand]: 34/49 looper letters, 230 selfloop transitions, 62 changer transitions 0/302 dead transitions. [2024-05-12 11:59:58,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 302 transitions, 3982 flow [2024-05-12 11:59:58,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:59:58,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:59:58,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 230 transitions. [2024-05-12 11:59:58,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5215419501133787 [2024-05-12 11:59:58,048 INFO L175 Difference]: Start difference. First operand has 180 places, 242 transitions, 3004 flow. Second operand 9 states and 230 transitions. [2024-05-12 11:59:58,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 302 transitions, 3982 flow [2024-05-12 11:59:58,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 302 transitions, 3795 flow, removed 36 selfloop flow, removed 7 redundant places. [2024-05-12 11:59:58,360 INFO L231 Difference]: Finished difference. Result has 182 places, 246 transitions, 3052 flow [2024-05-12 11:59:58,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2817, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3052, PETRI_PLACES=182, PETRI_TRANSITIONS=246} [2024-05-12 11:59:58,361 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 127 predicate places. [2024-05-12 11:59:58,361 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 246 transitions, 3052 flow [2024-05-12 11:59:58,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:59:58,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:59:58,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:59:58,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-12 11:59:58,361 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 11:59:58,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:59:58,362 INFO L85 PathProgramCache]: Analyzing trace with hash -825974207, now seen corresponding path program 1 times [2024-05-12 11:59:58,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:59:58,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873901759] [2024-05-12 11:59:58,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:59:58,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:59:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:00:11,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:00:11,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:00:11,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873901759] [2024-05-12 12:00:11,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873901759] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:00:11,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:00:11,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:00:11,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740248365] [2024-05-12 12:00:11,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:00:11,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:00:11,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:00:11,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:00:11,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:00:11,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:00:11,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 246 transitions, 3052 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:00:11,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:00:11,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:00:11,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:00:15,359 INFO L124 PetriNetUnfolderBase]: 6486/10000 cut-off events. [2024-05-12 12:00:15,359 INFO L125 PetriNetUnfolderBase]: For 243866/243866 co-relation queries the response was YES. [2024-05-12 12:00:15,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63463 conditions, 10000 events. 6486/10000 cut-off events. For 243866/243866 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 62417 event pairs, 1638 based on Foata normal form. 1/9809 useless extension candidates. Maximal degree in co-relation 63376. Up to 9103 conditions per place. [2024-05-12 12:00:15,478 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 247 selfloop transitions, 18 changer transitions 0/275 dead transitions. [2024-05-12 12:00:15,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 275 transitions, 3780 flow [2024-05-12 12:00:15,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:00:15,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:00:15,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2024-05-12 12:00:15,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2024-05-12 12:00:15,479 INFO L175 Difference]: Start difference. First operand has 182 places, 246 transitions, 3052 flow. Second operand 6 states and 144 transitions. [2024-05-12 12:00:15,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 275 transitions, 3780 flow [2024-05-12 12:00:15,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 275 transitions, 3591 flow, removed 34 selfloop flow, removed 7 redundant places. [2024-05-12 12:00:15,847 INFO L231 Difference]: Finished difference. Result has 181 places, 249 transitions, 2959 flow [2024-05-12 12:00:15,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2865, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2959, PETRI_PLACES=181, PETRI_TRANSITIONS=249} [2024-05-12 12:00:15,847 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 126 predicate places. [2024-05-12 12:00:15,848 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 249 transitions, 2959 flow [2024-05-12 12:00:15,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:00:15,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:00:15,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:00:15,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-12 12:00:15,848 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:00:15,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:00:15,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1850103258, now seen corresponding path program 2 times [2024-05-12 12:00:15,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:00:15,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647815336] [2024-05-12 12:00:15,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:00:15,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:00:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:00:26,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-05-12 12:00:26,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:00:26,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647815336] [2024-05-12 12:00:26,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647815336] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:00:26,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:00:26,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:00:26,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840991103] [2024-05-12 12:00:26,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:00:26,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:00:26,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:00:26,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:00:26,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:00:26,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:00:26,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 249 transitions, 2959 flow. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:00:26,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:00:26,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:00:26,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:00:30,333 INFO L124 PetriNetUnfolderBase]: 6590/10315 cut-off events. [2024-05-12 12:00:30,333 INFO L125 PetriNetUnfolderBase]: For 258455/258455 co-relation queries the response was YES. [2024-05-12 12:00:30,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63682 conditions, 10315 events. 6590/10315 cut-off events. For 258455/258455 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 66127 event pairs, 2803 based on Foata normal form. 6/10130 useless extension candidates. Maximal degree in co-relation 63594. Up to 9036 conditions per place. [2024-05-12 12:00:30,431 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 245 selfloop transitions, 46 changer transitions 0/301 dead transitions. [2024-05-12 12:00:30,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 301 transitions, 3855 flow [2024-05-12 12:00:30,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:00:30,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:00:30,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 211 transitions. [2024-05-12 12:00:30,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47845804988662133 [2024-05-12 12:00:30,433 INFO L175 Difference]: Start difference. First operand has 181 places, 249 transitions, 2959 flow. Second operand 9 states and 211 transitions. [2024-05-12 12:00:30,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 301 transitions, 3855 flow [2024-05-12 12:00:30,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 301 transitions, 3701 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-05-12 12:00:30,735 INFO L231 Difference]: Finished difference. Result has 186 places, 258 transitions, 3068 flow [2024-05-12 12:00:30,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2808, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3068, PETRI_PLACES=186, PETRI_TRANSITIONS=258} [2024-05-12 12:00:30,735 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 131 predicate places. [2024-05-12 12:00:30,735 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 258 transitions, 3068 flow [2024-05-12 12:00:30,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:00:30,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:00:30,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:00:30,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-12 12:00:30,736 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:00:30,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:00:30,736 INFO L85 PathProgramCache]: Analyzing trace with hash -2145212412, now seen corresponding path program 3 times [2024-05-12 12:00:30,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:00:30,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442175479] [2024-05-12 12:00:30,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:00:30,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:00:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:00:41,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:00:41,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:00:41,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442175479] [2024-05-12 12:00:41,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442175479] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:00:41,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:00:41,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:00:41,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442697772] [2024-05-12 12:00:41,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:00:41,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:00:41,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:00:41,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:00:41,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:00:41,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:00:41,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 258 transitions, 3068 flow. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:00:41,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:00:41,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:00:41,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:00:46,121 INFO L124 PetriNetUnfolderBase]: 6658/10393 cut-off events. [2024-05-12 12:00:46,121 INFO L125 PetriNetUnfolderBase]: For 276068/276068 co-relation queries the response was YES. [2024-05-12 12:00:46,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65609 conditions, 10393 events. 6658/10393 cut-off events. For 276068/276068 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 66409 event pairs, 2867 based on Foata normal form. 6/10217 useless extension candidates. Maximal degree in co-relation 65519. Up to 9153 conditions per place. [2024-05-12 12:00:46,224 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 249 selfloop transitions, 41 changer transitions 0/300 dead transitions. [2024-05-12 12:00:46,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 300 transitions, 3918 flow [2024-05-12 12:00:46,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:00:46,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:00:46,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions. [2024-05-12 12:00:46,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-05-12 12:00:46,226 INFO L175 Difference]: Start difference. First operand has 186 places, 258 transitions, 3068 flow. Second operand 8 states and 196 transitions. [2024-05-12 12:00:46,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 300 transitions, 3918 flow [2024-05-12 12:00:46,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 300 transitions, 3762 flow, removed 44 selfloop flow, removed 4 redundant places. [2024-05-12 12:00:46,553 INFO L231 Difference]: Finished difference. Result has 190 places, 261 transitions, 3095 flow [2024-05-12 12:00:46,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2912, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3095, PETRI_PLACES=190, PETRI_TRANSITIONS=261} [2024-05-12 12:00:46,554 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 135 predicate places. [2024-05-12 12:00:46,554 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 261 transitions, 3095 flow [2024-05-12 12:00:46,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:00:46,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:00:46,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:00:46,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-12 12:00:46,554 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:00:46,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:00:46,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1884980164, now seen corresponding path program 4 times [2024-05-12 12:00:46,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:00:46,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495211692] [2024-05-12 12:00:46,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:00:46,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:00:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:00:57,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:00:57,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:00:57,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495211692] [2024-05-12 12:00:57,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495211692] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:00:57,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:00:57,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:00:57,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533086133] [2024-05-12 12:00:57,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:00:57,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:00:57,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:00:57,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:00:57,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:00:57,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:00:57,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 261 transitions, 3095 flow. Second operand has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:00:57,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:00:57,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:00:57,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:01:01,400 INFO L124 PetriNetUnfolderBase]: 6688/10439 cut-off events. [2024-05-12 12:01:01,400 INFO L125 PetriNetUnfolderBase]: For 287106/287106 co-relation queries the response was YES. [2024-05-12 12:01:01,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66189 conditions, 10439 events. 6688/10439 cut-off events. For 287106/287106 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 66723 event pairs, 2863 based on Foata normal form. 6/10262 useless extension candidates. Maximal degree in co-relation 66097. Up to 9134 conditions per place. [2024-05-12 12:01:01,526 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 261 selfloop transitions, 36 changer transitions 0/307 dead transitions. [2024-05-12 12:01:01,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 307 transitions, 4057 flow [2024-05-12 12:01:01,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:01:01,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:01:01,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-05-12 12:01:01,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5051020408163265 [2024-05-12 12:01:01,528 INFO L175 Difference]: Start difference. First operand has 190 places, 261 transitions, 3095 flow. Second operand 8 states and 198 transitions. [2024-05-12 12:01:01,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 307 transitions, 4057 flow [2024-05-12 12:01:01,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 307 transitions, 3898 flow, removed 41 selfloop flow, removed 6 redundant places. [2024-05-12 12:01:01,904 INFO L231 Difference]: Finished difference. Result has 192 places, 264 transitions, 3114 flow [2024-05-12 12:01:01,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2936, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3114, PETRI_PLACES=192, PETRI_TRANSITIONS=264} [2024-05-12 12:01:01,905 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 137 predicate places. [2024-05-12 12:01:01,905 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 264 transitions, 3114 flow [2024-05-12 12:01:01,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:01:01,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:01:01,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:01:01,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-12 12:01:01,905 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:01:01,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:01:01,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1850429006, now seen corresponding path program 1 times [2024-05-12 12:01:01,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:01:01,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393972050] [2024-05-12 12:01:01,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:01:01,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:01:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:01:13,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:01:13,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:01:13,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393972050] [2024-05-12 12:01:13,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393972050] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:01:13,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:01:13,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:01:13,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961063860] [2024-05-12 12:01:13,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:01:13,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:01:13,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:01:13,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:01:13,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:01:13,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:01:13,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 264 transitions, 3114 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:01:13,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:01:13,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:01:13,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:01:16,921 INFO L124 PetriNetUnfolderBase]: 6708/10482 cut-off events. [2024-05-12 12:01:16,922 INFO L125 PetriNetUnfolderBase]: For 295395/295395 co-relation queries the response was YES. [2024-05-12 12:01:16,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66591 conditions, 10482 events. 6708/10482 cut-off events. For 295395/295395 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 67240 event pairs, 2841 based on Foata normal form. 3/10297 useless extension candidates. Maximal degree in co-relation 66498. Up to 9195 conditions per place. [2024-05-12 12:01:17,028 INFO L140 encePairwiseOnDemand]: 36/49 looper letters, 251 selfloop transitions, 46 changer transitions 0/307 dead transitions. [2024-05-12 12:01:17,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 307 transitions, 3982 flow [2024-05-12 12:01:17,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:01:17,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:01:17,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions. [2024-05-12 12:01:17,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5025510204081632 [2024-05-12 12:01:17,034 INFO L175 Difference]: Start difference. First operand has 192 places, 264 transitions, 3114 flow. Second operand 8 states and 197 transitions. [2024-05-12 12:01:17,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 307 transitions, 3982 flow [2024-05-12 12:01:17,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 307 transitions, 3828 flow, removed 43 selfloop flow, removed 6 redundant places. [2024-05-12 12:01:17,346 INFO L231 Difference]: Finished difference. Result has 194 places, 268 transitions, 3158 flow [2024-05-12 12:01:17,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2960, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3158, PETRI_PLACES=194, PETRI_TRANSITIONS=268} [2024-05-12 12:01:17,347 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 139 predicate places. [2024-05-12 12:01:17,347 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 268 transitions, 3158 flow [2024-05-12 12:01:17,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:01:17,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:01:17,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:01:17,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-12 12:01:17,348 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:01:17,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:01:17,348 INFO L85 PathProgramCache]: Analyzing trace with hash 2140580000, now seen corresponding path program 7 times [2024-05-12 12:01:17,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:01:17,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003005203] [2024-05-12 12:01:17,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:01:17,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:01:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:01:27,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:01:27,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:01:27,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003005203] [2024-05-12 12:01:27,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003005203] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:01:27,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:01:27,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:01:27,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21370002] [2024-05-12 12:01:27,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:01:27,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:01:27,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:01:27,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:01:27,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:01:27,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:01:27,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 268 transitions, 3158 flow. Second operand has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:01:27,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:01:27,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:01:27,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:01:32,723 INFO L124 PetriNetUnfolderBase]: 6735/10497 cut-off events. [2024-05-12 12:01:32,723 INFO L125 PetriNetUnfolderBase]: For 301952/301967 co-relation queries the response was YES. [2024-05-12 12:01:32,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66639 conditions, 10497 events. 6735/10497 cut-off events. For 301952/301967 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 67016 event pairs, 2868 based on Foata normal form. 16/10332 useless extension candidates. Maximal degree in co-relation 66545. Up to 9246 conditions per place. [2024-05-12 12:01:32,914 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 271 selfloop transitions, 33 changer transitions 0/314 dead transitions. [2024-05-12 12:01:32,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 314 transitions, 4090 flow [2024-05-12 12:01:32,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:01:32,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:01:32,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 198 transitions. [2024-05-12 12:01:32,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5051020408163265 [2024-05-12 12:01:32,916 INFO L175 Difference]: Start difference. First operand has 194 places, 268 transitions, 3158 flow. Second operand 8 states and 198 transitions. [2024-05-12 12:01:32,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 314 transitions, 4090 flow [2024-05-12 12:01:33,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 314 transitions, 3950 flow, removed 29 selfloop flow, removed 6 redundant places. [2024-05-12 12:01:33,520 INFO L231 Difference]: Finished difference. Result has 196 places, 272 transitions, 3211 flow [2024-05-12 12:01:33,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3018, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3211, PETRI_PLACES=196, PETRI_TRANSITIONS=272} [2024-05-12 12:01:33,521 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 141 predicate places. [2024-05-12 12:01:33,522 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 272 transitions, 3211 flow [2024-05-12 12:01:33,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.555555555555555) internal successors, (122), 9 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:01:33,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:01:33,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:01:33,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-05-12 12:01:33,522 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:01:33,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:01:33,523 INFO L85 PathProgramCache]: Analyzing trace with hash 846032803, now seen corresponding path program 2 times [2024-05-12 12:01:33,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:01:33,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528964294] [2024-05-12 12:01:33,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:01:33,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:01:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:01:50,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:01:50,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:01:50,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528964294] [2024-05-12 12:01:50,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528964294] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:01:50,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:01:50,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:01:50,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710190255] [2024-05-12 12:01:50,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:01:50,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:01:50,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:01:50,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:01:50,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:01:50,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:01:50,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 272 transitions, 3211 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:01:50,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:01:50,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:01:50,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:01:55,107 INFO L124 PetriNetUnfolderBase]: 6732/10520 cut-off events. [2024-05-12 12:01:55,108 INFO L125 PetriNetUnfolderBase]: For 309828/309828 co-relation queries the response was YES. [2024-05-12 12:01:55,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66931 conditions, 10520 events. 6732/10520 cut-off events. For 309828/309828 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 67421 event pairs, 2907 based on Foata normal form. 1/10333 useless extension candidates. Maximal degree in co-relation 66836. Up to 9489 conditions per place. [2024-05-12 12:01:55,263 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 264 selfloop transitions, 14 changer transitions 0/288 dead transitions. [2024-05-12 12:01:55,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 288 transitions, 3817 flow [2024-05-12 12:01:55,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:01:55,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:01:55,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2024-05-12 12:01:55,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4557823129251701 [2024-05-12 12:01:55,265 INFO L175 Difference]: Start difference. First operand has 196 places, 272 transitions, 3211 flow. Second operand 6 states and 134 transitions. [2024-05-12 12:01:55,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 288 transitions, 3817 flow [2024-05-12 12:01:55,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 288 transitions, 3662 flow, removed 47 selfloop flow, removed 6 redundant places. [2024-05-12 12:01:55,672 INFO L231 Difference]: Finished difference. Result has 196 places, 272 transitions, 3090 flow [2024-05-12 12:01:55,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3056, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3090, PETRI_PLACES=196, PETRI_TRANSITIONS=272} [2024-05-12 12:01:55,673 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 141 predicate places. [2024-05-12 12:01:55,673 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 272 transitions, 3090 flow [2024-05-12 12:01:55,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:01:55,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:01:55,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:01:55,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-12 12:01:55,674 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:01:55,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:01:55,674 INFO L85 PathProgramCache]: Analyzing trace with hash -819330814, now seen corresponding path program 1 times [2024-05-12 12:01:55,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:01:55,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088846023] [2024-05-12 12:01:55,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:01:55,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:01:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:02:16,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:02:16,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:02:16,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088846023] [2024-05-12 12:02:16,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088846023] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:02:16,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:02:16,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:02:16,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571781014] [2024-05-12 12:02:16,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:02:16,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:02:16,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:02:16,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:02:16,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:02:16,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:02:16,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 272 transitions, 3090 flow. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:16,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:02:16,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:02:16,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:02:19,947 INFO L124 PetriNetUnfolderBase]: 6744/10583 cut-off events. [2024-05-12 12:02:19,947 INFO L125 PetriNetUnfolderBase]: For 314583/314583 co-relation queries the response was YES. [2024-05-12 12:02:20,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66433 conditions, 10583 events. 6744/10583 cut-off events. For 314583/314583 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 68288 event pairs, 2885 based on Foata normal form. 3/10383 useless extension candidates. Maximal degree in co-relation 66337. Up to 9376 conditions per place. [2024-05-12 12:02:20,096 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 250 selfloop transitions, 42 changer transitions 0/302 dead transitions. [2024-05-12 12:02:20,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 302 transitions, 3915 flow [2024-05-12 12:02:20,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:02:20,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:02:20,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2024-05-12 12:02:20,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4965986394557823 [2024-05-12 12:02:20,103 INFO L175 Difference]: Start difference. First operand has 196 places, 272 transitions, 3090 flow. Second operand 6 states and 146 transitions. [2024-05-12 12:02:20,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 302 transitions, 3915 flow [2024-05-12 12:02:20,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 302 transitions, 3850 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-05-12 12:02:20,652 INFO L231 Difference]: Finished difference. Result has 196 places, 278 transitions, 3228 flow [2024-05-12 12:02:20,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3028, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3228, PETRI_PLACES=196, PETRI_TRANSITIONS=278} [2024-05-12 12:02:20,653 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 141 predicate places. [2024-05-12 12:02:20,653 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 278 transitions, 3228 flow [2024-05-12 12:02:20,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:20,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:02:20,654 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:02:20,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-12 12:02:20,654 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:02:20,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:02:20,655 INFO L85 PathProgramCache]: Analyzing trace with hash 847538876, now seen corresponding path program 2 times [2024-05-12 12:02:20,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:02:20,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255356090] [2024-05-12 12:02:20,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:02:20,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:02:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:02:42,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:02:42,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:02:42,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255356090] [2024-05-12 12:02:42,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255356090] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:02:42,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:02:42,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:02:42,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44273127] [2024-05-12 12:02:42,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:02:42,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:02:42,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:02:42,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:02:42,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:02:42,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:02:42,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 278 transitions, 3228 flow. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:42,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:02:42,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:02:42,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:02:45,618 INFO L124 PetriNetUnfolderBase]: 6712/10539 cut-off events. [2024-05-12 12:02:45,619 INFO L125 PetriNetUnfolderBase]: For 321959/321959 co-relation queries the response was YES. [2024-05-12 12:02:45,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66483 conditions, 10539 events. 6712/10539 cut-off events. For 321959/321959 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 68020 event pairs, 2881 based on Foata normal form. 1/10335 useless extension candidates. Maximal degree in co-relation 66387. Up to 9330 conditions per place. [2024-05-12 12:02:45,753 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 253 selfloop transitions, 46 changer transitions 0/309 dead transitions. [2024-05-12 12:02:45,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 309 transitions, 3909 flow [2024-05-12 12:02:45,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:02:45,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:02:45,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 184 transitions. [2024-05-12 12:02:45,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2024-05-12 12:02:45,755 INFO L175 Difference]: Start difference. First operand has 196 places, 278 transitions, 3228 flow. Second operand 8 states and 184 transitions. [2024-05-12 12:02:45,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 309 transitions, 3909 flow [2024-05-12 12:02:46,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 309 transitions, 3835 flow, removed 15 selfloop flow, removed 3 redundant places. [2024-05-12 12:02:46,132 INFO L231 Difference]: Finished difference. Result has 201 places, 278 transitions, 3256 flow [2024-05-12 12:02:46,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3154, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3256, PETRI_PLACES=201, PETRI_TRANSITIONS=278} [2024-05-12 12:02:46,142 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 146 predicate places. [2024-05-12 12:02:46,142 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 278 transitions, 3256 flow [2024-05-12 12:02:46,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:02:46,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:02:46,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:02:46,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-12 12:02:46,143 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:02:46,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:02:46,143 INFO L85 PathProgramCache]: Analyzing trace with hash 793317582, now seen corresponding path program 1 times [2024-05-12 12:02:46,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:02:46,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778843468] [2024-05-12 12:02:46,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:02:46,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:02:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:03:03,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:03:03,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:03:03,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778843468] [2024-05-12 12:03:03,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778843468] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:03:03,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:03:03,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:03:03,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752972832] [2024-05-12 12:03:03,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:03:03,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:03:03,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:03:03,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:03:03,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:03:03,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 49 [2024-05-12 12:03:03,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 278 transitions, 3256 flow. Second operand has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 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-05-12 12:03:03,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:03:03,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 49 [2024-05-12 12:03:03,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:03:06,860 INFO L124 PetriNetUnfolderBase]: 7154/10943 cut-off events. [2024-05-12 12:03:06,860 INFO L125 PetriNetUnfolderBase]: For 334094/334094 co-relation queries the response was YES. [2024-05-12 12:03:06,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69036 conditions, 10943 events. 7154/10943 cut-off events. For 334094/334094 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 67939 event pairs, 3162 based on Foata normal form. 3/10765 useless extension candidates. Maximal degree in co-relation 68939. Up to 10081 conditions per place. [2024-05-12 12:03:06,986 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 277 selfloop transitions, 21 changer transitions 0/306 dead transitions. [2024-05-12 12:03:06,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 306 transitions, 3970 flow [2024-05-12 12:03:06,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:03:06,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:03:07,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2024-05-12 12:03:07,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44314868804664725 [2024-05-12 12:03:07,000 INFO L175 Difference]: Start difference. First operand has 201 places, 278 transitions, 3256 flow. Second operand 7 states and 152 transitions. [2024-05-12 12:03:07,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 306 transitions, 3970 flow [2024-05-12 12:03:07,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 306 transitions, 3810 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-05-12 12:03:07,405 INFO L231 Difference]: Finished difference. Result has 199 places, 281 transitions, 3186 flow [2024-05-12 12:03:07,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3096, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3186, PETRI_PLACES=199, PETRI_TRANSITIONS=281} [2024-05-12 12:03:07,405 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 144 predicate places. [2024-05-12 12:03:07,406 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 281 transitions, 3186 flow [2024-05-12 12:03:07,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 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-05-12 12:03:07,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:03:07,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:03:07,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-05-12 12:03:07,406 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:03:07,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:03:07,407 INFO L85 PathProgramCache]: Analyzing trace with hash 469213243, now seen corresponding path program 1 times [2024-05-12 12:03:07,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:03:07,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301115076] [2024-05-12 12:03:07,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:03:07,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:03:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:03:23,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:03:23,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:03:23,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301115076] [2024-05-12 12:03:23,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301115076] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:03:23,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:03:23,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:03:23,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388636107] [2024-05-12 12:03:23,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:03:23,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:03:23,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:03:23,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:03:23,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:03:23,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:03:23,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 281 transitions, 3186 flow. Second operand has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:23,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:03:23,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:03:23,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:03:28,750 INFO L124 PetriNetUnfolderBase]: 9994/15590 cut-off events. [2024-05-12 12:03:28,750 INFO L125 PetriNetUnfolderBase]: For 482782/482801 co-relation queries the response was YES. [2024-05-12 12:03:28,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100976 conditions, 15590 events. 9994/15590 cut-off events. For 482782/482801 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 105206 event pairs, 1906 based on Foata normal form. 42/15235 useless extension candidates. Maximal degree in co-relation 100879. Up to 9825 conditions per place. [2024-05-12 12:03:28,953 INFO L140 encePairwiseOnDemand]: 32/49 looper letters, 427 selfloop transitions, 116 changer transitions 0/553 dead transitions. [2024-05-12 12:03:28,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 553 transitions, 7445 flow [2024-05-12 12:03:28,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:03:28,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:03:28,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 276 transitions. [2024-05-12 12:03:28,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.563265306122449 [2024-05-12 12:03:28,956 INFO L175 Difference]: Start difference. First operand has 199 places, 281 transitions, 3186 flow. Second operand 10 states and 276 transitions. [2024-05-12 12:03:28,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 553 transitions, 7445 flow [2024-05-12 12:03:29,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 553 transitions, 7379 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-05-12 12:03:29,656 INFO L231 Difference]: Finished difference. Result has 209 places, 377 transitions, 4992 flow [2024-05-12 12:03:29,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=3120, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4992, PETRI_PLACES=209, PETRI_TRANSITIONS=377} [2024-05-12 12:03:29,657 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 154 predicate places. [2024-05-12 12:03:29,657 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 377 transitions, 4992 flow [2024-05-12 12:03:29,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:29,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:03:29,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:03:29,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-12 12:03:29,658 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:03:29,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:03:29,658 INFO L85 PathProgramCache]: Analyzing trace with hash -520498857, now seen corresponding path program 2 times [2024-05-12 12:03:29,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:03:29,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897037575] [2024-05-12 12:03:29,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:03:29,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:03:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:03:45,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:03:45,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:03:45,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897037575] [2024-05-12 12:03:45,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897037575] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:03:45,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:03:45,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:03:45,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976527014] [2024-05-12 12:03:45,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:03:45,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:03:45,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:03:45,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:03:45,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:03:45,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:03:45,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 377 transitions, 4992 flow. Second operand has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:45,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:03:45,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:03:45,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:03:52,508 INFO L124 PetriNetUnfolderBase]: 10310/15884 cut-off events. [2024-05-12 12:03:52,508 INFO L125 PetriNetUnfolderBase]: For 560189/560208 co-relation queries the response was YES. [2024-05-12 12:03:52,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113094 conditions, 15884 events. 10310/15884 cut-off events. For 560189/560208 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 106529 event pairs, 2015 based on Foata normal form. 46/15679 useless extension candidates. Maximal degree in co-relation 112991. Up to 11860 conditions per place. [2024-05-12 12:03:52,685 INFO L140 encePairwiseOnDemand]: 32/49 looper letters, 408 selfloop transitions, 148 changer transitions 0/566 dead transitions. [2024-05-12 12:03:52,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 566 transitions, 8221 flow [2024-05-12 12:03:52,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:03:52,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:03:52,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 271 transitions. [2024-05-12 12:03:52,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5530612244897959 [2024-05-12 12:03:52,687 INFO L175 Difference]: Start difference. First operand has 209 places, 377 transitions, 4992 flow. Second operand 10 states and 271 transitions. [2024-05-12 12:03:52,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 566 transitions, 8221 flow [2024-05-12 12:03:53,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 566 transitions, 8094 flow, removed 53 selfloop flow, removed 2 redundant places. [2024-05-12 12:03:53,681 INFO L231 Difference]: Finished difference. Result has 221 places, 407 transitions, 5723 flow [2024-05-12 12:03:53,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=4865, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5723, PETRI_PLACES=221, PETRI_TRANSITIONS=407} [2024-05-12 12:03:53,682 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 166 predicate places. [2024-05-12 12:03:53,682 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 407 transitions, 5723 flow [2024-05-12 12:03:53,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:03:53,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:03:53,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:03:53,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-05-12 12:03:53,683 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:03:53,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:03:53,683 INFO L85 PathProgramCache]: Analyzing trace with hash -520502577, now seen corresponding path program 3 times [2024-05-12 12:03:53,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:03:53,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422602939] [2024-05-12 12:03:53,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:03:53,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:03:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:04:09,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-05-12 12:04:09,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:04:09,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422602939] [2024-05-12 12:04:09,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422602939] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:04:09,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:04:09,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:04:09,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65533839] [2024-05-12 12:04:09,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:04:09,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:04:09,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:04:09,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:04:09,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:04:09,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:04:09,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 407 transitions, 5723 flow. Second operand has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:09,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:04:09,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:04:09,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:04:16,475 INFO L124 PetriNetUnfolderBase]: 11783/18292 cut-off events. [2024-05-12 12:04:16,475 INFO L125 PetriNetUnfolderBase]: For 674359/674378 co-relation queries the response was YES. [2024-05-12 12:04:16,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136423 conditions, 18292 events. 11783/18292 cut-off events. For 674359/674378 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 126324 event pairs, 2351 based on Foata normal form. 42/17964 useless extension candidates. Maximal degree in co-relation 136314. Up to 12469 conditions per place. [2024-05-12 12:04:16,743 INFO L140 encePairwiseOnDemand]: 31/49 looper letters, 458 selfloop transitions, 142 changer transitions 0/610 dead transitions. [2024-05-12 12:04:16,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 610 transitions, 9480 flow [2024-05-12 12:04:16,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:04:16,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:04:16,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 301 transitions. [2024-05-12 12:04:16,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5584415584415584 [2024-05-12 12:04:16,746 INFO L175 Difference]: Start difference. First operand has 221 places, 407 transitions, 5723 flow. Second operand 11 states and 301 transitions. [2024-05-12 12:04:16,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 610 transitions, 9480 flow [2024-05-12 12:04:18,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 610 transitions, 9368 flow, removed 40 selfloop flow, removed 2 redundant places. [2024-05-12 12:04:18,453 INFO L231 Difference]: Finished difference. Result has 233 places, 441 transitions, 6632 flow [2024-05-12 12:04:18,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=5611, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6632, PETRI_PLACES=233, PETRI_TRANSITIONS=441} [2024-05-12 12:04:18,454 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 178 predicate places. [2024-05-12 12:04:18,454 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 441 transitions, 6632 flow [2024-05-12 12:04:18,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:18,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:04:18,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:04:18,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-05-12 12:04:18,454 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:04:18,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:04:18,455 INFO L85 PathProgramCache]: Analyzing trace with hash -433662897, now seen corresponding path program 4 times [2024-05-12 12:04:18,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:04:18,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950262378] [2024-05-12 12:04:18,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:04:18,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:04:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:04:35,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:04:35,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:04:35,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950262378] [2024-05-12 12:04:35,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950262378] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:04:35,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:04:35,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:04:35,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926600604] [2024-05-12 12:04:35,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:04:35,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:04:35,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:04:35,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:04:35,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:04:36,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:04:36,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 441 transitions, 6632 flow. Second operand has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:36,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:04:36,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:04:36,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:04:43,873 INFO L124 PetriNetUnfolderBase]: 12031/18839 cut-off events. [2024-05-12 12:04:43,873 INFO L125 PetriNetUnfolderBase]: For 738931/738950 co-relation queries the response was YES. [2024-05-12 12:04:44,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143671 conditions, 18839 events. 12031/18839 cut-off events. For 738931/738950 co-relation queries the response was YES. Maximal size of possible extension queue 829. Compared 133069 event pairs, 2672 based on Foata normal form. 48/18483 useless extension candidates. Maximal degree in co-relation 143557. Up to 15131 conditions per place. [2024-05-12 12:04:44,125 INFO L140 encePairwiseOnDemand]: 31/49 looper letters, 466 selfloop transitions, 96 changer transitions 0/572 dead transitions. [2024-05-12 12:04:44,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 572 transitions, 9163 flow [2024-05-12 12:04:44,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:04:44,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:04:44,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 265 transitions. [2024-05-12 12:04:44,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5408163265306123 [2024-05-12 12:04:44,127 INFO L175 Difference]: Start difference. First operand has 233 places, 441 transitions, 6632 flow. Second operand 10 states and 265 transitions. [2024-05-12 12:04:44,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 572 transitions, 9163 flow [2024-05-12 12:04:46,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 572 transitions, 8927 flow, removed 46 selfloop flow, removed 5 redundant places. [2024-05-12 12:04:46,224 INFO L231 Difference]: Finished difference. Result has 241 places, 447 transitions, 6770 flow [2024-05-12 12:04:46,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=6396, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6770, PETRI_PLACES=241, PETRI_TRANSITIONS=447} [2024-05-12 12:04:46,226 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 186 predicate places. [2024-05-12 12:04:46,227 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 447 transitions, 6770 flow [2024-05-12 12:04:46,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:04:46,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:04:46,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:04:46,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-12 12:04:46,227 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:04:46,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:04:46,228 INFO L85 PathProgramCache]: Analyzing trace with hash -11321321, now seen corresponding path program 5 times [2024-05-12 12:04:46,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:04:46,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900218055] [2024-05-12 12:04:46,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:04:46,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:04:46,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:05:00,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-05-12 12:05:00,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:05:00,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900218055] [2024-05-12 12:05:00,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900218055] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:05:00,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:05:00,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:05:00,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897711447] [2024-05-12 12:05:00,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:05:00,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:05:00,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:05:00,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:05:00,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:05:01,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 49 [2024-05-12 12:05:01,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 447 transitions, 6770 flow. Second operand has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:05:01,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:05:01,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 49 [2024-05-12 12:05:01,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:05:08,801 INFO L124 PetriNetUnfolderBase]: 12249/19205 cut-off events. [2024-05-12 12:05:08,801 INFO L125 PetriNetUnfolderBase]: For 755481/755500 co-relation queries the response was YES. [2024-05-12 12:05:08,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147178 conditions, 19205 events. 12249/19205 cut-off events. For 755481/755500 co-relation queries the response was YES. Maximal size of possible extension queue 847. Compared 136216 event pairs, 2689 based on Foata normal form. 48/18839 useless extension candidates. Maximal degree in co-relation 147059. Up to 15314 conditions per place. [2024-05-12 12:05:09,081 INFO L140 encePairwiseOnDemand]: 31/49 looper letters, 467 selfloop transitions, 102 changer transitions 0/579 dead transitions. [2024-05-12 12:05:09,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 579 transitions, 9425 flow [2024-05-12 12:05:09,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:05:09,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:05:09,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 266 transitions. [2024-05-12 12:05:09,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-05-12 12:05:09,083 INFO L175 Difference]: Start difference. First operand has 241 places, 447 transitions, 6770 flow. Second operand 10 states and 266 transitions. [2024-05-12 12:05:09,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 579 transitions, 9425 flow