./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix030_power.oepc_pso.oepc_rmo.oepc.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/mix030_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix030_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 23:36:15,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 23:36:15,923 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 23:36:15,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 23:36:15,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 23:36:15,939 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 23:36:15,940 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 23:36:15,940 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 23:36:15,941 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 23:36:15,941 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 23:36:15,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 23:36:15,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 23:36:15,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 23:36:15,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 23:36:15,943 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 23:36:15,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 23:36:15,943 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 23:36:15,943 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 23:36:15,944 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 23:36:15,944 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 23:36:15,944 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 23:36:15,944 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 23:36:15,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 23:36:15,945 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 23:36:15,945 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 23:36:15,945 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 23:36:15,945 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 23:36:15,945 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 23:36:15,946 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 23:36:15,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 23:36:15,946 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 23:36:15,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 23:36:15,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:36:15,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 23:36:15,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 23:36:15,947 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 23:36:15,947 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 23:36:15,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 23:36:15,947 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 23:36:15,947 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 23:36:15,947 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 23:36:15,947 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 23:36:15,947 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 23:36:15,948 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:36:16,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 23:36:16,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 23:36:16,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 23:36:16,121 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 23:36:16,122 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 23:36:16,123 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/mix030_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-27 23:36:16,218 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 23:36:16,218 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 23:36:16,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 23:36:17,112 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 23:36:17,313 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 23:36:17,314 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 23:36:17,323 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f557764a/9fb4cfc6d78b4161ab7046a061af5900/FLAGa71e9a95f [2024-06-27 23:36:17,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f557764a/9fb4cfc6d78b4161ab7046a061af5900 [2024-06-27 23:36:17,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 23:36:17,335 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 23:36:17,336 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 23:36:17,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 23:36:17,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 23:36:17,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:36:16" (1/2) ... [2024-06-27 23:36:17,348 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e954a11 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:36:17, skipping insertion in model container [2024-06-27 23:36:17,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:36:16" (1/2) ... [2024-06-27 23:36:17,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@311a9de5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:36:17, skipping insertion in model container [2024-06-27 23:36:17,349 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:36:17" (2/2) ... [2024-06-27 23:36:17,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e954a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:36:17, skipping insertion in model container [2024-06-27 23:36:17,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:36:17" (2/2) ... [2024-06-27 23:36:17,349 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 23:36:17,379 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 23:36:17,379 INFO L97 edCorrectnessWitness]: Location invariant before [L869-L869] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 23:36:17,380 INFO L97 edCorrectnessWitness]: Location invariant before [L867-L867] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 23:36:17,380 INFO L97 edCorrectnessWitness]: Location invariant before [L870-L870] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 23:36:17,380 INFO L97 edCorrectnessWitness]: Location invariant before [L865-L865] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL && (0LL - (long long )__unbuffered_p3_EBX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 23:36:17,381 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 23:36:17,381 INFO L106 edCorrectnessWitness]: ghost_update [L863-L863] multithreaded = 1; [2024-06-27 23:36:17,409 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 23:36:17,674 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:36:17,686 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:36:17,887 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:36:17,926 INFO L206 MainTranslator]: Completed translation [2024-06-27 23:36:17,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:36:17 WrapperNode [2024-06-27 23:36:17,927 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 23:36:17,928 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 23:36:17,928 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 23:36:17,929 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 23:36:17,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:36:17" (1/1) ... [2024-06-27 23:36:17,965 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:36:17" (1/1) ... [2024-06-27 23:36:18,011 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-06-27 23:36:18,011 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 23:36:18,012 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 23:36:18,012 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 23:36:18,012 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 23:36:18,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:36:17" (1/1) ... [2024-06-27 23:36:18,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:36:17" (1/1) ... [2024-06-27 23:36:18,027 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:36:17" (1/1) ... [2024-06-27 23:36:18,083 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:36:18,089 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:36:17" (1/1) ... [2024-06-27 23:36:18,089 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:36:17" (1/1) ... [2024-06-27 23:36:18,124 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:36:17" (1/1) ... [2024-06-27 23:36:18,126 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:36:17" (1/1) ... [2024-06-27 23:36:18,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:36:17" (1/1) ... [2024-06-27 23:36:18,142 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:36:17" (1/1) ... [2024-06-27 23:36:18,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 23:36:18,154 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 23:36:18,154 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 23:36:18,154 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 23:36:18,155 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:36:17" (1/1) ... [2024-06-27 23:36:18,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:36:18,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 23:36:18,176 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:36:18,179 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:36:18,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 23:36:18,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 23:36:18,205 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 23:36:18,205 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 23:36:18,206 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 23:36:18,206 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 23:36:18,206 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 23:36:18,206 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 23:36:18,206 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-27 23:36:18,207 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-27 23:36:18,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 23:36:18,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 23:36:18,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 23:36:18,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 23:36:18,209 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:36:18,302 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 23:36:18,304 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 23:36:18,820 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 23:36:18,820 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 23:36:18,987 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 23:36:18,987 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 23:36:18,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 11:36:18 BoogieIcfgContainer [2024-06-27 23:36:18,988 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 23:36:18,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 23:36:18,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 23:36:18,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 23:36:18,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:36:16" (1/4) ... [2024-06-27 23:36:18,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52987a8c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 11:36:18, skipping insertion in model container [2024-06-27 23:36:18,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 11:36:17" (2/4) ... [2024-06-27 23:36:18,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52987a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 11:36:18, skipping insertion in model container [2024-06-27 23:36:18,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:36:17" (3/4) ... [2024-06-27 23:36:18,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52987a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 11:36:18, skipping insertion in model container [2024-06-27 23:36:18,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 11:36:18" (4/4) ... [2024-06-27 23:36:18,998 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 23:36:19,010 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 23:36:19,011 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 23:36:19,011 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 23:36:19,066 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 23:36:19,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 52 transitions, 120 flow [2024-06-27 23:36:19,129 INFO L124 PetriNetUnfolderBase]: 0/48 cut-off events. [2024-06-27 23:36:19,129 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:36:19,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 48 events. 0/48 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-27 23:36:19,130 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 52 transitions, 120 flow [2024-06-27 23:36:19,134 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 42 transitions, 96 flow [2024-06-27 23:36:19,148 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 23:36:19,169 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;@11192ac7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 23:36:19,170 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-27 23:36:19,173 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 23:36:19,173 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 23:36:19,173 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:36:19,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:36:19,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 23:36:19,174 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:36:19,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:36:19,194 INFO L85 PathProgramCache]: Analyzing trace with hash 397819080, now seen corresponding path program 1 times [2024-06-27 23:36:19,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:36:19,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373454218] [2024-06-27 23:36:19,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:36:19,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:36:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:36:20,781 INFO 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:36:20,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:36:20,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373454218] [2024-06-27 23:36:20,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373454218] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:36:20,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:36:20,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 23:36:20,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944382755] [2024-06-27 23:36:20,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:36:20,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 23:36:20,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:36:20,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 23:36:20,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 23:36:20,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2024-06-27 23:36:20,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 96 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:36:20,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:36:20,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2024-06-27 23:36:20,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:36:23,313 INFO L124 PetriNetUnfolderBase]: 14075/19357 cut-off events. [2024-06-27 23:36:23,313 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2024-06-27 23:36:23,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38873 conditions, 19357 events. 14075/19357 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 104165 event pairs, 11070 based on Foata normal form. 1/19101 useless extension candidates. Maximal degree in co-relation 38860. Up to 18981 conditions per place. [2024-06-27 23:36:23,397 INFO L140 encePairwiseOnDemand]: 43/52 looper letters, 45 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2024-06-27 23:36:23,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 56 transitions, 233 flow [2024-06-27 23:36:23,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 23:36:23,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 23:36:23,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-06-27 23:36:23,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5961538461538461 [2024-06-27 23:36:23,408 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 96 flow. Second operand 3 states and 93 transitions. [2024-06-27 23:36:23,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 56 transitions, 233 flow [2024-06-27 23:36:23,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 56 transitions, 226 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 23:36:23,416 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 131 flow [2024-06-27 23:36:23,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2024-06-27 23:36:23,420 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -1 predicate places. [2024-06-27 23:36:23,421 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 131 flow [2024-06-27 23:36:23,421 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:36:23,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:36:23,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:36:23,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 23:36:23,422 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:36:23,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:36:23,422 INFO L85 PathProgramCache]: Analyzing trace with hash 52081831, now seen corresponding path program 1 times [2024-06-27 23:36:23,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:36:23,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293759626] [2024-06-27 23:36:23,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:36:23,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:36:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:36:24,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:36:24,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:36:24,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293759626] [2024-06-27 23:36:24,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293759626] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:36:24,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:36:24,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 23:36:24,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254467735] [2024-06-27 23:36:24,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:36:24,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 23:36:24,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:36:24,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 23:36:24,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 23:36:24,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2024-06-27 23:36:24,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:36:24,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:36:24,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2024-06-27 23:36:24,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:36:26,695 INFO L124 PetriNetUnfolderBase]: 14065/19343 cut-off events. [2024-06-27 23:36:26,695 INFO L125 PetriNetUnfolderBase]: For 3370/3370 co-relation queries the response was YES. [2024-06-27 23:36:26,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43476 conditions, 19343 events. 14065/19343 cut-off events. For 3370/3370 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 104303 event pairs, 10115 based on Foata normal form. 4/19345 useless extension candidates. Maximal degree in co-relation 43464. Up to 18946 conditions per place. [2024-06-27 23:36:26,772 INFO L140 encePairwiseOnDemand]: 42/52 looper letters, 55 selfloop transitions, 9 changer transitions 0/70 dead transitions. [2024-06-27 23:36:26,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 70 transitions, 325 flow [2024-06-27 23:36:26,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 23:36:26,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 23:36:26,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2024-06-27 23:36:26,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5769230769230769 [2024-06-27 23:36:26,774 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 131 flow. Second operand 4 states and 120 transitions. [2024-06-27 23:36:26,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 70 transitions, 325 flow [2024-06-27 23:36:26,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 70 transitions, 320 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 23:36:26,777 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 179 flow [2024-06-27 23:36:26,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2024-06-27 23:36:26,777 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2024-06-27 23:36:26,778 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 179 flow [2024-06-27 23:36:26,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:36:26,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:36:26,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:36:26,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 23:36:26,779 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:36:26,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:36:26,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1614537925, now seen corresponding path program 1 times [2024-06-27 23:36:26,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:36:26,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669153546] [2024-06-27 23:36:26,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:36:26,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:36:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:36:27,757 INFO 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:36:27,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:36:27,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669153546] [2024-06-27 23:36:27,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669153546] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:36:27,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:36:27,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:36:27,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472765268] [2024-06-27 23:36:27,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:36:27,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:36:27,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:36:27,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:36:27,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:36:27,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2024-06-27 23:36:27,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:36:27,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:36:27,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2024-06-27 23:36:27,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:36:30,132 INFO L124 PetriNetUnfolderBase]: 14083/19367 cut-off events. [2024-06-27 23:36:30,132 INFO L125 PetriNetUnfolderBase]: For 9702/9702 co-relation queries the response was YES. [2024-06-27 23:36:30,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48148 conditions, 19367 events. 14083/19367 cut-off events. For 9702/9702 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 104160 event pairs, 8523 based on Foata normal form. 7/19371 useless extension candidates. Maximal degree in co-relation 48134. Up to 18867 conditions per place. [2024-06-27 23:36:30,239 INFO L140 encePairwiseOnDemand]: 40/52 looper letters, 73 selfloop transitions, 21 changer transitions 0/100 dead transitions. [2024-06-27 23:36:30,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 100 transitions, 541 flow [2024-06-27 23:36:30,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:36:30,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:36:30,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2024-06-27 23:36:30,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6038461538461538 [2024-06-27 23:36:30,242 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 179 flow. Second operand 5 states and 157 transitions. [2024-06-27 23:36:30,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 100 transitions, 541 flow [2024-06-27 23:36:30,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 100 transitions, 522 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-27 23:36:30,246 INFO L231 Difference]: Finished difference. Result has 62 places, 64 transitions, 310 flow [2024-06-27 23:36:30,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=310, PETRI_PLACES=62, PETRI_TRANSITIONS=64} [2024-06-27 23:36:30,247 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 7 predicate places. [2024-06-27 23:36:30,247 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 64 transitions, 310 flow [2024-06-27 23:36:30,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:36:30,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:36:30,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:36:30,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 23:36:30,248 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:36:30,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:36:30,249 INFO L85 PathProgramCache]: Analyzing trace with hash -602350522, now seen corresponding path program 1 times [2024-06-27 23:36:30,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:36:30,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390805130] [2024-06-27 23:36:30,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:36:30,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:36:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:36:31,662 INFO 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:36:31,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:36:31,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390805130] [2024-06-27 23:36:31,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390805130] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:36:31,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:36:31,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:36:31,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768318397] [2024-06-27 23:36:31,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:36:31,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:36:31,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:36:31,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:36:31,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:36:31,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 52 [2024-06-27 23:36:31,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 64 transitions, 310 flow. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:36:31,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:36:31,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 52 [2024-06-27 23:36:31,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:36:33,899 INFO L124 PetriNetUnfolderBase]: 14101/19384 cut-off events. [2024-06-27 23:36:33,899 INFO L125 PetriNetUnfolderBase]: For 22856/22861 co-relation queries the response was YES. [2024-06-27 23:36:33,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55403 conditions, 19384 events. 14101/19384 cut-off events. For 22856/22861 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 104233 event pairs, 7568 based on Foata normal form. 11/19392 useless extension candidates. Maximal degree in co-relation 55385. Up to 18853 conditions per place. [2024-06-27 23:36:33,980 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 83 selfloop transitions, 27 changer transitions 0/115 dead transitions. [2024-06-27 23:36:33,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 115 transitions, 712 flow [2024-06-27 23:36:33,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:36:33,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:36:33,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 192 transitions. [2024-06-27 23:36:33,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5274725274725275 [2024-06-27 23:36:33,982 INFO L175 Difference]: Start difference. First operand has 62 places, 64 transitions, 310 flow. Second operand 7 states and 192 transitions. [2024-06-27 23:36:33,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 115 transitions, 712 flow [2024-06-27 23:36:33,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 115 transitions, 700 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-27 23:36:33,992 INFO L231 Difference]: Finished difference. Result has 69 places, 69 transitions, 406 flow [2024-06-27 23:36:33,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=406, PETRI_PLACES=69, PETRI_TRANSITIONS=69} [2024-06-27 23:36:33,993 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 14 predicate places. [2024-06-27 23:36:33,993 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 406 flow [2024-06-27 23:36:33,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:36:33,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:36:33,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:36:33,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 23:36:33,994 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:36:33,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:36:33,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1087790340, now seen corresponding path program 1 times [2024-06-27 23:36:33,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:36:33,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568940237] [2024-06-27 23:36:33,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:36:33,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:36:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:36:35,360 INFO 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:36:35,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:36:35,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568940237] [2024-06-27 23:36:35,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568940237] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:36:35,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:36:35,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:36:35,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319479385] [2024-06-27 23:36:35,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:36:35,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:36:35,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:36:35,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:36:35,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:36:35,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 52 [2024-06-27 23:36:35,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 406 flow. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:36:35,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:36:35,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 52 [2024-06-27 23:36:35,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:36:37,705 INFO L124 PetriNetUnfolderBase]: 14130/19411 cut-off events. [2024-06-27 23:36:37,706 INFO L125 PetriNetUnfolderBase]: For 36191/36196 co-relation queries the response was YES. [2024-06-27 23:36:37,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61052 conditions, 19411 events. 14130/19411 cut-off events. For 36191/36196 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 104274 event pairs, 6467 based on Foata normal form. 18/19426 useless extension candidates. Maximal degree in co-relation 61031. Up to 18818 conditions per place. [2024-06-27 23:36:37,781 INFO L140 encePairwiseOnDemand]: 39/52 looper letters, 90 selfloop transitions, 30 changer transitions 0/126 dead transitions. [2024-06-27 23:36:37,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 126 transitions, 856 flow [2024-06-27 23:36:37,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:36:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:36:37,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 209 transitions. [2024-06-27 23:36:37,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5741758241758241 [2024-06-27 23:36:37,783 INFO L175 Difference]: Start difference. First operand has 69 places, 69 transitions, 406 flow. Second operand 7 states and 209 transitions. [2024-06-27 23:36:37,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 126 transitions, 856 flow [2024-06-27 23:36:37,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 126 transitions, 788 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-27 23:36:37,791 INFO L231 Difference]: Finished difference. Result has 70 places, 72 transitions, 443 flow [2024-06-27 23:36:37,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=443, PETRI_PLACES=70, PETRI_TRANSITIONS=72} [2024-06-27 23:36:37,792 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 15 predicate places. [2024-06-27 23:36:37,792 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 72 transitions, 443 flow [2024-06-27 23:36:37,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:36:37,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:36:37,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:36:37,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 23:36:37,793 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:36:37,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:36:37,794 INFO L85 PathProgramCache]: Analyzing trace with hash 481159843, now seen corresponding path program 1 times [2024-06-27 23:36:37,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:36:37,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639514375] [2024-06-27 23:36:37,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:36:37,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:36:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:36:39,225 INFO 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:36:39,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:36:39,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639514375] [2024-06-27 23:36:39,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639514375] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:36:39,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:36:39,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:36:39,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132723020] [2024-06-27 23:36:39,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:36:39,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:36:39,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:36:39,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:36:39,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:36:39,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-27 23:36:39,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 72 transitions, 443 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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:36:39,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:36:39,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-27 23:36:39,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:36:41,447 INFO L124 PetriNetUnfolderBase]: 14121/19386 cut-off events. [2024-06-27 23:36:41,448 INFO L125 PetriNetUnfolderBase]: For 51077/51077 co-relation queries the response was YES. [2024-06-27 23:36:41,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65458 conditions, 19386 events. 14121/19386 cut-off events. For 51077/51077 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 104015 event pairs, 7483 based on Foata normal form. 3/19387 useless extension candidates. Maximal degree in co-relation 65436. Up to 19033 conditions per place. [2024-06-27 23:36:41,552 INFO L140 encePairwiseOnDemand]: 41/52 looper letters, 73 selfloop transitions, 12 changer transitions 0/90 dead transitions. [2024-06-27 23:36:41,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 90 transitions, 669 flow [2024-06-27 23:36:41,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:36:41,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:36:41,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2024-06-27 23:36:41,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2024-06-27 23:36:41,560 INFO L175 Difference]: Start difference. First operand has 70 places, 72 transitions, 443 flow. Second operand 5 states and 120 transitions. [2024-06-27 23:36:41,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 90 transitions, 669 flow [2024-06-27 23:36:41,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 90 transitions, 580 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-27 23:36:41,573 INFO L231 Difference]: Finished difference. Result has 71 places, 74 transitions, 410 flow [2024-06-27 23:36:41,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=410, PETRI_PLACES=71, PETRI_TRANSITIONS=74} [2024-06-27 23:36:41,576 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 16 predicate places. [2024-06-27 23:36:41,576 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 74 transitions, 410 flow [2024-06-27 23:36:41,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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:36:41,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:36:41,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:36:41,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 23:36:41,577 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:36:41,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:36:41,577 INFO L85 PathProgramCache]: Analyzing trace with hash 2030766025, now seen corresponding path program 1 times [2024-06-27 23:36:41,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:36:41,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622306140] [2024-06-27 23:36:41,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:36:41,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:36:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:36:43,370 INFO 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:36:43,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:36:43,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622306140] [2024-06-27 23:36:43,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622306140] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:36:43,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:36:43,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:36:43,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853665863] [2024-06-27 23:36:43,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:36:43,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:36:43,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:36:43,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:36:43,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:36:43,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-27 23:36:43,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 74 transitions, 410 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:36:43,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:36:43,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-27 23:36:43,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:36:45,856 INFO L124 PetriNetUnfolderBase]: 14145/19512 cut-off events. [2024-06-27 23:36:45,856 INFO L125 PetriNetUnfolderBase]: For 58240/58240 co-relation queries the response was YES. [2024-06-27 23:36:45,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66672 conditions, 19512 events. 14145/19512 cut-off events. For 58240/58240 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 105137 event pairs, 7102 based on Foata normal form. 10/19514 useless extension candidates. Maximal degree in co-relation 66646. Up to 18955 conditions per place. [2024-06-27 23:36:45,959 INFO L140 encePairwiseOnDemand]: 39/52 looper letters, 88 selfloop transitions, 24 changer transitions 0/117 dead transitions. [2024-06-27 23:36:45,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 117 transitions, 850 flow [2024-06-27 23:36:45,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:36:45,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:36:45,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2024-06-27 23:36:45,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2024-06-27 23:36:45,960 INFO L175 Difference]: Start difference. First operand has 71 places, 74 transitions, 410 flow. Second operand 6 states and 152 transitions. [2024-06-27 23:36:45,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 117 transitions, 850 flow [2024-06-27 23:36:45,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 117 transitions, 835 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 23:36:45,975 INFO L231 Difference]: Finished difference. Result has 77 places, 88 transitions, 587 flow [2024-06-27 23:36:45,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=587, PETRI_PLACES=77, PETRI_TRANSITIONS=88} [2024-06-27 23:36:45,975 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 22 predicate places. [2024-06-27 23:36:45,975 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 88 transitions, 587 flow [2024-06-27 23:36:45,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:36:45,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:36:45,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:36:45,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 23:36:45,976 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:36:45,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:36:45,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1493902170, now seen corresponding path program 1 times [2024-06-27 23:36:45,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:36:45,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208704171] [2024-06-27 23:36:45,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:36:45,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:36:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:36:47,346 INFO 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:36:47,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:36:47,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208704171] [2024-06-27 23:36:47,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208704171] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:36:47,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:36:47,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:36:47,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138977703] [2024-06-27 23:36:47,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:36:47,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:36:47,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:36:47,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:36:47,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:36:47,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-27 23:36:47,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 88 transitions, 587 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:36:47,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:36:47,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-27 23:36:47,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:36:49,857 INFO L124 PetriNetUnfolderBase]: 14294/19706 cut-off events. [2024-06-27 23:36:49,858 INFO L125 PetriNetUnfolderBase]: For 83158/83168 co-relation queries the response was YES. [2024-06-27 23:36:49,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74572 conditions, 19706 events. 14294/19706 cut-off events. For 83158/83168 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 105713 event pairs, 7290 based on Foata normal form. 14/19708 useless extension candidates. Maximal degree in co-relation 74541. Up to 19162 conditions per place. [2024-06-27 23:36:49,969 INFO L140 encePairwiseOnDemand]: 39/52 looper letters, 101 selfloop transitions, 27 changer transitions 0/133 dead transitions. [2024-06-27 23:36:49,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 133 transitions, 1076 flow [2024-06-27 23:36:49,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:36:49,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:36:49,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2024-06-27 23:36:49,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4807692307692308 [2024-06-27 23:36:49,970 INFO L175 Difference]: Start difference. First operand has 77 places, 88 transitions, 587 flow. Second operand 6 states and 150 transitions. [2024-06-27 23:36:49,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 133 transitions, 1076 flow [2024-06-27 23:36:50,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 133 transitions, 1059 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-06-27 23:36:50,014 INFO L231 Difference]: Finished difference. Result has 83 places, 104 transitions, 782 flow [2024-06-27 23:36:50,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=782, PETRI_PLACES=83, PETRI_TRANSITIONS=104} [2024-06-27 23:36:50,015 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 28 predicate places. [2024-06-27 23:36:50,015 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 104 transitions, 782 flow [2024-06-27 23:36:50,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:36:50,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:36:50,015 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:36:50,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 23:36:50,016 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:36:50,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:36:50,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1461832190, now seen corresponding path program 2 times [2024-06-27 23:36:50,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:36:50,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91653113] [2024-06-27 23:36:50,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:36:50,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:36:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:36:51,180 INFO 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:36:51,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:36:51,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91653113] [2024-06-27 23:36:51,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91653113] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:36:51,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:36:51,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:36:51,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482921589] [2024-06-27 23:36:51,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:36:51,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:36:51,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:36:51,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:36:51,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:36:51,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-27 23:36:51,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 104 transitions, 782 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:36:51,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:36:51,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-27 23:36:51,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:36:53,641 INFO L124 PetriNetUnfolderBase]: 14279/19702 cut-off events. [2024-06-27 23:36:53,641 INFO L125 PetriNetUnfolderBase]: For 91927/91927 co-relation queries the response was YES. [2024-06-27 23:36:53,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75632 conditions, 19702 events. 14279/19702 cut-off events. For 91927/91927 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 106107 event pairs, 7283 based on Foata normal form. 3/19694 useless extension candidates. Maximal degree in co-relation 75597. Up to 19234 conditions per place. [2024-06-27 23:36:53,731 INFO L140 encePairwiseOnDemand]: 40/52 looper letters, 107 selfloop transitions, 16 changer transitions 0/128 dead transitions. [2024-06-27 23:36:53,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 128 transitions, 1098 flow [2024-06-27 23:36:53,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:36:53,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:36:53,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2024-06-27 23:36:53,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4551282051282051 [2024-06-27 23:36:53,734 INFO L175 Difference]: Start difference. First operand has 83 places, 104 transitions, 782 flow. Second operand 6 states and 142 transitions. [2024-06-27 23:36:53,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 128 transitions, 1098 flow [2024-06-27 23:36:53,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 128 transitions, 1071 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-27 23:36:53,777 INFO L231 Difference]: Finished difference. Result has 87 places, 105 transitions, 810 flow [2024-06-27 23:36:53,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=810, PETRI_PLACES=87, PETRI_TRANSITIONS=105} [2024-06-27 23:36:53,778 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 32 predicate places. [2024-06-27 23:36:53,778 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 105 transitions, 810 flow [2024-06-27 23:36:53,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:36:53,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:36:53,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:36:53,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 23:36:53,779 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:36:53,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:36:53,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1023706660, now seen corresponding path program 3 times [2024-06-27 23:36:53,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:36:53,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136541195] [2024-06-27 23:36:53,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:36:53,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:36:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:36:55,296 INFO 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:36:55,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:36:55,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136541195] [2024-06-27 23:36:55,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136541195] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:36:55,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:36:55,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:36:55,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699269485] [2024-06-27 23:36:55,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:36:55,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:36:55,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:36:55,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:36:55,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:36:55,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-27 23:36:55,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 105 transitions, 810 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:36:55,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:36:55,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-27 23:36:55,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:36:57,848 INFO L124 PetriNetUnfolderBase]: 14384/19848 cut-off events. [2024-06-27 23:36:57,848 INFO L125 PetriNetUnfolderBase]: For 105527/105537 co-relation queries the response was YES. [2024-06-27 23:36:57,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78011 conditions, 19848 events. 14384/19848 cut-off events. For 105527/105537 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 106743 event pairs, 7267 based on Foata normal form. 14/19850 useless extension candidates. Maximal degree in co-relation 77974. Up to 19128 conditions per place. [2024-06-27 23:36:57,969 INFO L140 encePairwiseOnDemand]: 37/52 looper letters, 98 selfloop transitions, 60 changer transitions 0/163 dead transitions. [2024-06-27 23:36:57,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 163 transitions, 1441 flow [2024-06-27 23:36:57,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:36:57,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:36:57,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2024-06-27 23:36:57,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47527472527472525 [2024-06-27 23:36:57,971 INFO L175 Difference]: Start difference. First operand has 87 places, 105 transitions, 810 flow. Second operand 7 states and 173 transitions. [2024-06-27 23:36:57,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 163 transitions, 1441 flow [2024-06-27 23:36:58,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 163 transitions, 1390 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-27 23:36:58,038 INFO L231 Difference]: Finished difference. Result has 92 places, 129 transitions, 1164 flow [2024-06-27 23:36:58,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1164, PETRI_PLACES=92, PETRI_TRANSITIONS=129} [2024-06-27 23:36:58,039 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 37 predicate places. [2024-06-27 23:36:58,039 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 129 transitions, 1164 flow [2024-06-27 23:36:58,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:36:58,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:36:58,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:36:58,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 23:36:58,040 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:36:58,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:36:58,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1961247848, now seen corresponding path program 1 times [2024-06-27 23:36:58,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:36:58,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123844506] [2024-06-27 23:36:58,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:36:58,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:36:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:36:59,431 INFO 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:36:59,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:36:59,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123844506] [2024-06-27 23:36:59,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123844506] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:36:59,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:36:59,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:36:59,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397549616] [2024-06-27 23:36:59,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:36:59,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:36:59,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:36:59,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:36:59,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:36:59,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-27 23:36:59,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 129 transitions, 1164 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:36:59,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:36:59,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-27 23:36:59,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:37:02,089 INFO L124 PetriNetUnfolderBase]: 15002/20644 cut-off events. [2024-06-27 23:37:02,089 INFO L125 PetriNetUnfolderBase]: For 126868/126870 co-relation queries the response was YES. [2024-06-27 23:37:02,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84002 conditions, 20644 events. 15002/20644 cut-off events. For 126868/126870 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 110433 event pairs, 6426 based on Foata normal form. 22/20641 useless extension candidates. Maximal degree in co-relation 83962. Up to 19347 conditions per place. [2024-06-27 23:37:02,234 INFO L140 encePairwiseOnDemand]: 36/52 looper letters, 137 selfloop transitions, 58 changer transitions 0/200 dead transitions. [2024-06-27 23:37:02,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 200 transitions, 2050 flow [2024-06-27 23:37:02,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:37:02,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:37:02,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 187 transitions. [2024-06-27 23:37:02,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5137362637362637 [2024-06-27 23:37:02,236 INFO L175 Difference]: Start difference. First operand has 92 places, 129 transitions, 1164 flow. Second operand 7 states and 187 transitions. [2024-06-27 23:37:02,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 200 transitions, 2050 flow [2024-06-27 23:37:02,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 200 transitions, 1942 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-27 23:37:02,345 INFO L231 Difference]: Finished difference. Result has 98 places, 153 transitions, 1469 flow [2024-06-27 23:37:02,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1469, PETRI_PLACES=98, PETRI_TRANSITIONS=153} [2024-06-27 23:37:02,345 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 43 predicate places. [2024-06-27 23:37:02,346 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 153 transitions, 1469 flow [2024-06-27 23:37:02,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:37:02,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:37:02,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:37:02,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 23:37:02,346 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:37:02,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:37:02,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1928080596, now seen corresponding path program 2 times [2024-06-27 23:37:02,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:37:02,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300053223] [2024-06-27 23:37:02,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:37:02,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:37:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:37:03,519 INFO 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:37:03,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:37:03,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300053223] [2024-06-27 23:37:03,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300053223] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:37:03,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:37:03,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:37:03,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644925574] [2024-06-27 23:37:03,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:37:03,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:37:03,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:37:03,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:37:03,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:37:03,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-27 23:37:03,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 153 transitions, 1469 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:37:03,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:37:03,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-27 23:37:03,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:37:06,342 INFO L124 PetriNetUnfolderBase]: 15088/20757 cut-off events. [2024-06-27 23:37:06,342 INFO L125 PetriNetUnfolderBase]: For 167282/167284 co-relation queries the response was YES. [2024-06-27 23:37:06,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95165 conditions, 20757 events. 15088/20757 cut-off events. For 167282/167284 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 111120 event pairs, 6790 based on Foata normal form. 12/20742 useless extension candidates. Maximal degree in co-relation 95120. Up to 20202 conditions per place. [2024-06-27 23:37:06,460 INFO L140 encePairwiseOnDemand]: 37/52 looper letters, 161 selfloop transitions, 29 changer transitions 0/195 dead transitions. [2024-06-27 23:37:06,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 195 transitions, 2115 flow [2024-06-27 23:37:06,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:37:06,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:37:06,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2024-06-27 23:37:06,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47802197802197804 [2024-06-27 23:37:06,463 INFO L175 Difference]: Start difference. First operand has 98 places, 153 transitions, 1469 flow. Second operand 7 states and 174 transitions. [2024-06-27 23:37:06,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 195 transitions, 2115 flow [2024-06-27 23:37:06,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 195 transitions, 2056 flow, removed 28 selfloop flow, removed 1 redundant places. [2024-06-27 23:37:06,581 INFO L231 Difference]: Finished difference. Result has 105 places, 160 transitions, 1571 flow [2024-06-27 23:37:06,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1416, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1571, PETRI_PLACES=105, PETRI_TRANSITIONS=160} [2024-06-27 23:37:06,582 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 50 predicate places. [2024-06-27 23:37:06,582 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 160 transitions, 1571 flow [2024-06-27 23:37:06,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:37:06,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:37:06,582 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:37:06,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 23:37:06,583 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:37:06,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:37:06,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1650787146, now seen corresponding path program 3 times [2024-06-27 23:37:06,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:37:06,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131552011] [2024-06-27 23:37:06,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:37:06,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:37:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:37:07,801 INFO 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:37:07,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:37:07,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131552011] [2024-06-27 23:37:07,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131552011] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:37:07,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:37:07,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:37:07,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220764137] [2024-06-27 23:37:07,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:37:07,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:37:07,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:37:07,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:37:07,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:37:07,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-27 23:37:07,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 160 transitions, 1571 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:37:07,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:37:07,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-27 23:37:07,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:37:10,587 INFO L124 PetriNetUnfolderBase]: 15112/20789 cut-off events. [2024-06-27 23:37:10,587 INFO L125 PetriNetUnfolderBase]: For 192233/192235 co-relation queries the response was YES. [2024-06-27 23:37:10,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98247 conditions, 20789 events. 15112/20789 cut-off events. For 192233/192235 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 111264 event pairs, 6785 based on Foata normal form. 12/20774 useless extension candidates. Maximal degree in co-relation 98198. Up to 20087 conditions per place. [2024-06-27 23:37:10,755 INFO L140 encePairwiseOnDemand]: 37/52 looper letters, 165 selfloop transitions, 40 changer transitions 0/210 dead transitions. [2024-06-27 23:37:10,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 210 transitions, 2367 flow [2024-06-27 23:37:10,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:37:10,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:37:10,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2024-06-27 23:37:10,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.489010989010989 [2024-06-27 23:37:10,757 INFO L175 Difference]: Start difference. First operand has 105 places, 160 transitions, 1571 flow. Second operand 7 states and 178 transitions. [2024-06-27 23:37:10,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 210 transitions, 2367 flow [2024-06-27 23:37:10,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 210 transitions, 2271 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-06-27 23:37:10,915 INFO L231 Difference]: Finished difference. Result has 109 places, 170 transitions, 1715 flow [2024-06-27 23:37:10,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1475, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1715, PETRI_PLACES=109, PETRI_TRANSITIONS=170} [2024-06-27 23:37:10,916 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 54 predicate places. [2024-06-27 23:37:10,916 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 170 transitions, 1715 flow [2024-06-27 23:37:10,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:37:10,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:37:10,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:37:10,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 23:37:10,917 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:37:10,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:37:10,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1670136468, now seen corresponding path program 4 times [2024-06-27 23:37:10,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:37:10,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36409327] [2024-06-27 23:37:10,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:37:10,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:37:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:37:12,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:37:12,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:37:12,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36409327] [2024-06-27 23:37:12,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36409327] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:37:12,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:37:12,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:37:12,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990450484] [2024-06-27 23:37:12,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:37:12,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:37:12,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:37:12,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:37:12,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:37:12,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-27 23:37:12,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 170 transitions, 1715 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:37:12,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:37:12,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-27 23:37:12,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:37:16,157 INFO L124 PetriNetUnfolderBase]: 15783/21706 cut-off events. [2024-06-27 23:37:16,157 INFO L125 PetriNetUnfolderBase]: For 231438/231445 co-relation queries the response was YES. [2024-06-27 23:37:16,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107103 conditions, 21706 events. 15783/21706 cut-off events. For 231438/231445 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 116368 event pairs, 6433 based on Foata normal form. 16/21718 useless extension candidates. Maximal degree in co-relation 107053. Up to 19927 conditions per place. [2024-06-27 23:37:16,303 INFO L140 encePairwiseOnDemand]: 35/52 looper letters, 191 selfloop transitions, 110 changer transitions 0/306 dead transitions. [2024-06-27 23:37:16,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 306 transitions, 3633 flow [2024-06-27 23:37:16,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:37:16,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:37:16,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 215 transitions. [2024-06-27 23:37:16,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5168269230769231 [2024-06-27 23:37:16,305 INFO L175 Difference]: Start difference. First operand has 109 places, 170 transitions, 1715 flow. Second operand 8 states and 215 transitions. [2024-06-27 23:37:16,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 306 transitions, 3633 flow [2024-06-27 23:37:16,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 306 transitions, 3472 flow, removed 68 selfloop flow, removed 3 redundant places. [2024-06-27 23:37:16,470 INFO L231 Difference]: Finished difference. Result has 117 places, 231 transitions, 2615 flow [2024-06-27 23:37:16,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1642, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2615, PETRI_PLACES=117, PETRI_TRANSITIONS=231} [2024-06-27 23:37:16,470 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 62 predicate places. [2024-06-27 23:37:16,470 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 231 transitions, 2615 flow [2024-06-27 23:37:16,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:37:16,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:37:16,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:37:16,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 23:37:16,471 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:37:16,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:37:16,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1928089524, now seen corresponding path program 1 times [2024-06-27 23:37:16,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:37:16,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741140491] [2024-06-27 23:37:16,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:37:16,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:37:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:37:18,766 INFO 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:37:18,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:37:18,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741140491] [2024-06-27 23:37:18,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741140491] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:37:18,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:37:18,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:37:18,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477252892] [2024-06-27 23:37:18,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:37:18,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:37:18,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:37:18,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:37:18,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:37:18,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-27 23:37:18,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 231 transitions, 2615 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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:37:18,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:37:18,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-27 23:37:18,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:37:22,354 INFO L124 PetriNetUnfolderBase]: 15803/21733 cut-off events. [2024-06-27 23:37:22,355 INFO L125 PetriNetUnfolderBase]: For 288956/288958 co-relation queries the response was YES. [2024-06-27 23:37:22,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118157 conditions, 21733 events. 15803/21733 cut-off events. For 288956/288958 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 116580 event pairs, 6480 based on Foata normal form. 12/21743 useless extension candidates. Maximal degree in co-relation 118102. Up to 21102 conditions per place. [2024-06-27 23:37:22,575 INFO L140 encePairwiseOnDemand]: 39/52 looper letters, 230 selfloop transitions, 35 changer transitions 0/270 dead transitions. [2024-06-27 23:37:22,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 270 transitions, 3431 flow [2024-06-27 23:37:22,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:37:22,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:37:22,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2024-06-27 23:37:22,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44711538461538464 [2024-06-27 23:37:22,576 INFO L175 Difference]: Start difference. First operand has 117 places, 231 transitions, 2615 flow. Second operand 8 states and 186 transitions. [2024-06-27 23:37:22,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 270 transitions, 3431 flow [2024-06-27 23:37:22,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 270 transitions, 3346 flow, removed 33 selfloop flow, removed 2 redundant places. [2024-06-27 23:37:23,152 INFO L231 Difference]: Finished difference. Result has 123 places, 235 transitions, 2673 flow [2024-06-27 23:37:23,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2530, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2673, PETRI_PLACES=123, PETRI_TRANSITIONS=235} [2024-06-27 23:37:23,153 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 68 predicate places. [2024-06-27 23:37:23,153 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 235 transitions, 2673 flow [2024-06-27 23:37:23,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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:37:23,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:37:23,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:37:23,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 23:37:23,153 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:37:23,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:37:23,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1990353068, now seen corresponding path program 1 times [2024-06-27 23:37:23,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:37:23,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175483876] [2024-06-27 23:37:23,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:37:23,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:37:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:37:24,659 INFO 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:37:24,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:37:24,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175483876] [2024-06-27 23:37:24,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175483876] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:37:24,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:37:24,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:37:24,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021529490] [2024-06-27 23:37:24,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:37:24,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:37:24,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:37:24,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:37:24,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:37:24,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-27 23:37:24,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 235 transitions, 2673 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:37:24,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:37:24,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-27 23:37:24,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:37:27,912 INFO L124 PetriNetUnfolderBase]: 15796/21721 cut-off events. [2024-06-27 23:37:27,913 INFO L125 PetriNetUnfolderBase]: For 317026/317026 co-relation queries the response was YES. [2024-06-27 23:37:28,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122020 conditions, 21721 events. 15796/21721 cut-off events. For 317026/317026 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 116553 event pairs, 6640 based on Foata normal form. 2/21721 useless extension candidates. Maximal degree in co-relation 121963. Up to 21261 conditions per place. [2024-06-27 23:37:28,124 INFO L140 encePairwiseOnDemand]: 42/52 looper letters, 231 selfloop transitions, 12 changer transitions 0/248 dead transitions. [2024-06-27 23:37:28,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 248 transitions, 3205 flow [2024-06-27 23:37:28,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:37:28,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:37:28,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2024-06-27 23:37:28,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4461538461538462 [2024-06-27 23:37:28,125 INFO L175 Difference]: Start difference. First operand has 123 places, 235 transitions, 2673 flow. Second operand 5 states and 116 transitions. [2024-06-27 23:37:28,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 248 transitions, 3205 flow [2024-06-27 23:37:28,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 248 transitions, 3066 flow, removed 36 selfloop flow, removed 6 redundant places. [2024-06-27 23:37:28,424 INFO L231 Difference]: Finished difference. Result has 122 places, 235 transitions, 2567 flow [2024-06-27 23:37:28,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2534, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2567, PETRI_PLACES=122, PETRI_TRANSITIONS=235} [2024-06-27 23:37:28,425 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 67 predicate places. [2024-06-27 23:37:28,425 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 235 transitions, 2567 flow [2024-06-27 23:37:28,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:37:28,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:37:28,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:37:28,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 23:37:28,426 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:37:28,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:37:28,426 INFO L85 PathProgramCache]: Analyzing trace with hash -672955265, now seen corresponding path program 1 times [2024-06-27 23:37:28,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:37:28,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634402309] [2024-06-27 23:37:28,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:37:28,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:37:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:37:30,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:37:30,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:37:30,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634402309] [2024-06-27 23:37:30,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634402309] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:37:30,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:37:30,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:37:30,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413918930] [2024-06-27 23:37:30,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:37:30,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:37:30,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:37:30,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:37:30,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:37:30,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-27 23:37:30,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 235 transitions, 2567 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:37:30,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:37:30,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-27 23:37:30,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:37:34,173 INFO L124 PetriNetUnfolderBase]: 15894/21887 cut-off events. [2024-06-27 23:37:34,174 INFO L125 PetriNetUnfolderBase]: For 339861/339886 co-relation queries the response was YES. [2024-06-27 23:37:34,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123795 conditions, 21887 events. 15894/21887 cut-off events. For 339861/339886 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 117431 event pairs, 6452 based on Foata normal form. 25/21909 useless extension candidates. Maximal degree in co-relation 123738. Up to 21122 conditions per place. [2024-06-27 23:37:34,331 INFO L140 encePairwiseOnDemand]: 39/52 looper letters, 224 selfloop transitions, 54 changer transitions 0/283 dead transitions. [2024-06-27 23:37:34,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 283 transitions, 3492 flow [2024-06-27 23:37:34,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:37:34,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:37:34,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2024-06-27 23:37:34,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47527472527472525 [2024-06-27 23:37:34,333 INFO L175 Difference]: Start difference. First operand has 122 places, 235 transitions, 2567 flow. Second operand 7 states and 173 transitions. [2024-06-27 23:37:34,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 283 transitions, 3492 flow [2024-06-27 23:37:34,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 283 transitions, 3455 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-27 23:37:34,562 INFO L231 Difference]: Finished difference. Result has 126 places, 248 transitions, 2831 flow [2024-06-27 23:37:34,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2530, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2831, PETRI_PLACES=126, PETRI_TRANSITIONS=248} [2024-06-27 23:37:34,563 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 71 predicate places. [2024-06-27 23:37:34,563 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 248 transitions, 2831 flow [2024-06-27 23:37:34,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:37:34,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:37:34,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:37:34,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 23:37:34,564 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:37:34,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:37:34,564 INFO L85 PathProgramCache]: Analyzing trace with hash -672865055, now seen corresponding path program 2 times [2024-06-27 23:37:34,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:37:34,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467003798] [2024-06-27 23:37:34,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:37:34,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:37:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:37:36,359 INFO 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:37:36,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:37:36,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467003798] [2024-06-27 23:37:36,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467003798] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:37:36,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:37:36,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:37:36,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44167451] [2024-06-27 23:37:36,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:37:36,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:37:36,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:37:36,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:37:36,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:37:36,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-27 23:37:36,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 248 transitions, 2831 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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:37:36,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:37:36,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-27 23:37:36,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:37:40,063 INFO L124 PetriNetUnfolderBase]: 15885/21877 cut-off events. [2024-06-27 23:37:40,063 INFO L125 PetriNetUnfolderBase]: For 382294/382307 co-relation queries the response was YES. [2024-06-27 23:37:40,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128554 conditions, 21877 events. 15885/21877 cut-off events. For 382294/382307 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 117374 event pairs, 6448 based on Foata normal form. 13/21887 useless extension candidates. Maximal degree in co-relation 128495. Up to 21172 conditions per place. [2024-06-27 23:37:40,233 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 224 selfloop transitions, 51 changer transitions 0/280 dead transitions. [2024-06-27 23:37:40,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 280 transitions, 3510 flow [2024-06-27 23:37:40,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:37:40,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:37:40,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 180 transitions. [2024-06-27 23:37:40,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4326923076923077 [2024-06-27 23:37:40,234 INFO L175 Difference]: Start difference. First operand has 126 places, 248 transitions, 2831 flow. Second operand 8 states and 180 transitions. [2024-06-27 23:37:40,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 280 transitions, 3510 flow [2024-06-27 23:37:40,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 280 transitions, 3361 flow, removed 52 selfloop flow, removed 3 redundant places. [2024-06-27 23:37:40,585 INFO L231 Difference]: Finished difference. Result has 131 places, 248 transitions, 2797 flow [2024-06-27 23:37:40,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2682, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2797, PETRI_PLACES=131, PETRI_TRANSITIONS=248} [2024-06-27 23:37:40,586 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 76 predicate places. [2024-06-27 23:37:40,586 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 248 transitions, 2797 flow [2024-06-27 23:37:40,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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:37:40,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:37:40,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:37:40,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 23:37:40,586 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:37:40,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:37:40,587 INFO L85 PathProgramCache]: Analyzing trace with hash -669140250, now seen corresponding path program 1 times [2024-06-27 23:37:40,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:37:40,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47621286] [2024-06-27 23:37:40,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:37:40,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:37:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:37:42,008 INFO 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:37:42,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:37:42,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47621286] [2024-06-27 23:37:42,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47621286] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:37:42,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:37:42,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:37:42,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20807201] [2024-06-27 23:37:42,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:37:42,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:37:42,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:37:42,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:37:42,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:37:42,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-27 23:37:42,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 248 transitions, 2797 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:37:42,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:37:42,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-27 23:37:42,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:37:45,747 INFO L124 PetriNetUnfolderBase]: 16069/22119 cut-off events. [2024-06-27 23:37:45,747 INFO L125 PetriNetUnfolderBase]: For 414007/414028 co-relation queries the response was YES. [2024-06-27 23:37:45,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132033 conditions, 22119 events. 16069/22119 cut-off events. For 414007/414028 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 118744 event pairs, 6451 based on Foata normal form. 29/22144 useless extension candidates. Maximal degree in co-relation 131972. Up to 20541 conditions per place. [2024-06-27 23:37:46,097 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 208 selfloop transitions, 108 changer transitions 0/321 dead transitions. [2024-06-27 23:37:46,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 321 transitions, 4252 flow [2024-06-27 23:37:46,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:37:46,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:37:46,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 183 transitions. [2024-06-27 23:37:46,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5027472527472527 [2024-06-27 23:37:46,102 INFO L175 Difference]: Start difference. First operand has 131 places, 248 transitions, 2797 flow. Second operand 7 states and 183 transitions. [2024-06-27 23:37:46,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 321 transitions, 4252 flow [2024-06-27 23:37:46,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 321 transitions, 4148 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-27 23:37:46,403 INFO L231 Difference]: Finished difference. Result has 134 places, 274 transitions, 3356 flow [2024-06-27 23:37:46,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=2693, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3356, PETRI_PLACES=134, PETRI_TRANSITIONS=274} [2024-06-27 23:37:46,404 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 79 predicate places. [2024-06-27 23:37:46,404 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 274 transitions, 3356 flow [2024-06-27 23:37:46,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:37:46,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:37:46,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:37:46,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 23:37:46,404 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:37:46,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:37:46,405 INFO L85 PathProgramCache]: Analyzing trace with hash -669145830, now seen corresponding path program 2 times [2024-06-27 23:37:46,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:37:46,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715447719] [2024-06-27 23:37:46,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:37:46,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:37:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:37:47,766 INFO 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:37:47,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:37:47,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715447719] [2024-06-27 23:37:47,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715447719] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:37:47,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:37:47,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:37:47,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819810273] [2024-06-27 23:37:47,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:37:47,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:37:47,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:37:47,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:37:47,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:37:47,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-27 23:37:47,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 274 transitions, 3356 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:37:47,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:37:47,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-27 23:37:47,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:37:51,560 INFO L124 PetriNetUnfolderBase]: 16049/22087 cut-off events. [2024-06-27 23:37:51,561 INFO L125 PetriNetUnfolderBase]: For 464963/464986 co-relation queries the response was YES. [2024-06-27 23:37:51,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137843 conditions, 22087 events. 16049/22087 cut-off events. For 464963/464986 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 118415 event pairs, 6468 based on Foata normal form. 31/22114 useless extension candidates. Maximal degree in co-relation 137780. Up to 20529 conditions per place. [2024-06-27 23:37:51,755 INFO L140 encePairwiseOnDemand]: 37/52 looper letters, 211 selfloop transitions, 117 changer transitions 0/333 dead transitions. [2024-06-27 23:37:51,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 333 transitions, 4683 flow [2024-06-27 23:37:51,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:37:51,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:37:51,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 184 transitions. [2024-06-27 23:37:51,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054945054945055 [2024-06-27 23:37:51,757 INFO L175 Difference]: Start difference. First operand has 134 places, 274 transitions, 3356 flow. Second operand 7 states and 184 transitions. [2024-06-27 23:37:51,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 333 transitions, 4683 flow [2024-06-27 23:37:52,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 333 transitions, 4546 flow, removed 58 selfloop flow, removed 2 redundant places. [2024-06-27 23:37:52,459 INFO L231 Difference]: Finished difference. Result has 141 places, 289 transitions, 3803 flow [2024-06-27 23:37:52,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=3219, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3803, PETRI_PLACES=141, PETRI_TRANSITIONS=289} [2024-06-27 23:37:52,460 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 86 predicate places. [2024-06-27 23:37:52,460 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 289 transitions, 3803 flow [2024-06-27 23:37:52,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:37:52,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:37:52,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:37:52,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 23:37:52,460 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:37:52,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:37:52,461 INFO L85 PathProgramCache]: Analyzing trace with hash -358775647, now seen corresponding path program 1 times [2024-06-27 23:37:52,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:37:52,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517425179] [2024-06-27 23:37:52,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:37:52,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:37:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:37:53,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:37:53,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:37:53,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517425179] [2024-06-27 23:37:53,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517425179] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:37:53,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:37:53,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 23:37:53,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674590559] [2024-06-27 23:37:53,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:37:53,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 23:37:53,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:37:53,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 23:37:53,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 23:37:54,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-27 23:37:54,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 289 transitions, 3803 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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:37:54,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:37:54,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-27 23:37:54,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:37:57,860 INFO L124 PetriNetUnfolderBase]: 16097/22150 cut-off events. [2024-06-27 23:37:57,861 INFO L125 PetriNetUnfolderBase]: For 505659/505661 co-relation queries the response was YES. [2024-06-27 23:37:57,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142903 conditions, 22150 events. 16097/22150 cut-off events. For 505659/505661 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 118523 event pairs, 6484 based on Foata normal form. 7/22155 useless extension candidates. Maximal degree in co-relation 142836. Up to 21497 conditions per place. [2024-06-27 23:37:58,052 INFO L140 encePairwiseOnDemand]: 37/52 looper letters, 291 selfloop transitions, 52 changer transitions 0/348 dead transitions. [2024-06-27 23:37:58,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 348 transitions, 4977 flow [2024-06-27 23:37:58,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:37:58,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:37:58,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 217 transitions. [2024-06-27 23:37:58,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4636752136752137 [2024-06-27 23:37:58,054 INFO L175 Difference]: Start difference. First operand has 141 places, 289 transitions, 3803 flow. Second operand 9 states and 217 transitions. [2024-06-27 23:37:58,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 348 transitions, 4977 flow [2024-06-27 23:37:58,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 348 transitions, 4836 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-27 23:37:58,532 INFO L231 Difference]: Finished difference. Result has 148 places, 303 transitions, 4053 flow [2024-06-27 23:37:58,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=3664, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4053, PETRI_PLACES=148, PETRI_TRANSITIONS=303} [2024-06-27 23:37:58,532 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 93 predicate places. [2024-06-27 23:37:58,533 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 303 transitions, 4053 flow [2024-06-27 23:37:58,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states 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:37:58,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:37:58,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:37:58,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 23:37:58,533 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:37:58,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:37:58,534 INFO L85 PathProgramCache]: Analyzing trace with hash 534321224, now seen corresponding path program 3 times [2024-06-27 23:37:58,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:37:58,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440384600] [2024-06-27 23:37:58,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:37:58,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:37:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:37:59,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:37:59,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:37:59,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440384600] [2024-06-27 23:37:59,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440384600] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:37:59,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:37:59,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:37:59,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092100184] [2024-06-27 23:37:59,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:37:59,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:37:59,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:37:59,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:37:59,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:38:00,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 52 [2024-06-27 23:38:00,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 303 transitions, 4053 flow. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:38:00,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:38:00,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 52 [2024-06-27 23:38:00,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand