./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix023_tso.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix023_tso.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_tso.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix023_tso.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 23:29:55,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 23:29:55,291 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 23:29:55,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 23:29:55,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 23:29:55,322 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 23:29:55,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 23:29:55,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 23:29:55,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 23:29:55,333 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 23:29:55,333 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 23:29:55,333 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 23:29:55,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 23:29:55,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 23:29:55,334 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 23:29:55,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 23:29:55,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 23:29:55,335 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 23:29:55,336 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 23:29:55,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 23:29:55,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 23:29:55,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 23:29:55,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 23:29:55,337 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 23:29:55,337 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 23:29:55,337 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 23:29:55,338 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 23:29:55,338 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 23:29:55,338 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 23:29:55,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 23:29:55,339 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 23:29:55,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 23:29:55,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:29:55,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 23:29:55,340 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 23:29:55,340 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 23:29:55,340 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 23:29:55,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 23:29:55,341 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 23:29:55,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 23:29:55,341 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 23:29:55,341 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 23:29:55,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 23:29:55,342 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-27 23:29:55,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 23:29:55,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 23:29:55,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 23:29:55,595 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 23:29:55,595 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 23:29:55,596 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_tso.i [2024-06-27 23:29:56,626 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 23:29:56,829 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 23:29:56,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_tso.i [2024-06-27 23:29:56,842 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73c0fea30/4ec1ce94ef6c476994adf5ef8c25928a/FLAG5ed3f04c0 [2024-06-27 23:29:56,856 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73c0fea30/4ec1ce94ef6c476994adf5ef8c25928a [2024-06-27 23:29:56,858 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 23:29:56,859 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 23:29:56,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix023_tso.yml/witness.yml [2024-06-27 23:29:56,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 23:29:56,954 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 23:29:56,955 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 23:29:56,955 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 23:29:56,959 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 23:29:56,959 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:29:56" (1/2) ... [2024-06-27 23:29:56,960 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@761c3c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:29:56, skipping insertion in model container [2024-06-27 23:29:56,961 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:29:56" (1/2) ... [2024-06-27 23:29:56,962 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@37f3a1f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:29:56, skipping insertion in model container [2024-06-27 23:29:56,963 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:29:56" (2/2) ... [2024-06-27 23:29:56,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@761c3c8b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:29:56, skipping insertion in model container [2024-06-27 23:29:56,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:29:56" (2/2) ... [2024-06-27 23:29:56,963 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 23:29:56,991 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 23:29:56,992 INFO L97 edCorrectnessWitness]: Location invariant before [L927-L927] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$mem_tmp >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff0_thd0 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff1_used >= 0LL) && (0LL - (long long )z$r_buff0_thd4) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd4) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd4) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (0LL - (long long )x$flush_delayed) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd4) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd4) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$read_delayed) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff0_thd0 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )z$flush_delayed >= 0LL) && (2LL - (long long )__unbuffered_p3_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$flush_delayed >= 0LL) && (long long )a - (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$flush_delayed >= 0LL) && (long long )x - (long long )z$flush_delayed >= 0LL) && (long long )x$flush_delayed - (long long )z$flush_delayed >= 0LL) && (long long )x$mem_tmp - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff0_thd4 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff1_thd4 - (long long )z$flush_delayed >= 0LL) && (long long )x$read_delayed - (long long )z$flush_delayed >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )z$flush_delayed >= 0LL) && (long long )x$w_buff0_used - (long long )z$flush_delayed >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )z$flush_delayed >= 0LL) && (long long )x$w_buff1_used - (long long )z$flush_delayed >= 0LL) && (long long )y - (long long )z$flush_delayed >= 0LL) && (long long )z - (long long )z$flush_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff1 - (long long )z$w_buff1_used >= 0LL) && (long long )weak$$choice0 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) [2024-06-27 23:29:56,993 INFO L97 edCorrectnessWitness]: Location invariant before [L925-L925] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$mem_tmp >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff0_thd0 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff1_used >= 0LL) && (0LL - (long long )z$r_buff0_thd4) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd4) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd4) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (0LL - (long long )x$flush_delayed) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd4) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd4) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$read_delayed) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff0_thd0 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )z$flush_delayed >= 0LL) && (2LL - (long long )__unbuffered_p3_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$flush_delayed >= 0LL) && (long long )a - (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$flush_delayed >= 0LL) && (long long )x - (long long )z$flush_delayed >= 0LL) && (long long )x$flush_delayed - (long long )z$flush_delayed >= 0LL) && (long long )x$mem_tmp - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff0_thd4 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff1_thd4 - (long long )z$flush_delayed >= 0LL) && (long long )x$read_delayed - (long long )z$flush_delayed >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )z$flush_delayed >= 0LL) && (long long )x$w_buff0_used - (long long )z$flush_delayed >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )z$flush_delayed >= 0LL) && (long long )x$w_buff1_used - (long long )z$flush_delayed >= 0LL) && (long long )y - (long long )z$flush_delayed >= 0LL) && (long long )z - (long long )z$flush_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff1 - (long long )z$w_buff1_used >= 0LL) && (long long )weak$$choice0 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) [2024-06-27 23:29:56,993 INFO L97 edCorrectnessWitness]: Location invariant before [L928-L928] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$mem_tmp >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff0_thd0 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff1_used >= 0LL) && (0LL - (long long )z$r_buff0_thd4) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd4) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd4) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (0LL - (long long )x$flush_delayed) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd4) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd4) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$read_delayed) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff0_thd0 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )z$flush_delayed >= 0LL) && (2LL - (long long )__unbuffered_p3_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$flush_delayed >= 0LL) && (long long )a - (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$flush_delayed >= 0LL) && (long long )x - (long long )z$flush_delayed >= 0LL) && (long long )x$flush_delayed - (long long )z$flush_delayed >= 0LL) && (long long )x$mem_tmp - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff0_thd4 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff1_thd4 - (long long )z$flush_delayed >= 0LL) && (long long )x$read_delayed - (long long )z$flush_delayed >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )z$flush_delayed >= 0LL) && (long long )x$w_buff0_used - (long long )z$flush_delayed >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )z$flush_delayed >= 0LL) && (long long )x$w_buff1_used - (long long )z$flush_delayed >= 0LL) && (long long )y - (long long )z$flush_delayed >= 0LL) && (long long )z - (long long )z$flush_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff1 - (long long )z$w_buff1_used >= 0LL) && (long long )weak$$choice0 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) [2024-06-27 23:29:56,993 INFO L97 edCorrectnessWitness]: Location invariant before [L923-L923] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$mem_tmp >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff0_thd0 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff0_thd4 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$r_buff1_thd4 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff0_used >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$flush_delayed) + (long long )z$w_buff1_used >= 0LL) && (0LL - (long long )z$r_buff0_thd4) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd4) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd4) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (0LL - (long long )x$flush_delayed) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd4) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd4) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )x$read_delayed) - (long long )z$flush_delayed >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff0_thd0 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$flush_delayed) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )z$flush_delayed >= 0LL) && (2LL - (long long )__unbuffered_p3_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$flush_delayed >= 0LL) && (long long )a - (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$flush_delayed >= 0LL) && (long long )x - (long long )z$flush_delayed >= 0LL) && (long long )x$flush_delayed - (long long )z$flush_delayed >= 0LL) && (long long )x$mem_tmp - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff0_thd4 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )z$flush_delayed >= 0LL) && (long long )x$r_buff1_thd4 - (long long )z$flush_delayed >= 0LL) && (long long )x$read_delayed - (long long )z$flush_delayed >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )z$flush_delayed >= 0LL) && (long long )x$w_buff0_used - (long long )z$flush_delayed >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )z$flush_delayed >= 0LL) && (long long )x$w_buff1_used - (long long )z$flush_delayed >= 0LL) && (long long )y - (long long )z$flush_delayed >= 0LL) && (long long )z - (long long )z$flush_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff0_used >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1_used >= 0LL) && (long long )z$w_buff1 - (long long )z$w_buff1_used >= 0LL) && (long long )weak$$choice0 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) [2024-06-27 23:29:56,994 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 23:29:56,994 INFO L106 edCorrectnessWitness]: ghost_update [L921-L921] multithreaded = 1; [2024-06-27 23:29:57,037 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 23:29:57,359 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:29:57,372 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 23:29:57,628 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:29:57,657 INFO L206 MainTranslator]: Completed translation [2024-06-27 23:29:57,657 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:29:57 WrapperNode [2024-06-27 23:29:57,657 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 23:29:57,658 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 23:29:57,658 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 23:29:57,658 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 23:29:57,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:29:57" (1/1) ... [2024-06-27 23:29:57,687 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:29:57" (1/1) ... [2024-06-27 23:29:57,752 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 286 [2024-06-27 23:29:57,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 23:29:57,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 23:29:57,754 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 23:29:57,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 23:29:57,762 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:29:57" (1/1) ... [2024-06-27 23:29:57,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:29:57" (1/1) ... [2024-06-27 23:29:57,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:29:57" (1/1) ... [2024-06-27 23:29:57,816 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 23:29:57,816 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:29:57" (1/1) ... [2024-06-27 23:29:57,817 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:29:57" (1/1) ... [2024-06-27 23:29:57,846 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:29:57" (1/1) ... [2024-06-27 23:29:57,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:29:57" (1/1) ... [2024-06-27 23:29:57,864 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:29:57" (1/1) ... [2024-06-27 23:29:57,869 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:29:57" (1/1) ... [2024-06-27 23:29:57,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 23:29:57,880 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 23:29:57,880 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 23:29:57,880 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 23:29:57,881 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:29:57" (1/1) ... [2024-06-27 23:29:57,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:29:57,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 23:29:57,905 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 23:29:57,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 23:29:57,940 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 23:29:57,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 23:29:57,941 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 23:29:57,941 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 23:29:57,941 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 23:29:57,941 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 23:29:57,941 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 23:29:57,942 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 23:29:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-27 23:29:57,942 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-27 23:29:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 23:29:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 23:29:57,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 23:29:57,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 23:29:57,945 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 23:29:58,089 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 23:29:58,090 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 23:29:58,823 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 23:29:58,823 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 23:29:59,079 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 23:29:59,079 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 23:29:59,080 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 11:29:59 BoogieIcfgContainer [2024-06-27 23:29:59,080 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 23:29:59,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 23:29:59,083 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 23:29:59,086 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 23:29:59,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 11:29:56" (1/4) ... [2024-06-27 23:29:59,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12de0beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 11:29:59, skipping insertion in model container [2024-06-27 23:29:59,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:29:56" (2/4) ... [2024-06-27 23:29:59,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12de0beb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 11:29:59, skipping insertion in model container [2024-06-27 23:29:59,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:29:57" (3/4) ... [2024-06-27 23:29:59,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12de0beb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 11:29:59, skipping insertion in model container [2024-06-27 23:29:59,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 11:29:59" (4/4) ... [2024-06-27 23:29:59,090 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_tso.i [2024-06-27 23:29:59,104 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 23:29:59,104 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 23:29:59,105 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 23:29:59,181 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 23:29:59,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 53 transitions, 122 flow [2024-06-27 23:29:59,257 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2024-06-27 23:29:59,257 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:29:59,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 0/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-27 23:29:59,260 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 53 transitions, 122 flow [2024-06-27 23:29:59,263 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 43 transitions, 98 flow [2024-06-27 23:29:59,275 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 23:29:59,281 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;@16e22d6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 23:29:59,281 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-27 23:29:59,287 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 23:29:59,288 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-27 23:29:59,288 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:29:59,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:29:59,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 23:29:59,289 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:29:59,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:29:59,296 INFO L85 PathProgramCache]: Analyzing trace with hash 625455698, now seen corresponding path program 1 times [2024-06-27 23:29:59,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:29:59,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88552010] [2024-06-27 23:29:59,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:29:59,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:29:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:30:01,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:30:01,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:30:01,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88552010] [2024-06-27 23:30:01,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88552010] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:30:01,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:30:01,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 23:30:01,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785573390] [2024-06-27 23:30:01,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:30:01,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 23:30:01,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:30:02,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 23:30:02,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 23:30:02,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 53 [2024-06-27 23:30:02,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:30:02,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:30:02,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 53 [2024-06-27 23:30:02,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:30:06,191 INFO L124 PetriNetUnfolderBase]: 14075/19405 cut-off events. [2024-06-27 23:30:06,191 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2024-06-27 23:30:06,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38921 conditions, 19405 events. 14075/19405 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 107023 event pairs, 11070 based on Foata normal form. 1/18891 useless extension candidates. Maximal degree in co-relation 38908. Up to 18981 conditions per place. [2024-06-27 23:30:06,333 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 45 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2024-06-27 23:30:06,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 57 transitions, 235 flow [2024-06-27 23:30:06,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 23:30:06,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 23:30:06,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-06-27 23:30:06,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5849056603773585 [2024-06-27 23:30:06,344 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 98 flow. Second operand 3 states and 93 transitions. [2024-06-27 23:30:06,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 57 transitions, 235 flow [2024-06-27 23:30:06,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 228 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 23:30:06,354 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 133 flow [2024-06-27 23:30:06,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2024-06-27 23:30:06,359 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2024-06-27 23:30:06,359 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 133 flow [2024-06-27 23:30:06,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:30:06,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:30:06,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:30:06,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 23:30:06,361 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:30:06,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:30:06,361 INFO L85 PathProgramCache]: Analyzing trace with hash -232192257, now seen corresponding path program 1 times [2024-06-27 23:30:06,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:30:06,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46674669] [2024-06-27 23:30:06,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:30:06,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:30:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:30:08,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-06-27 23:30:08,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:30:08,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46674669] [2024-06-27 23:30:08,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46674669] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:30:08,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:30:08,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 23:30:08,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828676552] [2024-06-27 23:30:08,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:30:08,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 23:30:08,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:30:08,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 23:30:08,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 23:30:08,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:30:08,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:30:08,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:30:08,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:30:08,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:30:12,749 INFO L124 PetriNetUnfolderBase]: 16117/21731 cut-off events. [2024-06-27 23:30:12,750 INFO L125 PetriNetUnfolderBase]: For 3947/3947 co-relation queries the response was YES. [2024-06-27 23:30:12,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49104 conditions, 21731 events. 16117/21731 cut-off events. For 3947/3947 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 114951 event pairs, 11693 based on Foata normal form. 4/21727 useless extension candidates. Maximal degree in co-relation 49092. Up to 21646 conditions per place. [2024-06-27 23:30:12,851 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 56 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2024-06-27 23:30:12,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 329 flow [2024-06-27 23:30:12,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 23:30:12,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 23:30:12,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2024-06-27 23:30:12,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5518867924528302 [2024-06-27 23:30:12,864 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 133 flow. Second operand 4 states and 117 transitions. [2024-06-27 23:30:12,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 329 flow [2024-06-27 23:30:12,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 324 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 23:30:12,876 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 181 flow [2024-06-27 23:30:12,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-06-27 23:30:12,878 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2024-06-27 23:30:12,878 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 181 flow [2024-06-27 23:30:12,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:30:12,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:30:12,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:30:12,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 23:30:12,881 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:30:12,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:30:12,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1391976059, now seen corresponding path program 1 times [2024-06-27 23:30:12,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:30:12,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018053904] [2024-06-27 23:30:12,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:30:12,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:30:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:30:15,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:30:15,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:30:15,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018053904] [2024-06-27 23:30:15,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018053904] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:30:15,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:30:15,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:30:15,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309759458] [2024-06-27 23:30:15,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:30:15,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:30:15,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:30:15,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:30:15,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:30:15,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:30:15,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:30:15,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:30:15,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:30:15,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:30:19,454 INFO L124 PetriNetUnfolderBase]: 16097/21705 cut-off events. [2024-06-27 23:30:19,454 INFO L125 PetriNetUnfolderBase]: For 11213/11213 co-relation queries the response was YES. [2024-06-27 23:30:19,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54169 conditions, 21705 events. 16097/21705 cut-off events. For 11213/11213 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 115178 event pairs, 9531 based on Foata normal form. 8/21707 useless extension candidates. Maximal degree in co-relation 54155. Up to 21576 conditions per place. [2024-06-27 23:30:19,588 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 67 selfloop transitions, 13 changer transitions 0/86 dead transitions. [2024-06-27 23:30:19,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 86 transitions, 441 flow [2024-06-27 23:30:19,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:30:19,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:30:19,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2024-06-27 23:30:19,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5433962264150943 [2024-06-27 23:30:19,590 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 181 flow. Second operand 5 states and 144 transitions. [2024-06-27 23:30:19,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 86 transitions, 441 flow [2024-06-27 23:30:19,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 86 transitions, 422 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-27 23:30:19,594 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 229 flow [2024-06-27 23:30:19,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=229, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2024-06-27 23:30:19,595 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 5 predicate places. [2024-06-27 23:30:19,595 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 229 flow [2024-06-27 23:30:19,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:30:19,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:30:19,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:30:19,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 23:30:19,596 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:30:19,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:30:19,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1480692920, now seen corresponding path program 1 times [2024-06-27 23:30:19,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:30:19,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556040028] [2024-06-27 23:30:19,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:30:19,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:30:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:30:22,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:30:22,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:30:22,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556040028] [2024-06-27 23:30:22,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556040028] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:30:22,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:30:22,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:30:22,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389219824] [2024-06-27 23:30:22,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:30:22,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:30:22,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:30:22,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:30:22,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:30:22,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:30:22,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 229 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:30:22,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:30:22,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:30:22,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:30:26,464 INFO L124 PetriNetUnfolderBase]: 16081/21679 cut-off events. [2024-06-27 23:30:26,464 INFO L125 PetriNetUnfolderBase]: For 21720/21720 co-relation queries the response was YES. [2024-06-27 23:30:26,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59193 conditions, 21679 events. 16081/21679 cut-off events. For 21720/21720 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 114830 event pairs, 8286 based on Foata normal form. 8/21679 useless extension candidates. Maximal degree in co-relation 59178. Up to 21510 conditions per place. [2024-06-27 23:30:26,570 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 74 selfloop transitions, 16 changer transitions 0/96 dead transitions. [2024-06-27 23:30:26,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 96 transitions, 525 flow [2024-06-27 23:30:26,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:30:26,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:30:26,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 166 transitions. [2024-06-27 23:30:26,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5220125786163522 [2024-06-27 23:30:26,572 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 229 flow. Second operand 6 states and 166 transitions. [2024-06-27 23:30:26,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 96 transitions, 525 flow [2024-06-27 23:30:26,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 96 transitions, 492 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-27 23:30:26,576 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 260 flow [2024-06-27 23:30:26,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=260, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2024-06-27 23:30:26,576 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 7 predicate places. [2024-06-27 23:30:26,576 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 260 flow [2024-06-27 23:30:26,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:30:26,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:30:26,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:30:26,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 23:30:26,577 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:30:26,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:30:26,578 INFO L85 PathProgramCache]: Analyzing trace with hash -2114344531, now seen corresponding path program 1 times [2024-06-27 23:30:26,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:30:26,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4124060] [2024-06-27 23:30:26,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:30:26,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:30:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:30:30,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:30:30,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:30:30,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4124060] [2024-06-27 23:30:30,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4124060] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:30:30,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:30:30,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:30:30,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917031831] [2024-06-27 23:30:30,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:30:30,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:30:30,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:30:30,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:30:30,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:30:30,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 53 [2024-06-27 23:30:30,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 260 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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-06-27 23:30:30,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:30:30,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 53 [2024-06-27 23:30:30,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:30:34,010 INFO L124 PetriNetUnfolderBase]: 16072/21781 cut-off events. [2024-06-27 23:30:34,010 INFO L125 PetriNetUnfolderBase]: For 36718/36718 co-relation queries the response was YES. [2024-06-27 23:30:34,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63361 conditions, 21781 events. 16072/21781 cut-off events. For 36718/36718 co-relation queries the response was YES. Maximal size of possible extension queue 707. Compared 117641 event pairs, 11836 based on Foata normal form. 3/21782 useless extension candidates. Maximal degree in co-relation 63344. Up to 21588 conditions per place. [2024-06-27 23:30:34,122 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 62 selfloop transitions, 12 changer transitions 0/79 dead transitions. [2024-06-27 23:30:34,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 79 transitions, 486 flow [2024-06-27 23:30:34,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:30:34,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:30:34,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-06-27 23:30:34,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39622641509433965 [2024-06-27 23:30:34,124 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 260 flow. Second operand 6 states and 126 transitions. [2024-06-27 23:30:34,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 79 transitions, 486 flow [2024-06-27 23:30:34,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 79 transitions, 438 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-27 23:30:34,128 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 296 flow [2024-06-27 23:30:34,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=296, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2024-06-27 23:30:34,129 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 10 predicate places. [2024-06-27 23:30:34,129 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 296 flow [2024-06-27 23:30:34,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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-06-27 23:30:34,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:30:34,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:30:34,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 23:30:34,130 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:30:34,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:30:34,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1085313421, now seen corresponding path program 1 times [2024-06-27 23:30:34,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:30:34,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282352026] [2024-06-27 23:30:34,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:30:34,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:30:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:30:39,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:30:39,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:30:39,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282352026] [2024-06-27 23:30:39,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282352026] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:30:39,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:30:39,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:30:39,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298577489] [2024-06-27 23:30:39,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:30:39,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:30:39,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:30:39,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:30:39,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:30:39,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 53 [2024-06-27 23:30:39,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 296 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:30:39,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:30:39,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 53 [2024-06-27 23:30:39,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:30:43,370 INFO L124 PetriNetUnfolderBase]: 16054/21727 cut-off events. [2024-06-27 23:30:43,371 INFO L125 PetriNetUnfolderBase]: For 51843/51843 co-relation queries the response was YES. [2024-06-27 23:30:43,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68129 conditions, 21727 events. 16054/21727 cut-off events. For 51843/51843 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 116898 event pairs, 11496 based on Foata normal form. 6/21731 useless extension candidates. Maximal degree in co-relation 68109. Up to 21534 conditions per place. [2024-06-27 23:30:43,468 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 70 selfloop transitions, 16 changer transitions 0/91 dead transitions. [2024-06-27 23:30:43,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 91 transitions, 562 flow [2024-06-27 23:30:43,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:30:43,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:30:43,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2024-06-27 23:30:43,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39892183288409705 [2024-06-27 23:30:43,470 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 296 flow. Second operand 7 states and 148 transitions. [2024-06-27 23:30:43,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 91 transitions, 562 flow [2024-06-27 23:30:43,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 91 transitions, 527 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-27 23:30:43,475 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 344 flow [2024-06-27 23:30:43,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=344, PETRI_PLACES=70, PETRI_TRANSITIONS=67} [2024-06-27 23:30:43,476 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 14 predicate places. [2024-06-27 23:30:43,476 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 344 flow [2024-06-27 23:30:43,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:30:43,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:30:43,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:30:43,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 23:30:43,477 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:30:43,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:30:43,477 INFO L85 PathProgramCache]: Analyzing trace with hash 404025986, now seen corresponding path program 1 times [2024-06-27 23:30:43,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:30:43,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569404894] [2024-06-27 23:30:43,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:30:43,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:30:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:30:46,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:30:46,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:30:46,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569404894] [2024-06-27 23:30:46,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569404894] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:30:46,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:30:46,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:30:46,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896973064] [2024-06-27 23:30:46,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:30:46,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:30:46,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:30:46,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:30:46,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:30:46,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 53 [2024-06-27 23:30:46,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 67 transitions, 344 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:30:46,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:30:46,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 53 [2024-06-27 23:30:46,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:30:51,020 INFO L124 PetriNetUnfolderBase]: 16099/21809 cut-off events. [2024-06-27 23:30:51,020 INFO L125 PetriNetUnfolderBase]: For 70238/70238 co-relation queries the response was YES. [2024-06-27 23:30:51,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73412 conditions, 21809 events. 16099/21809 cut-off events. For 70238/70238 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 117312 event pairs, 11128 based on Foata normal form. 3/21810 useless extension candidates. Maximal degree in co-relation 73391. Up to 21597 conditions per place. [2024-06-27 23:30:51,124 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 82 selfloop transitions, 22 changer transitions 0/109 dead transitions. [2024-06-27 23:30:51,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 109 transitions, 698 flow [2024-06-27 23:30:51,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:30:51,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:30:51,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2024-06-27 23:30:51,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4339622641509434 [2024-06-27 23:30:51,126 INFO L175 Difference]: Start difference. First operand has 70 places, 67 transitions, 344 flow. Second operand 7 states and 161 transitions. [2024-06-27 23:30:51,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 109 transitions, 698 flow [2024-06-27 23:30:51,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 109 transitions, 647 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-27 23:30:51,133 INFO L231 Difference]: Finished difference. Result has 73 places, 78 transitions, 433 flow [2024-06-27 23:30:51,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=433, PETRI_PLACES=73, PETRI_TRANSITIONS=78} [2024-06-27 23:30:51,134 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 17 predicate places. [2024-06-27 23:30:51,134 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 78 transitions, 433 flow [2024-06-27 23:30:51,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:30:51,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:30:51,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:30:51,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 23:30:51,135 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:30:51,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:30:51,135 INFO L85 PathProgramCache]: Analyzing trace with hash 714809152, now seen corresponding path program 2 times [2024-06-27 23:30:51,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:30:51,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320848399] [2024-06-27 23:30:51,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:30:51,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:30:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:30:55,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:30:55,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:30:55,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320848399] [2024-06-27 23:30:55,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320848399] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:30:55,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:30:55,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:30:55,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647544546] [2024-06-27 23:30:55,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:30:55,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:30:55,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:30:55,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:30:55,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:30:55,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 53 [2024-06-27 23:30:55,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 78 transitions, 433 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:30:55,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:30:55,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 53 [2024-06-27 23:30:55,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:30:59,472 INFO L124 PetriNetUnfolderBase]: 16157/21889 cut-off events. [2024-06-27 23:30:59,472 INFO L125 PetriNetUnfolderBase]: For 92652/92652 co-relation queries the response was YES. [2024-06-27 23:30:59,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79056 conditions, 21889 events. 16157/21889 cut-off events. For 92652/92652 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 117965 event pairs, 11129 based on Foata normal form. 3/21888 useless extension candidates. Maximal degree in co-relation 79033. Up to 21659 conditions per place. [2024-06-27 23:30:59,577 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 80 selfloop transitions, 29 changer transitions 0/114 dead transitions. [2024-06-27 23:30:59,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 114 transitions, 851 flow [2024-06-27 23:30:59,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:30:59,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:30:59,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2024-06-27 23:30:59,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40431266846361186 [2024-06-27 23:30:59,578 INFO L175 Difference]: Start difference. First operand has 73 places, 78 transitions, 433 flow. Second operand 7 states and 150 transitions. [2024-06-27 23:30:59,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 114 transitions, 851 flow [2024-06-27 23:30:59,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 114 transitions, 747 flow, removed 29 selfloop flow, removed 4 redundant places. [2024-06-27 23:30:59,592 INFO L231 Difference]: Finished difference. Result has 76 places, 91 transitions, 547 flow [2024-06-27 23:30:59,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=547, PETRI_PLACES=76, PETRI_TRANSITIONS=91} [2024-06-27 23:30:59,594 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 20 predicate places. [2024-06-27 23:30:59,594 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 91 transitions, 547 flow [2024-06-27 23:30:59,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:30:59,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:30:59,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:30:59,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 23:30:59,594 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:30:59,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:30:59,595 INFO L85 PathProgramCache]: Analyzing trace with hash -365503028, now seen corresponding path program 3 times [2024-06-27 23:30:59,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:30:59,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981039296] [2024-06-27 23:30:59,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:30:59,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:30:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:31:03,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:31:03,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:31:03,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981039296] [2024-06-27 23:31:03,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981039296] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:31:03,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:31:03,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:31:03,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034229578] [2024-06-27 23:31:03,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:31:03,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:31:03,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:31:03,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:31:03,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:31:03,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 53 [2024-06-27 23:31:03,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 91 transitions, 547 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:31:03,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:31:03,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 53 [2024-06-27 23:31:03,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:31:07,965 INFO L124 PetriNetUnfolderBase]: 16148/21879 cut-off events. [2024-06-27 23:31:07,966 INFO L125 PetriNetUnfolderBase]: For 118616/118616 co-relation queries the response was YES. [2024-06-27 23:31:08,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83956 conditions, 21879 events. 16148/21879 cut-off events. For 118616/118616 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 117828 event pairs, 11135 based on Foata normal form. 3/21876 useless extension candidates. Maximal degree in co-relation 83932. Up to 21602 conditions per place. [2024-06-27 23:31:08,080 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 73 selfloop transitions, 40 changer transitions 0/118 dead transitions. [2024-06-27 23:31:08,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 118 transitions, 897 flow [2024-06-27 23:31:08,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:31:08,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:31:08,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2024-06-27 23:31:08,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40431266846361186 [2024-06-27 23:31:08,084 INFO L175 Difference]: Start difference. First operand has 76 places, 91 transitions, 547 flow. Second operand 7 states and 150 transitions. [2024-06-27 23:31:08,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 118 transitions, 897 flow [2024-06-27 23:31:08,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 118 transitions, 844 flow, removed 14 selfloop flow, removed 2 redundant places. [2024-06-27 23:31:08,100 INFO L231 Difference]: Finished difference. Result has 81 places, 95 transitions, 645 flow [2024-06-27 23:31:08,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=645, PETRI_PLACES=81, PETRI_TRANSITIONS=95} [2024-06-27 23:31:08,101 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 25 predicate places. [2024-06-27 23:31:08,101 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 95 transitions, 645 flow [2024-06-27 23:31:08,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:31:08,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:31:08,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:31:08,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 23:31:08,102 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:31:08,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:31:08,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2037251546, now seen corresponding path program 1 times [2024-06-27 23:31:08,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:31:08,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291776192] [2024-06-27 23:31:08,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:31:08,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:31:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:31:11,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:31:11,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:31:11,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291776192] [2024-06-27 23:31:11,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291776192] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:31:11,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:31:11,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:31:11,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372928409] [2024-06-27 23:31:11,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:31:11,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:31:11,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:31:11,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:31:11,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:31:11,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 53 [2024-06-27 23:31:11,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 95 transitions, 645 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:31:11,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:31:11,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 53 [2024-06-27 23:31:11,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:31:15,902 INFO L124 PetriNetUnfolderBase]: 16215/21891 cut-off events. [2024-06-27 23:31:15,903 INFO L125 PetriNetUnfolderBase]: For 141909/141925 co-relation queries the response was YES. [2024-06-27 23:31:15,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89331 conditions, 21891 events. 16215/21891 cut-off events. For 141909/141925 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 116735 event pairs, 8842 based on Foata normal form. 22/21910 useless extension candidates. Maximal degree in co-relation 89305. Up to 21661 conditions per place. [2024-06-27 23:31:16,030 INFO L140 encePairwiseOnDemand]: 37/53 looper letters, 108 selfloop transitions, 39 changer transitions 0/152 dead transitions. [2024-06-27 23:31:16,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 152 transitions, 1167 flow [2024-06-27 23:31:16,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:31:16,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:31:16,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2024-06-27 23:31:16,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4410377358490566 [2024-06-27 23:31:16,031 INFO L175 Difference]: Start difference. First operand has 81 places, 95 transitions, 645 flow. Second operand 8 states and 187 transitions. [2024-06-27 23:31:16,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 152 transitions, 1167 flow [2024-06-27 23:31:16,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 152 transitions, 1048 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-06-27 23:31:16,048 INFO L231 Difference]: Finished difference. Result has 86 places, 110 transitions, 747 flow [2024-06-27 23:31:16,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=747, PETRI_PLACES=86, PETRI_TRANSITIONS=110} [2024-06-27 23:31:16,049 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 30 predicate places. [2024-06-27 23:31:16,049 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 110 transitions, 747 flow [2024-06-27 23:31:16,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:31:16,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:31:16,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:31:16,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 23:31:16,049 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:31:16,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:31:16,050 INFO L85 PathProgramCache]: Analyzing trace with hash -396223018, now seen corresponding path program 2 times [2024-06-27 23:31:16,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:31:16,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194005782] [2024-06-27 23:31:16,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:31:16,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:31:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:31:19,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:31:19,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:31:19,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194005782] [2024-06-27 23:31:19,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194005782] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:31:19,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:31:19,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:31:19,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666985152] [2024-06-27 23:31:19,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:31:19,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:31:19,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:31:19,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:31:19,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:31:20,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 53 [2024-06-27 23:31:20,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 110 transitions, 747 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:31:20,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:31:20,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 53 [2024-06-27 23:31:20,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:31:24,630 INFO L124 PetriNetUnfolderBase]: 16359/22072 cut-off events. [2024-06-27 23:31:24,630 INFO L125 PetriNetUnfolderBase]: For 174180/174200 co-relation queries the response was YES. [2024-06-27 23:31:24,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97560 conditions, 22072 events. 16359/22072 cut-off events. For 174180/174200 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 117060 event pairs, 8496 based on Foata normal form. 26/22096 useless extension candidates. Maximal degree in co-relation 97531. Up to 21799 conditions per place. [2024-06-27 23:31:24,776 INFO L140 encePairwiseOnDemand]: 37/53 looper letters, 112 selfloop transitions, 57 changer transitions 0/174 dead transitions. [2024-06-27 23:31:24,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 174 transitions, 1466 flow [2024-06-27 23:31:24,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:31:24,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:31:24,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2024-06-27 23:31:24,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44339622641509435 [2024-06-27 23:31:24,778 INFO L175 Difference]: Start difference. First operand has 86 places, 110 transitions, 747 flow. Second operand 8 states and 188 transitions. [2024-06-27 23:31:24,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 174 transitions, 1466 flow [2024-06-27 23:31:24,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 174 transitions, 1315 flow, removed 52 selfloop flow, removed 3 redundant places. [2024-06-27 23:31:24,803 INFO L231 Difference]: Finished difference. Result has 93 places, 135 transitions, 1030 flow [2024-06-27 23:31:24,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1030, PETRI_PLACES=93, PETRI_TRANSITIONS=135} [2024-06-27 23:31:24,804 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 37 predicate places. [2024-06-27 23:31:24,804 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 135 transitions, 1030 flow [2024-06-27 23:31:24,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:31:24,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:31:24,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:31:24,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 23:31:24,804 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:31:24,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:31:24,805 INFO L85 PathProgramCache]: Analyzing trace with hash -396103048, now seen corresponding path program 3 times [2024-06-27 23:31:24,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:31:24,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575127251] [2024-06-27 23:31:24,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:31:24,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:31:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:31:28,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-06-27 23:31:28,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:31:28,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575127251] [2024-06-27 23:31:28,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575127251] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:31:28,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:31:28,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:31:28,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953527556] [2024-06-27 23:31:28,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:31:28,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:31:28,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:31:28,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:31:28,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:31:29,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 53 [2024-06-27 23:31:29,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 135 transitions, 1030 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:31:29,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:31:29,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 53 [2024-06-27 23:31:29,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:31:33,485 INFO L124 PetriNetUnfolderBase]: 16434/22183 cut-off events. [2024-06-27 23:31:33,485 INFO L125 PetriNetUnfolderBase]: For 213160/213168 co-relation queries the response was YES. [2024-06-27 23:31:33,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103524 conditions, 22183 events. 16434/22183 cut-off events. For 213160/213168 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 117864 event pairs, 8381 based on Foata normal form. 14/22195 useless extension candidates. Maximal degree in co-relation 103492. Up to 21791 conditions per place. [2024-06-27 23:31:33,646 INFO L140 encePairwiseOnDemand]: 38/53 looper letters, 108 selfloop transitions, 73 changer transitions 0/186 dead transitions. [2024-06-27 23:31:33,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 186 transitions, 1766 flow [2024-06-27 23:31:33,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:31:33,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:31:33,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 192 transitions. [2024-06-27 23:31:33,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4528301886792453 [2024-06-27 23:31:33,648 INFO L175 Difference]: Start difference. First operand has 93 places, 135 transitions, 1030 flow. Second operand 8 states and 192 transitions. [2024-06-27 23:31:33,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 186 transitions, 1766 flow [2024-06-27 23:31:33,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 186 transitions, 1649 flow, removed 35 selfloop flow, removed 3 redundant places. [2024-06-27 23:31:33,687 INFO L231 Difference]: Finished difference. Result has 98 places, 143 transitions, 1235 flow [2024-06-27 23:31:33,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1235, PETRI_PLACES=98, PETRI_TRANSITIONS=143} [2024-06-27 23:31:33,688 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 42 predicate places. [2024-06-27 23:31:33,688 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 143 transitions, 1235 flow [2024-06-27 23:31:33,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:31:33,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:31:33,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:31:33,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 23:31:33,688 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:31:33,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:31:33,689 INFO L85 PathProgramCache]: Analyzing trace with hash -396102862, now seen corresponding path program 1 times [2024-06-27 23:31:33,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:31:33,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149247959] [2024-06-27 23:31:33,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:31:33,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:31:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:31:39,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:31:39,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:31:39,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149247959] [2024-06-27 23:31:39,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149247959] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:31:39,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:31:39,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:31:39,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726425019] [2024-06-27 23:31:39,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:31:39,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:31:39,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:31:39,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:31:39,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:31:39,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 53 [2024-06-27 23:31:39,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 143 transitions, 1235 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:31:39,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:31:39,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 53 [2024-06-27 23:31:39,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:31:44,300 INFO L124 PetriNetUnfolderBase]: 16456/22298 cut-off events. [2024-06-27 23:31:44,300 INFO L125 PetriNetUnfolderBase]: For 267636/267644 co-relation queries the response was YES. [2024-06-27 23:31:44,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108540 conditions, 22298 events. 16456/22298 cut-off events. For 267636/267644 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 119956 event pairs, 9825 based on Foata normal form. 11/22307 useless extension candidates. Maximal degree in co-relation 108507. Up to 22046 conditions per place. [2024-06-27 23:31:44,444 INFO L140 encePairwiseOnDemand]: 38/53 looper letters, 145 selfloop transitions, 35 changer transitions 0/185 dead transitions. [2024-06-27 23:31:44,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 185 transitions, 1793 flow [2024-06-27 23:31:44,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:31:44,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:31:44,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2024-06-27 23:31:44,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42924528301886794 [2024-06-27 23:31:44,446 INFO L175 Difference]: Start difference. First operand has 98 places, 143 transitions, 1235 flow. Second operand 8 states and 182 transitions. [2024-06-27 23:31:44,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 185 transitions, 1793 flow [2024-06-27 23:31:44,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 185 transitions, 1674 flow, removed 31 selfloop flow, removed 4 redundant places. [2024-06-27 23:31:44,545 INFO L231 Difference]: Finished difference. Result has 102 places, 147 transitions, 1270 flow [2024-06-27 23:31:44,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1270, PETRI_PLACES=102, PETRI_TRANSITIONS=147} [2024-06-27 23:31:44,546 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 46 predicate places. [2024-06-27 23:31:44,546 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 147 transitions, 1270 flow [2024-06-27 23:31:44,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:31:44,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:31:44,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:31:44,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 23:31:44,547 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:31:44,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:31:44,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1598530316, now seen corresponding path program 4 times [2024-06-27 23:31:44,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:31:44,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099812892] [2024-06-27 23:31:44,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:31:44,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:31:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:31:49,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:31:49,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:31:49,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099812892] [2024-06-27 23:31:49,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099812892] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:31:49,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:31:49,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:31:49,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312913857] [2024-06-27 23:31:49,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:31:49,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:31:49,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:31:49,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:31:49,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:31:49,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 53 [2024-06-27 23:31:49,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 147 transitions, 1270 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:31:49,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:31:49,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 53 [2024-06-27 23:31:49,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:31:54,324 INFO L124 PetriNetUnfolderBase]: 16656/22495 cut-off events. [2024-06-27 23:31:54,325 INFO L125 PetriNetUnfolderBase]: For 291804/291818 co-relation queries the response was YES. [2024-06-27 23:31:54,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114831 conditions, 22495 events. 16656/22495 cut-off events. For 291804/291818 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 119112 event pairs, 8282 based on Foata normal form. 18/22503 useless extension candidates. Maximal degree in co-relation 114796. Up to 22134 conditions per place. [2024-06-27 23:31:54,460 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 133 selfloop transitions, 75 changer transitions 0/213 dead transitions. [2024-06-27 23:31:54,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 213 transitions, 2140 flow [2024-06-27 23:31:54,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:31:54,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:31:54,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2024-06-27 23:31:54,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4528301886792453 [2024-06-27 23:31:54,462 INFO L175 Difference]: Start difference. First operand has 102 places, 147 transitions, 1270 flow. Second operand 7 states and 168 transitions. [2024-06-27 23:31:54,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 213 transitions, 2140 flow [2024-06-27 23:31:54,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 213 transitions, 2020 flow, removed 28 selfloop flow, removed 6 redundant places. [2024-06-27 23:31:54,543 INFO L231 Difference]: Finished difference. Result has 104 places, 181 transitions, 1720 flow [2024-06-27 23:31:54,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1150, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1720, PETRI_PLACES=104, PETRI_TRANSITIONS=181} [2024-06-27 23:31:54,544 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 48 predicate places. [2024-06-27 23:31:54,544 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 181 transitions, 1720 flow [2024-06-27 23:31:54,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:31:54,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:31:54,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:31:54,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 23:31:54,545 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:31:54,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:31:54,545 INFO L85 PathProgramCache]: Analyzing trace with hash -2111934620, now seen corresponding path program 5 times [2024-06-27 23:31:54,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:31:54,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802374795] [2024-06-27 23:31:54,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:31:54,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:31:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:31:59,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:31:59,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:31:59,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802374795] [2024-06-27 23:31:59,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802374795] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:31:59,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:31:59,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:31:59,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806955957] [2024-06-27 23:31:59,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:31:59,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:31:59,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:31:59,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:31:59,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:31:59,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 53 [2024-06-27 23:31:59,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 181 transitions, 1720 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:31:59,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:31:59,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 53 [2024-06-27 23:31:59,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:32:04,787 INFO L124 PetriNetUnfolderBase]: 16792/22679 cut-off events. [2024-06-27 23:32:04,787 INFO L125 PetriNetUnfolderBase]: For 343180/343190 co-relation queries the response was YES. [2024-06-27 23:32:04,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121715 conditions, 22679 events. 16792/22679 cut-off events. For 343180/343190 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 119912 event pairs, 8289 based on Foata normal form. 14/22683 useless extension candidates. Maximal degree in co-relation 121677. Up to 22208 conditions per place. [2024-06-27 23:32:04,920 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 135 selfloop transitions, 93 changer transitions 0/233 dead transitions. [2024-06-27 23:32:04,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 233 transitions, 2672 flow [2024-06-27 23:32:04,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:32:04,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:32:04,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions. [2024-06-27 23:32:04,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43160377358490565 [2024-06-27 23:32:04,921 INFO L175 Difference]: Start difference. First operand has 104 places, 181 transitions, 1720 flow. Second operand 8 states and 183 transitions. [2024-06-27 23:32:04,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 233 transitions, 2672 flow [2024-06-27 23:32:05,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 233 transitions, 2563 flow, removed 25 selfloop flow, removed 1 redundant places. [2024-06-27 23:32:05,034 INFO L231 Difference]: Finished difference. Result has 112 places, 197 transitions, 2155 flow [2024-06-27 23:32:05,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1611, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2155, PETRI_PLACES=112, PETRI_TRANSITIONS=197} [2024-06-27 23:32:05,034 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 56 predicate places. [2024-06-27 23:32:05,034 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 197 transitions, 2155 flow [2024-06-27 23:32:05,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:32:05,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:32:05,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:32:05,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 23:32:05,035 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:32:05,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:32:05,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2111934434, now seen corresponding path program 2 times [2024-06-27 23:32:05,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:32:05,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499841365] [2024-06-27 23:32:05,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:32:05,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:32:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:32:11,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:32:11,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:32:11,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499841365] [2024-06-27 23:32:11,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499841365] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:32:11,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:32:11,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:32:11,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672065437] [2024-06-27 23:32:11,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:32:11,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:32:11,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:32:11,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:32:11,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:32:11,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 53 [2024-06-27 23:32:11,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 197 transitions, 2155 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:32:11,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:32:11,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 53 [2024-06-27 23:32:11,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:32:17,575 INFO L124 PetriNetUnfolderBase]: 16854/22846 cut-off events. [2024-06-27 23:32:17,575 INFO L125 PetriNetUnfolderBase]: For 418696/418710 co-relation queries the response was YES. [2024-06-27 23:32:17,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127677 conditions, 22846 events. 16854/22846 cut-off events. For 418696/418710 co-relation queries the response was YES. Maximal size of possible extension queue 703. Compared 122427 event pairs, 9853 based on Foata normal form. 18/22860 useless extension candidates. Maximal degree in co-relation 127635. Up to 22554 conditions per place. [2024-06-27 23:32:17,707 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 195 selfloop transitions, 36 changer transitions 0/236 dead transitions. [2024-06-27 23:32:17,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 236 transitions, 2825 flow [2024-06-27 23:32:17,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:32:17,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:32:17,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2024-06-27 23:32:17,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4056603773584906 [2024-06-27 23:32:17,709 INFO L175 Difference]: Start difference. First operand has 112 places, 197 transitions, 2155 flow. Second operand 8 states and 172 transitions. [2024-06-27 23:32:17,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 236 transitions, 2825 flow [2024-06-27 23:32:17,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 236 transitions, 2719 flow, removed 37 selfloop flow, removed 3 redundant places. [2024-06-27 23:32:17,836 INFO L231 Difference]: Finished difference. Result has 117 places, 204 transitions, 2242 flow [2024-06-27 23:32:17,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2049, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2242, PETRI_PLACES=117, PETRI_TRANSITIONS=204} [2024-06-27 23:32:17,837 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 61 predicate places. [2024-06-27 23:32:17,837 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 204 transitions, 2242 flow [2024-06-27 23:32:17,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:32:17,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:32:17,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:32:17,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 23:32:17,838 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:32:17,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:32:17,838 INFO L85 PathProgramCache]: Analyzing trace with hash 690915602, now seen corresponding path program 3 times [2024-06-27 23:32:17,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:32:17,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702964837] [2024-06-27 23:32:17,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:32:17,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:32:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:32:23,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:32:23,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:32:23,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702964837] [2024-06-27 23:32:23,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702964837] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:32:23,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:32:23,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:32:23,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460954264] [2024-06-27 23:32:23,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:32:23,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:32:23,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:32:23,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:32:23,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:32:23,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 53 [2024-06-27 23:32:23,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 204 transitions, 2242 flow. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:32:23,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:32:23,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 53 [2024-06-27 23:32:23,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:32:29,017 INFO L124 PetriNetUnfolderBase]: 16898/22898 cut-off events. [2024-06-27 23:32:29,017 INFO L125 PetriNetUnfolderBase]: For 465919/465943 co-relation queries the response was YES. [2024-06-27 23:32:29,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133080 conditions, 22898 events. 16898/22898 cut-off events. For 465919/465943 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 122607 event pairs, 9481 based on Foata normal form. 26/22918 useless extension candidates. Maximal degree in co-relation 133036. Up to 22439 conditions per place. [2024-06-27 23:32:29,165 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 181 selfloop transitions, 61 changer transitions 0/247 dead transitions. [2024-06-27 23:32:29,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 247 transitions, 3122 flow [2024-06-27 23:32:29,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:32:29,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:32:29,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2024-06-27 23:32:29,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41745283018867924 [2024-06-27 23:32:29,166 INFO L175 Difference]: Start difference. First operand has 117 places, 204 transitions, 2242 flow. Second operand 8 states and 177 transitions. [2024-06-27 23:32:29,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 247 transitions, 3122 flow [2024-06-27 23:32:29,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 247 transitions, 2993 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-27 23:32:29,294 INFO L231 Difference]: Finished difference. Result has 119 places, 212 transitions, 2430 flow [2024-06-27 23:32:29,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2113, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2430, PETRI_PLACES=119, PETRI_TRANSITIONS=212} [2024-06-27 23:32:29,295 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 63 predicate places. [2024-06-27 23:32:29,295 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 212 transitions, 2430 flow [2024-06-27 23:32:29,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:32:29,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:32:29,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:32:29,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 23:32:29,295 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:32:29,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:32:29,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1554310150, now seen corresponding path program 4 times [2024-06-27 23:32:29,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:32:29,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893561064] [2024-06-27 23:32:29,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:32:29,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:32:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat