./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix047_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/mix047_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/mix047_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix047_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:53:26,281 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 23:53:26,340 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 23:53:26,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 23:53:26,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 23:53:26,369 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 23:53:26,370 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 23:53:26,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 23:53:26,370 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 23:53:26,371 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 23:53:26,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 23:53:26,371 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 23:53:26,371 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 23:53:26,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 23:53:26,372 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 23:53:26,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 23:53:26,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 23:53:26,373 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 23:53:26,373 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 23:53:26,373 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 23:53:26,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 23:53:26,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 23:53:26,378 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 23:53:26,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 23:53:26,379 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 23:53:26,379 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 23:53:26,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 23:53:26,380 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 23:53:26,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 23:53:26,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 23:53:26,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 23:53:26,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 23:53:26,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:53:26,381 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 23:53:26,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 23:53:26,382 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 23:53:26,382 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 23:53:26,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 23:53:26,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 23:53:26,383 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 23:53:26,383 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 23:53:26,383 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 23:53:26,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 23:53:26,384 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:53:26,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 23:53:26,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 23:53:26,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 23:53:26,616 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 23:53:26,616 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 23:53:26,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 23:53:27,762 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 23:53:27,999 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 23:53:28,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 23:53:28,011 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93e0e31d8/3e9ce937aeaf464f8655bc2e28852322/FLAG4d0e7dbae [2024-06-27 23:53:28,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93e0e31d8/3e9ce937aeaf464f8655bc2e28852322 [2024-06-27 23:53:28,023 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 23:53:28,026 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 23:53:28,026 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/mix047_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-27 23:53:28,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 23:53:28,094 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 23:53:28,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 23:53:28,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 23:53:28,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 23:53:28,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:53:28" (1/2) ... [2024-06-27 23:53:28,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a43e94f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:53:28, skipping insertion in model container [2024-06-27 23:53:28,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:53:28" (1/2) ... [2024-06-27 23:53:28,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4e8cbd47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:53:28, skipping insertion in model container [2024-06-27 23:53:28,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:53:28" (2/2) ... [2024-06-27 23:53:28,101 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a43e94f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:53:28, skipping insertion in model container [2024-06-27 23:53:28,101 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:53:28" (2/2) ... [2024-06-27 23:53:28,101 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 23:53:28,127 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 23:53:28,128 INFO L97 edCorrectnessWitness]: Location invariant before [L875-L875] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b$mem_tmp >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0_used >= 0LL) && (long long )a + (long long )b$r_buff0_thd1 >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff0_used >= 0LL) && (long long )b + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff0_used >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )x >= 0LL) && (long long )b$r_buff0_thd1 + (long long )y >= 0LL) && (long long )b$r_buff0_thd1 + (long long )z >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0_used + (long long )x >= 0LL) && (long long )b$w_buff0_used + (long long )y >= 0LL) && (long long )b$w_buff0_used + (long long )z >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )b$w_buff0_used) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )b$mem_tmp >= 0LL) && (long long )b - (long long )b$mem_tmp >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff1 - (long long )b$w_buff1_used >= 0LL) [2024-06-27 23:53:28,129 INFO L97 edCorrectnessWitness]: Location invariant before [L870-L870] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b$mem_tmp >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0_used >= 0LL) && (long long )a + (long long )b$r_buff0_thd1 >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff0_used >= 0LL) && (long long )b + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff0_used >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )x >= 0LL) && (long long )b$r_buff0_thd1 + (long long )y >= 0LL) && (long long )b$r_buff0_thd1 + (long long )z >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0_used + (long long )x >= 0LL) && (long long )b$w_buff0_used + (long long )y >= 0LL) && (long long )b$w_buff0_used + (long long )z >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )b$w_buff0_used) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )b$mem_tmp >= 0LL) && (long long )b - (long long )b$mem_tmp >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff1 - (long long )b$w_buff1_used >= 0LL) [2024-06-27 23:53:28,129 INFO L97 edCorrectnessWitness]: Location invariant before [L874-L874] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b$mem_tmp >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0_used >= 0LL) && (long long )a + (long long )b$r_buff0_thd1 >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff0_used >= 0LL) && (long long )b + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff0_used >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )x >= 0LL) && (long long )b$r_buff0_thd1 + (long long )y >= 0LL) && (long long )b$r_buff0_thd1 + (long long )z >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0_used + (long long )x >= 0LL) && (long long )b$w_buff0_used + (long long )y >= 0LL) && (long long )b$w_buff0_used + (long long )z >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )b$w_buff0_used) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )b$mem_tmp >= 0LL) && (long long )b - (long long )b$mem_tmp >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff1 - (long long )b$w_buff1_used >= 0LL) [2024-06-27 23:53:28,129 INFO L97 edCorrectnessWitness]: Location invariant before [L872-L872] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b$mem_tmp >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0_used >= 0LL) && (long long )a + (long long )b$r_buff0_thd1 >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff0_used >= 0LL) && (long long )b + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff0_used >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )x >= 0LL) && (long long )b$r_buff0_thd1 + (long long )y >= 0LL) && (long long )b$r_buff0_thd1 + (long long )z >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0_used + (long long )x >= 0LL) && (long long )b$w_buff0_used + (long long )y >= 0LL) && (long long )b$w_buff0_used + (long long )z >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )b$w_buff0_used) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )b$mem_tmp >= 0LL) && (long long )b - (long long )b$mem_tmp >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff1 - (long long )b$w_buff1_used >= 0LL) [2024-06-27 23:53:28,129 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 23:53:28,130 INFO L106 edCorrectnessWitness]: ghost_update [L868-L868] multithreaded = 1; [2024-06-27 23:53:28,171 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 23:53:28,494 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:53:28,510 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:53:28,728 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:53:28,811 INFO L206 MainTranslator]: Completed translation [2024-06-27 23:53:28,812 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:53:28 WrapperNode [2024-06-27 23:53:28,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 23:53:28,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 23:53:28,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 23:53:28,814 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 23:53:28,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:53:28" (1/1) ... [2024-06-27 23:53:28,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:53:28" (1/1) ... [2024-06-27 23:53:28,930 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2024-06-27 23:53:28,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 23:53:28,931 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 23:53:28,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 23:53:28,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 23:53:28,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:53:28" (1/1) ... [2024-06-27 23:53:28,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:53:28" (1/1) ... [2024-06-27 23:53:28,960 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:53:28" (1/1) ... [2024-06-27 23:53:28,987 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:53:28,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:53:28" (1/1) ... [2024-06-27 23:53:28,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:53:28" (1/1) ... [2024-06-27 23:53:29,009 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:53:28" (1/1) ... [2024-06-27 23:53:29,011 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:53:28" (1/1) ... [2024-06-27 23:53:29,022 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:53:28" (1/1) ... [2024-06-27 23:53:29,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:53:28" (1/1) ... [2024-06-27 23:53:29,039 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 23:53:29,040 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 23:53:29,040 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 23:53:29,040 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 23:53:29,041 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:53:28" (1/1) ... [2024-06-27 23:53:29,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:53:29,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 23:53:29,080 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:53:29,118 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:53:29,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 23:53:29,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 23:53:29,131 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 23:53:29,131 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 23:53:29,131 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 23:53:29,132 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 23:53:29,132 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 23:53:29,132 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 23:53:29,132 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-27 23:53:29,132 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-27 23:53:29,132 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 23:53:29,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 23:53:29,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 23:53:29,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 23:53:29,134 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:53:29,276 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 23:53:29,277 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 23:53:29,834 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 23:53:29,834 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 23:53:30,028 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 23:53:30,029 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 23:53:30,030 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 11:53:30 BoogieIcfgContainer [2024-06-27 23:53:30,030 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 23:53:30,034 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 23:53:30,034 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 23:53:30,037 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 23:53:30,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 11:53:28" (1/4) ... [2024-06-27 23:53:30,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b45f92d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 11:53:30, skipping insertion in model container [2024-06-27 23:53:30,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:53:28" (2/4) ... [2024-06-27 23:53:30,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b45f92d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 11:53:30, skipping insertion in model container [2024-06-27 23:53:30,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:53:28" (3/4) ... [2024-06-27 23:53:30,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b45f92d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 11:53:30, skipping insertion in model container [2024-06-27 23:53:30,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 11:53:30" (4/4) ... [2024-06-27 23:53:30,044 INFO L112 eAbstractionObserver]: Analyzing ICFG mix047_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 23:53:30,061 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 23:53:30,062 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 23:53:30,062 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 23:53:30,132 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 23:53:30,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 53 transitions, 122 flow [2024-06-27 23:53:30,196 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2024-06-27 23:53:30,197 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:53:30,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 0/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-27 23:53:30,200 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 53 transitions, 122 flow [2024-06-27 23:53:30,202 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 43 transitions, 98 flow [2024-06-27 23:53:30,234 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 23:53:30,253 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;@62721eb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 23:53:30,254 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-27 23:53:30,257 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 23:53:30,258 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-27 23:53:30,258 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:53:30,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:53:30,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 23:53:30,259 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:53:30,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:53:30,276 INFO L85 PathProgramCache]: Analyzing trace with hash 408044697, now seen corresponding path program 1 times [2024-06-27 23:53:30,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:53:30,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385637751] [2024-06-27 23:53:30,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:53:30,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:53:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:53:31,967 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:53:31,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:53:31,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385637751] [2024-06-27 23:53:31,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385637751] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:53:31,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:53:31,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 23:53:31,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449989653] [2024-06-27 23:53:31,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:53:31,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 23:53:31,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:53:32,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 23:53:32,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 23:53:32,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 53 [2024-06-27 23:53:32,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:53:32,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:53:32,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 53 [2024-06-27 23:53:32,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:53:34,932 INFO L124 PetriNetUnfolderBase]: 16127/22129 cut-off events. [2024-06-27 23:53:34,933 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2024-06-27 23:53:34,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44345 conditions, 22129 events. 16127/22129 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 120360 event pairs, 12777 based on Foata normal form. 1/21659 useless extension candidates. Maximal degree in co-relation 44332. Up to 21681 conditions per place. [2024-06-27 23:53:35,043 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 46 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2024-06-27 23:53:35,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 57 transitions, 237 flow [2024-06-27 23:53:35,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 23:53:35,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 23:53:35,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-06-27 23:53:35,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5911949685534591 [2024-06-27 23:53:35,054 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 98 flow. Second operand 3 states and 94 transitions. [2024-06-27 23:53:35,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 57 transitions, 237 flow [2024-06-27 23:53:35,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 230 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 23:53:35,059 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 133 flow [2024-06-27 23:53:35,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2024-06-27 23:53:35,063 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2024-06-27 23:53:35,063 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 133 flow [2024-06-27 23:53:35,063 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:53:35,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:53:35,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:53:35,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 23:53:35,064 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:53:35,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:53:35,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1289470774, now seen corresponding path program 1 times [2024-06-27 23:53:35,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:53:35,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280789755] [2024-06-27 23:53:35,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:53:35,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:53:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:53:36,182 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:53:36,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:53:36,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280789755] [2024-06-27 23:53:36,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280789755] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:53:36,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:53:36,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 23:53:36,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013614174] [2024-06-27 23:53:36,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:53:36,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 23:53:36,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:53:36,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 23:53:36,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 23:53:36,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 53 [2024-06-27 23:53:36,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 133 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:53:36,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:53:36,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 53 [2024-06-27 23:53:36,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:53:39,001 INFO L124 PetriNetUnfolderBase]: 16117/22115 cut-off events. [2024-06-27 23:53:39,001 INFO L125 PetriNetUnfolderBase]: For 3802/3802 co-relation queries the response was YES. [2024-06-27 23:53:39,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49488 conditions, 22115 events. 16117/22115 cut-off events. For 3802/3802 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 120238 event pairs, 11693 based on Foata normal form. 4/21903 useless extension candidates. Maximal degree in co-relation 49476. Up to 21646 conditions per place. [2024-06-27 23:53:39,076 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 56 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2024-06-27 23:53:39,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 329 flow [2024-06-27 23:53:39,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 23:53:39,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 23:53:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2024-06-27 23:53:39,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5707547169811321 [2024-06-27 23:53:39,078 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 133 flow. Second operand 4 states and 121 transitions. [2024-06-27 23:53:39,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 329 flow [2024-06-27 23:53:39,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 324 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 23:53:39,080 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 181 flow [2024-06-27 23:53:39,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-06-27 23:53:39,081 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2024-06-27 23:53:39,081 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 181 flow [2024-06-27 23:53:39,081 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:53:39,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:53:39,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:53:39,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 23:53:39,082 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:53:39,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:53:39,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1318889978, now seen corresponding path program 1 times [2024-06-27 23:53:39,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:53:39,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193651618] [2024-06-27 23:53:39,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:53:39,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:53:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:53:40,082 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:53:40,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:53:40,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193651618] [2024-06-27 23:53:40,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193651618] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:53:40,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:53:40,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:53:40,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474364296] [2024-06-27 23:53:40,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:53:40,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:53:40,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:53:40,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:53:40,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:53:40,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 53 [2024-06-27 23:53:40,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 181 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:53:40,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:53:40,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 53 [2024-06-27 23:53:40,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:53:43,022 INFO L124 PetriNetUnfolderBase]: 16135/22172 cut-off events. [2024-06-27 23:53:43,023 INFO L125 PetriNetUnfolderBase]: For 10985/10985 co-relation queries the response was YES. [2024-06-27 23:53:43,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54733 conditions, 22172 events. 16135/22172 cut-off events. For 10985/10985 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 120789 event pairs, 9888 based on Foata normal form. 7/21993 useless extension candidates. Maximal degree in co-relation 54719. Up to 21567 conditions per place. [2024-06-27 23:53:43,119 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 74 selfloop transitions, 21 changer transitions 0/101 dead transitions. [2024-06-27 23:53:43,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 101 transitions, 545 flow [2024-06-27 23:53:43,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:53:43,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:53:43,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2024-06-27 23:53:43,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5962264150943396 [2024-06-27 23:53:43,121 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 181 flow. Second operand 5 states and 158 transitions. [2024-06-27 23:53:43,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 101 transitions, 545 flow [2024-06-27 23:53:43,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 101 transitions, 526 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-27 23:53:43,129 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 312 flow [2024-06-27 23:53:43,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2024-06-27 23:53:43,130 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 7 predicate places. [2024-06-27 23:53:43,131 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 312 flow [2024-06-27 23:53:43,131 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:53:43,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:53:43,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:53:43,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 23:53:43,131 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:53:43,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:53:43,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1759889623, now seen corresponding path program 1 times [2024-06-27 23:53:43,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:53:43,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264483005] [2024-06-27 23:53:43,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:53:43,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:53:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:53:44,526 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:53:44,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:53:44,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264483005] [2024-06-27 23:53:44,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264483005] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:53:44,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:53:44,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:53:44,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212928283] [2024-06-27 23:53:44,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:53:44,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:53:44,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:53:44,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:53:44,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:53:44,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 53 [2024-06-27 23:53:44,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 312 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:53:44,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:53:44,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 53 [2024-06-27 23:53:44,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:53:47,432 INFO L124 PetriNetUnfolderBase]: 16153/22197 cut-off events. [2024-06-27 23:53:47,432 INFO L125 PetriNetUnfolderBase]: For 25865/25869 co-relation queries the response was YES. [2024-06-27 23:53:47,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62859 conditions, 22197 events. 16153/22197 cut-off events. For 25865/25869 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 120968 event pairs, 8804 based on Foata normal form. 11/22022 useless extension candidates. Maximal degree in co-relation 62842. Up to 21553 conditions per place. [2024-06-27 23:53:47,543 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 84 selfloop transitions, 26 changer transitions 0/116 dead transitions. [2024-06-27 23:53:47,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 116 transitions, 714 flow [2024-06-27 23:53:47,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:53:47,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:53:47,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2024-06-27 23:53:47,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5849056603773585 [2024-06-27 23:53:47,545 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 312 flow. Second operand 6 states and 186 transitions. [2024-06-27 23:53:47,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 116 transitions, 714 flow [2024-06-27 23:53:47,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 116 transitions, 702 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-27 23:53:47,553 INFO L231 Difference]: Finished difference. Result has 69 places, 70 transitions, 406 flow [2024-06-27 23:53:47,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=406, PETRI_PLACES=69, PETRI_TRANSITIONS=70} [2024-06-27 23:53:47,554 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 13 predicate places. [2024-06-27 23:53:47,554 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 70 transitions, 406 flow [2024-06-27 23:53:47,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:53:47,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:53:47,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:53:47,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 23:53:47,555 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:53:47,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:53:47,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1277994825, now seen corresponding path program 1 times [2024-06-27 23:53:47,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:53:47,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002949036] [2024-06-27 23:53:47,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:53:47,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:53:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:53:49,034 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:53:49,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:53:49,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002949036] [2024-06-27 23:53:49,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002949036] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:53:49,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:53:49,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:53:49,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786436880] [2024-06-27 23:53:49,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:53:49,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:53:49,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:53:49,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:53:49,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:53:49,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 53 [2024-06-27 23:53:49,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 70 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:53:49,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:53:49,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 53 [2024-06-27 23:53:49,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:53:51,956 INFO L124 PetriNetUnfolderBase]: 16182/22240 cut-off events. [2024-06-27 23:53:51,957 INFO L125 PetriNetUnfolderBase]: For 40949/40953 co-relation queries the response was YES. [2024-06-27 23:53:52,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69172 conditions, 22240 events. 16182/22240 cut-off events. For 40949/40953 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 121392 event pairs, 7559 based on Foata normal form. 18/22072 useless extension candidates. Maximal degree in co-relation 69152. Up to 21518 conditions per place. [2024-06-27 23:53:52,130 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 91 selfloop transitions, 30 changer transitions 0/127 dead transitions. [2024-06-27 23:53:52,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 127 transitions, 858 flow [2024-06-27 23:53:52,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:53:52,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:53:52,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2024-06-27 23:53:52,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5660377358490566 [2024-06-27 23:53:52,132 INFO L175 Difference]: Start difference. First operand has 69 places, 70 transitions, 406 flow. Second operand 7 states and 210 transitions. [2024-06-27 23:53:52,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 127 transitions, 858 flow [2024-06-27 23:53:52,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 127 transitions, 792 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-27 23:53:52,148 INFO L231 Difference]: Finished difference. Result has 71 places, 73 transitions, 445 flow [2024-06-27 23:53:52,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=445, PETRI_PLACES=71, PETRI_TRANSITIONS=73} [2024-06-27 23:53:52,148 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 15 predicate places. [2024-06-27 23:53:52,149 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 73 transitions, 445 flow [2024-06-27 23:53:52,149 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:53:52,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:53:52,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:53:52,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 23:53:52,150 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:53:52,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:53:52,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1955045277, now seen corresponding path program 1 times [2024-06-27 23:53:52,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:53:52,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682893155] [2024-06-27 23:53:52,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:53:52,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:53:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:53:53,900 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:53:53,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:53:53,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682893155] [2024-06-27 23:53:53,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682893155] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:53:53,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:53:53,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:53:53,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858292700] [2024-06-27 23:53:53,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:53:53,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:53:53,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:53:53,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:53:53,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:53:54,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:53:54,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 73 transitions, 445 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:53:54,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:53:54,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:53:54,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:53:56,463 INFO L124 PetriNetUnfolderBase]: 16173/22339 cut-off events. [2024-06-27 23:53:56,463 INFO L125 PetriNetUnfolderBase]: For 62222/62222 co-relation queries the response was YES. [2024-06-27 23:53:56,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74243 conditions, 22339 events. 16173/22339 cut-off events. For 62222/62222 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 123636 event pairs, 10635 based on Foata normal form. 3/22126 useless extension candidates. Maximal degree in co-relation 74221. Up to 21733 conditions per place. [2024-06-27 23:53:56,604 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 74 selfloop transitions, 12 changer transitions 0/91 dead transitions. [2024-06-27 23:53:56,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 91 transitions, 673 flow [2024-06-27 23:53:56,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:53:56,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:53:56,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2024-06-27 23:53:56,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45660377358490567 [2024-06-27 23:53:56,607 INFO L175 Difference]: Start difference. First operand has 71 places, 73 transitions, 445 flow. Second operand 5 states and 121 transitions. [2024-06-27 23:53:56,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 91 transitions, 673 flow [2024-06-27 23:53:56,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 91 transitions, 584 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-27 23:53:56,619 INFO L231 Difference]: Finished difference. Result has 72 places, 75 transitions, 412 flow [2024-06-27 23:53:56,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=412, PETRI_PLACES=72, PETRI_TRANSITIONS=75} [2024-06-27 23:53:56,620 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 16 predicate places. [2024-06-27 23:53:56,620 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 75 transitions, 412 flow [2024-06-27 23:53:56,620 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:53:56,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:53:56,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:53:56,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 23:53:56,621 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:53:56,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:53:56,621 INFO L85 PathProgramCache]: Analyzing trace with hash 443622227, now seen corresponding path program 1 times [2024-06-27 23:53:56,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:53:56,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060249015] [2024-06-27 23:53:56,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:53:56,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:53:56,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:53:58,696 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:53:58,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:53:58,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060249015] [2024-06-27 23:53:58,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060249015] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:53:58,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:53:58,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:53:58,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824637880] [2024-06-27 23:53:58,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:53:58,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:53:58,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:53:58,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:53:58,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:53:58,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:53:58,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 75 transitions, 412 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:53:58,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:53:58,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:53:58,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:54:01,571 INFO L124 PetriNetUnfolderBase]: 16197/22345 cut-off events. [2024-06-27 23:54:01,571 INFO L125 PetriNetUnfolderBase]: For 71297/71297 co-relation queries the response was YES. [2024-06-27 23:54:01,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75553 conditions, 22345 events. 16197/22345 cut-off events. For 71297/71297 co-relation queries the response was YES. Maximal size of possible extension queue 696. Compared 123319 event pairs, 10192 based on Foata normal form. 10/22144 useless extension candidates. Maximal degree in co-relation 75527. Up to 21655 conditions per place. [2024-06-27 23:54:01,770 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 89 selfloop transitions, 24 changer transitions 0/118 dead transitions. [2024-06-27 23:54:01,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 118 transitions, 854 flow [2024-06-27 23:54:01,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:54:01,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:54:01,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2024-06-27 23:54:01,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4811320754716981 [2024-06-27 23:54:01,772 INFO L175 Difference]: Start difference. First operand has 72 places, 75 transitions, 412 flow. Second operand 6 states and 153 transitions. [2024-06-27 23:54:01,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 118 transitions, 854 flow [2024-06-27 23:54:01,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 118 transitions, 830 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 23:54:01,830 INFO L231 Difference]: Finished difference. Result has 77 places, 89 transitions, 580 flow [2024-06-27 23:54:01,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=580, PETRI_PLACES=77, PETRI_TRANSITIONS=89} [2024-06-27 23:54:01,832 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 21 predicate places. [2024-06-27 23:54:01,833 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 89 transitions, 580 flow [2024-06-27 23:54:01,833 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:54:01,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:54:01,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:54:01,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 23:54:01,833 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:54:01,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:54:01,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1138377952, now seen corresponding path program 1 times [2024-06-27 23:54:01,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:54:01,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503925753] [2024-06-27 23:54:01,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:54:01,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:54:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:54:03,421 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:54:03,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:54:03,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503925753] [2024-06-27 23:54:03,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503925753] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:54:03,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:54:03,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:54:03,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379977243] [2024-06-27 23:54:03,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:54:03,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:54:03,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:54:03,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:54:03,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:54:03,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:54:03,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 89 transitions, 580 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:54:03,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:54:03,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:54:03,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:54:06,508 INFO L124 PetriNetUnfolderBase]: 16364/22484 cut-off events. [2024-06-27 23:54:06,508 INFO L125 PetriNetUnfolderBase]: For 94063/94087 co-relation queries the response was YES. [2024-06-27 23:54:06,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84346 conditions, 22484 events. 16364/22484 cut-off events. For 94063/94087 co-relation queries the response was YES. Maximal size of possible extension queue 697. Compared 122033 event pairs, 8455 based on Foata normal form. 30/22313 useless extension candidates. Maximal degree in co-relation 84316. Up to 21796 conditions per place. [2024-06-27 23:54:06,691 INFO L140 encePairwiseOnDemand]: 38/53 looper letters, 102 selfloop transitions, 40 changer transitions 0/147 dead transitions. [2024-06-27 23:54:06,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 147 transitions, 1162 flow [2024-06-27 23:54:06,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:54:06,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:54:06,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2024-06-27 23:54:06,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48247978436657685 [2024-06-27 23:54:06,693 INFO L175 Difference]: Start difference. First operand has 77 places, 89 transitions, 580 flow. Second operand 7 states and 179 transitions. [2024-06-27 23:54:06,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 147 transitions, 1162 flow [2024-06-27 23:54:06,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 147 transitions, 1145 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-06-27 23:54:06,742 INFO L231 Difference]: Finished difference. Result has 85 places, 109 transitions, 818 flow [2024-06-27 23:54:06,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=818, PETRI_PLACES=85, PETRI_TRANSITIONS=109} [2024-06-27 23:54:06,743 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 29 predicate places. [2024-06-27 23:54:06,743 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 109 transitions, 818 flow [2024-06-27 23:54:06,743 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:54:06,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:54:06,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:54:06,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 23:54:06,744 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:54:06,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:54:06,744 INFO L85 PathProgramCache]: Analyzing trace with hash 861667098, now seen corresponding path program 2 times [2024-06-27 23:54:06,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:54:06,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626321907] [2024-06-27 23:54:06,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:54:06,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:54:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:54:08,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:54:08,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:54:08,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626321907] [2024-06-27 23:54:08,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626321907] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:54:08,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:54:08,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:54:08,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956333637] [2024-06-27 23:54:08,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:54:08,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:54:08,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:54:08,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:54:08,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:54:08,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:54:08,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 109 transitions, 818 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:54:08,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:54:08,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:54:08,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:54:10,796 INFO L124 PetriNetUnfolderBase]: 16478/22749 cut-off events. [2024-06-27 23:54:10,797 INFO L125 PetriNetUnfolderBase]: For 113321/113329 co-relation queries the response was YES. [2024-06-27 23:54:10,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87042 conditions, 22749 events. 16478/22749 cut-off events. For 113321/113329 co-relation queries the response was YES. Maximal size of possible extension queue 697. Compared 125283 event pairs, 10376 based on Foata normal form. 18/22566 useless extension candidates. Maximal degree in co-relation 87007. Up to 21957 conditions per place. [2024-06-27 23:54:10,943 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 106 selfloop transitions, 47 changer transitions 0/158 dead transitions. [2024-06-27 23:54:10,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 158 transitions, 1474 flow [2024-06-27 23:54:10,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:54:10,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:54:10,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-06-27 23:54:10,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4748427672955975 [2024-06-27 23:54:10,947 INFO L175 Difference]: Start difference. First operand has 85 places, 109 transitions, 818 flow. Second operand 6 states and 151 transitions. [2024-06-27 23:54:10,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 158 transitions, 1474 flow [2024-06-27 23:54:11,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 158 transitions, 1403 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-06-27 23:54:11,039 INFO L231 Difference]: Finished difference. Result has 90 places, 130 transitions, 1129 flow [2024-06-27 23:54:11,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1129, PETRI_PLACES=90, PETRI_TRANSITIONS=130} [2024-06-27 23:54:11,040 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 34 predicate places. [2024-06-27 23:54:11,040 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 130 transitions, 1129 flow [2024-06-27 23:54:11,041 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:54:11,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:54:11,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:54:11,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 23:54:11,041 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:54:11,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:54:11,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1897851708, now seen corresponding path program 3 times [2024-06-27 23:54:11,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:54:11,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256751491] [2024-06-27 23:54:11,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:54:11,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:54:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:54:12,234 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:54:12,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:54:12,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256751491] [2024-06-27 23:54:12,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256751491] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:54:12,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:54:12,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:54:12,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270609297] [2024-06-27 23:54:12,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:54:12,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:54:12,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:54:12,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:54:12,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:54:12,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:54:12,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 130 transitions, 1129 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:54:12,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:54:12,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:54:12,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:54:15,220 INFO L124 PetriNetUnfolderBase]: 16436/22687 cut-off events. [2024-06-27 23:54:15,220 INFO L125 PetriNetUnfolderBase]: For 129027/129027 co-relation queries the response was YES. [2024-06-27 23:54:15,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88741 conditions, 22687 events. 16436/22687 cut-off events. For 129027/129027 co-relation queries the response was YES. Maximal size of possible extension queue 697. Compared 124841 event pairs, 10383 based on Foata normal form. 5/22491 useless extension candidates. Maximal degree in co-relation 88703. Up to 22064 conditions per place. [2024-06-27 23:54:15,361 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 130 selfloop transitions, 19 changer transitions 0/154 dead transitions. [2024-06-27 23:54:15,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 154 transitions, 1507 flow [2024-06-27 23:54:15,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:54:15,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:54:15,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2024-06-27 23:54:15,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.449685534591195 [2024-06-27 23:54:15,367 INFO L175 Difference]: Start difference. First operand has 90 places, 130 transitions, 1129 flow. Second operand 6 states and 143 transitions. [2024-06-27 23:54:15,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 154 transitions, 1507 flow [2024-06-27 23:54:15,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 154 transitions, 1431 flow, removed 13 selfloop flow, removed 3 redundant places. [2024-06-27 23:54:15,521 INFO L231 Difference]: Finished difference. Result has 93 places, 130 transitions, 1105 flow [2024-06-27 23:54:15,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1053, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1105, PETRI_PLACES=93, PETRI_TRANSITIONS=130} [2024-06-27 23:54:15,524 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 37 predicate places. [2024-06-27 23:54:15,524 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 130 transitions, 1105 flow [2024-06-27 23:54:15,524 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:54:15,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:54:15,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:54:15,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 23:54:15,524 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:54:15,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:54:15,525 INFO L85 PathProgramCache]: Analyzing trace with hash -929976370, now seen corresponding path program 1 times [2024-06-27 23:54:15,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:54:15,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643574198] [2024-06-27 23:54:15,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:54:15,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:54:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:54:17,556 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:54:17,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:54:17,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643574198] [2024-06-27 23:54:17,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643574198] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:54:17,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:54:17,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:54:17,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197372472] [2024-06-27 23:54:17,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:54:17,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:54:17,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:54:17,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:54:17,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:54:17,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:54:17,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 130 transitions, 1105 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:54:17,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:54:17,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:54:17,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:54:21,045 INFO L124 PetriNetUnfolderBase]: 16808/23047 cut-off events. [2024-06-27 23:54:21,045 INFO L125 PetriNetUnfolderBase]: For 141112/141134 co-relation queries the response was YES. [2024-06-27 23:54:21,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92320 conditions, 23047 events. 16808/23047 cut-off events. For 141112/141134 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 124551 event pairs, 7771 based on Foata normal form. 28/22884 useless extension candidates. Maximal degree in co-relation 92281. Up to 21677 conditions per place. [2024-06-27 23:54:21,185 INFO L140 encePairwiseOnDemand]: 36/53 looper letters, 143 selfloop transitions, 71 changer transitions 0/219 dead transitions. [2024-06-27 23:54:21,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 219 transitions, 2198 flow [2024-06-27 23:54:21,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:54:21,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:54:21,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 216 transitions. [2024-06-27 23:54:21,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5094339622641509 [2024-06-27 23:54:21,187 INFO L175 Difference]: Start difference. First operand has 93 places, 130 transitions, 1105 flow. Second operand 8 states and 216 transitions. [2024-06-27 23:54:21,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 219 transitions, 2198 flow [2024-06-27 23:54:21,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 219 transitions, 2105 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-27 23:54:21,334 INFO L231 Difference]: Finished difference. Result has 100 places, 160 transitions, 1506 flow [2024-06-27 23:54:21,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1506, PETRI_PLACES=100, PETRI_TRANSITIONS=160} [2024-06-27 23:54:21,335 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 44 predicate places. [2024-06-27 23:54:21,335 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 160 transitions, 1506 flow [2024-06-27 23:54:21,335 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:54:21,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:54:21,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:54:21,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 23:54:21,335 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:54:21,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:54:21,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1904220970, now seen corresponding path program 2 times [2024-06-27 23:54:21,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:54:21,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019277914] [2024-06-27 23:54:21,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:54:21,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:54:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:54:23,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:54:23,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:54:23,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019277914] [2024-06-27 23:54:23,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019277914] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:54:23,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:54:23,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:54:23,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986182193] [2024-06-27 23:54:23,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:54:23,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:54:23,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:54:23,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:54:23,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:54:23,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:54:23,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 160 transitions, 1506 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:54:23,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:54:23,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:54:23,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:54:26,490 INFO L124 PetriNetUnfolderBase]: 17443/23763 cut-off events. [2024-06-27 23:54:26,490 INFO L125 PetriNetUnfolderBase]: For 200655/200659 co-relation queries the response was YES. [2024-06-27 23:54:26,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108215 conditions, 23763 events. 17443/23763 cut-off events. For 200655/200659 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 128358 event pairs, 9791 based on Foata normal form. 22/23642 useless extension candidates. Maximal degree in co-relation 108171. Up to 22458 conditions per place. [2024-06-27 23:54:26,653 INFO L140 encePairwiseOnDemand]: 38/53 looper letters, 155 selfloop transitions, 83 changer transitions 0/243 dead transitions. [2024-06-27 23:54:26,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 243 transitions, 2731 flow [2024-06-27 23:54:26,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:54:26,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:54:26,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 185 transitions. [2024-06-27 23:54:26,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49865229110512127 [2024-06-27 23:54:26,654 INFO L175 Difference]: Start difference. First operand has 100 places, 160 transitions, 1506 flow. Second operand 7 states and 185 transitions. [2024-06-27 23:54:26,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 243 transitions, 2731 flow [2024-06-27 23:54:26,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 243 transitions, 2621 flow, removed 54 selfloop flow, removed 1 redundant places. [2024-06-27 23:54:26,800 INFO L231 Difference]: Finished difference. Result has 108 places, 198 transitions, 2087 flow [2024-06-27 23:54:26,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1456, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2087, PETRI_PLACES=108, PETRI_TRANSITIONS=198} [2024-06-27 23:54:26,800 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 52 predicate places. [2024-06-27 23:54:26,801 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 198 transitions, 2087 flow [2024-06-27 23:54:26,801 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:54:26,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:54:26,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:54:26,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 23:54:26,801 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:54:26,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:54:26,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1296137422, now seen corresponding path program 3 times [2024-06-27 23:54:26,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:54:26,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719466284] [2024-06-27 23:54:26,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:54:26,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:54:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:54:28,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:54:28,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:54:28,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719466284] [2024-06-27 23:54:28,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719466284] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:54:28,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:54:28,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:54:28,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177504078] [2024-06-27 23:54:28,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:54:28,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:54:28,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:54:28,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:54:28,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:54:28,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:54:28,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 198 transitions, 2087 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:54:28,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:54:28,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:54:28,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:54:31,750 INFO L124 PetriNetUnfolderBase]: 17622/23989 cut-off events. [2024-06-27 23:54:31,751 INFO L125 PetriNetUnfolderBase]: For 250079/250081 co-relation queries the response was YES. [2024-06-27 23:54:31,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117627 conditions, 23989 events. 17622/23989 cut-off events. For 250079/250081 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 129325 event pairs, 9909 based on Foata normal form. 16/23852 useless extension candidates. Maximal degree in co-relation 117578. Up to 23314 conditions per place. [2024-06-27 23:54:31,991 INFO L140 encePairwiseOnDemand]: 38/53 looper letters, 217 selfloop transitions, 43 changer transitions 0/265 dead transitions. [2024-06-27 23:54:31,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 265 transitions, 3227 flow [2024-06-27 23:54:31,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:54:31,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:54:31,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2024-06-27 23:54:31,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45047169811320753 [2024-06-27 23:54:31,993 INFO L175 Difference]: Start difference. First operand has 108 places, 198 transitions, 2087 flow. Second operand 8 states and 191 transitions. [2024-06-27 23:54:31,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 265 transitions, 3227 flow [2024-06-27 23:54:32,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 265 transitions, 3178 flow, removed 23 selfloop flow, removed 1 redundant places. [2024-06-27 23:54:32,301 INFO L231 Difference]: Finished difference. Result has 116 places, 216 transitions, 2396 flow [2024-06-27 23:54:32,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2038, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2396, PETRI_PLACES=116, PETRI_TRANSITIONS=216} [2024-06-27 23:54:32,302 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 60 predicate places. [2024-06-27 23:54:32,302 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 216 transitions, 2396 flow [2024-06-27 23:54:32,302 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:54:32,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:54:32,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:54:32,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 23:54:32,303 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:54:32,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:54:32,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1119246706, now seen corresponding path program 4 times [2024-06-27 23:54:32,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:54:32,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804011122] [2024-06-27 23:54:32,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:54:32,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:54:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:54:33,577 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:54:33,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:54:33,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804011122] [2024-06-27 23:54:33,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804011122] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:54:33,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:54:33,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:54:33,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480834874] [2024-06-27 23:54:33,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:54:33,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:54:33,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:54:33,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:54:33,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:54:33,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:54:33,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 216 transitions, 2396 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:54:33,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:54:33,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:54:33,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:54:37,724 INFO L124 PetriNetUnfolderBase]: 17649/24023 cut-off events. [2024-06-27 23:54:37,724 INFO L125 PetriNetUnfolderBase]: For 297210/297212 co-relation queries the response was YES. [2024-06-27 23:54:37,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124985 conditions, 24023 events. 17649/24023 cut-off events. For 297210/297212 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 129336 event pairs, 9907 based on Foata normal form. 15/23885 useless extension candidates. Maximal degree in co-relation 124932. Up to 23554 conditions per place. [2024-06-27 23:54:37,900 INFO L140 encePairwiseOnDemand]: 38/53 looper letters, 227 selfloop transitions, 33 changer transitions 0/265 dead transitions. [2024-06-27 23:54:37,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 265 transitions, 3325 flow [2024-06-27 23:54:37,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:54:37,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:54:37,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2024-06-27 23:54:37,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4716981132075472 [2024-06-27 23:54:37,905 INFO L175 Difference]: Start difference. First operand has 116 places, 216 transitions, 2396 flow. Second operand 7 states and 175 transitions. [2024-06-27 23:54:37,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 265 transitions, 3325 flow [2024-06-27 23:54:38,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 265 transitions, 3187 flow, removed 45 selfloop flow, removed 5 redundant places. [2024-06-27 23:54:38,240 INFO L231 Difference]: Finished difference. Result has 119 places, 227 transitions, 2524 flow [2024-06-27 23:54:38,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2270, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2524, PETRI_PLACES=119, PETRI_TRANSITIONS=227} [2024-06-27 23:54:38,241 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 63 predicate places. [2024-06-27 23:54:38,241 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 227 transitions, 2524 flow [2024-06-27 23:54:38,241 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:54:38,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:54:38,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:54:38,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 23:54:38,242 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:54:38,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:54:38,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1119255634, now seen corresponding path program 1 times [2024-06-27 23:54:38,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:54:38,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875385592] [2024-06-27 23:54:38,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:54:38,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:54:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:54:40,329 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:54:40,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:54:40,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875385592] [2024-06-27 23:54:40,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875385592] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:54:40,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:54:40,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:54:40,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130586841] [2024-06-27 23:54:40,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:54:40,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:54:40,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:54:40,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:54:40,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:54:40,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:54:40,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 227 transitions, 2524 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:54:40,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:54:40,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:54:40,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:54:44,505 INFO L124 PetriNetUnfolderBase]: 17669/24050 cut-off events. [2024-06-27 23:54:44,505 INFO L125 PetriNetUnfolderBase]: For 324773/324775 co-relation queries the response was YES. [2024-06-27 23:54:44,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127420 conditions, 24050 events. 17669/24050 cut-off events. For 324773/324775 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 129555 event pairs, 9716 based on Foata normal form. 12/23909 useless extension candidates. Maximal degree in co-relation 127365. Up to 23554 conditions per place. [2024-06-27 23:54:44,673 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 226 selfloop transitions, 35 changer transitions 0/266 dead transitions. [2024-06-27 23:54:44,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 266 transitions, 3332 flow [2024-06-27 23:54:44,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:54:44,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:54:44,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2024-06-27 23:54:44,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4410377358490566 [2024-06-27 23:54:44,680 INFO L175 Difference]: Start difference. First operand has 119 places, 227 transitions, 2524 flow. Second operand 8 states and 187 transitions. [2024-06-27 23:54:44,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 266 transitions, 3332 flow [2024-06-27 23:54:44,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 266 transitions, 3240 flow, removed 28 selfloop flow, removed 3 redundant places. [2024-06-27 23:54:44,966 INFO L231 Difference]: Finished difference. Result has 124 places, 231 transitions, 2575 flow [2024-06-27 23:54:44,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2432, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2575, PETRI_PLACES=124, PETRI_TRANSITIONS=231} [2024-06-27 23:54:44,967 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 68 predicate places. [2024-06-27 23:54:44,967 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 231 transitions, 2575 flow [2024-06-27 23:54:44,968 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:54:44,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:54:44,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:54:44,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 23:54:44,968 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:54:44,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:54:44,968 INFO L85 PathProgramCache]: Analyzing trace with hash -64576247, now seen corresponding path program 1 times [2024-06-27 23:54:44,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:54:44,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580096571] [2024-06-27 23:54:44,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:54:44,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:54:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:54:46,628 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:54:46,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:54:46,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580096571] [2024-06-27 23:54:46,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580096571] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:54:46,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:54:46,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:54:46,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914551551] [2024-06-27 23:54:46,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:54:46,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:54:46,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:54:46,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:54:46,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:54:46,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:54:46,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 231 transitions, 2575 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:54:46,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:54:46,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:54:46,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:54:50,600 INFO L124 PetriNetUnfolderBase]: 17662/24038 cut-off events. [2024-06-27 23:54:50,601 INFO L125 PetriNetUnfolderBase]: For 358657/358657 co-relation queries the response was YES. [2024-06-27 23:54:50,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131903 conditions, 24038 events. 17662/24038 cut-off events. For 358657/358657 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 129475 event pairs, 9899 based on Foata normal form. 2/23884 useless extension candidates. Maximal degree in co-relation 131846. Up to 23713 conditions per place. [2024-06-27 23:54:50,819 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 227 selfloop transitions, 12 changer transitions 0/244 dead transitions. [2024-06-27 23:54:50,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 244 transitions, 3099 flow [2024-06-27 23:54:50,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 23:54:50,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 23:54:50,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2024-06-27 23:54:50,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44150943396226416 [2024-06-27 23:54:50,822 INFO L175 Difference]: Start difference. First operand has 124 places, 231 transitions, 2575 flow. Second operand 5 states and 117 transitions. [2024-06-27 23:54:50,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 244 transitions, 3099 flow [2024-06-27 23:54:51,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 244 transitions, 2948 flow, removed 42 selfloop flow, removed 6 redundant places. [2024-06-27 23:54:51,277 INFO L231 Difference]: Finished difference. Result has 123 places, 231 transitions, 2459 flow [2024-06-27 23:54:51,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2424, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2459, PETRI_PLACES=123, PETRI_TRANSITIONS=231} [2024-06-27 23:54:51,278 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 67 predicate places. [2024-06-27 23:54:51,278 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 231 transitions, 2459 flow [2024-06-27 23:54:51,278 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:54:51,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:54:51,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:54:51,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 23:54:51,279 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:54:51,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:54:51,279 INFO L85 PathProgramCache]: Analyzing trace with hash -743917423, now seen corresponding path program 1 times [2024-06-27 23:54:51,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:54:51,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237114342] [2024-06-27 23:54:51,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:54:51,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:54:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:54:53,161 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:54:53,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:54:53,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237114342] [2024-06-27 23:54:53,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237114342] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:54:53,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:54:53,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:54:53,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764442653] [2024-06-27 23:54:53,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:54:53,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:54:53,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:54:53,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:54:53,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:54:53,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:54:53,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 231 transitions, 2459 flow. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:54:53,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:54:53,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:54:53,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand