./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe009_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/protection/safe009_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f 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/safe009_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/protection/safe009_rmo.opt.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-bcb38a6-m [2024-06-03 20:07:28,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 20:07:28,663 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 20:07:28,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 20:07:28,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 20:07:28,683 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 20:07:28,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 20:07:28,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 20:07:28,684 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 20:07:28,684 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 20:07:28,684 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 20:07:28,684 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 20:07:28,685 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 20:07:28,685 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 20:07:28,685 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 20:07:28,685 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 20:07:28,686 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 20:07:28,686 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 20:07:28,686 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 20:07:28,686 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 20:07:28,687 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 20:07:28,693 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 20:07:28,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 20:07:28,693 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 20:07:28,693 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 20:07:28,693 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 20:07:28,694 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 20:07:28,694 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 20:07:28,694 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 20:07:28,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 20:07:28,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 20:07:28,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 20:07:28,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 20:07:28,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 20:07:28,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 20:07:28,695 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 20:07:28,695 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 20:07:28,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 20:07:28,695 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 20:07:28,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 20:07:28,696 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 20:07:28,696 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 20:07:28,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 20:07:28,696 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-03 20:07:28,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 20:07:28,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 20:07:28,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 20:07:28,861 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 20:07:28,862 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 20:07:28,863 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe009_rmo.opt.i [2024-06-03 20:07:29,866 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 20:07:30,130 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 20:07:30,134 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_rmo.opt.i [2024-06-03 20:07:30,146 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e86e39ace/63ded610a4d74ec0946318d92e57814c/FLAG096bcac35 [2024-06-03 20:07:30,165 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e86e39ace/63ded610a4d74ec0946318d92e57814c [2024-06-03 20:07:30,168 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 20:07:30,168 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 20:07:30,169 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/protection/safe009_rmo.opt.yml/witness.yml [2024-06-03 20:07:30,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 20:07:30,375 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 20:07:30,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 20:07:30,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 20:07:30,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 20:07:30,382 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 08:07:30" (1/2) ... [2024-06-03 20:07:30,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24ea297f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:07:30, skipping insertion in model container [2024-06-03 20:07:30,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 08:07:30" (1/2) ... [2024-06-03 20:07:30,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@749b73ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 08:07:30, skipping insertion in model container [2024-06-03 20:07:30,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:07:30" (2/2) ... [2024-06-03 20:07:30,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24ea297f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:07:30, skipping insertion in model container [2024-06-03 20:07:30,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:07:30" (2/2) ... [2024-06-03 20:07:30,386 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 20:07:30,505 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 20:07:30,507 INFO L97 edCorrectnessWitness]: Location invariant before [L844-L844] (((((((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd3 == (_Bool)0) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX$read_delayed_var == 0 || (((0 <= *__unbuffered_p1_EAX$read_delayed_var && *__unbuffered_p1_EAX$read_delayed_var <= 1) && __unbuffered_p1_EAX$read_delayed_var == & x) && (*__unbuffered_p1_EAX$read_delayed_var == 0 || *__unbuffered_p1_EAX$read_delayed_var == 1))))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff0 == 0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0) [2024-06-03 20:07:30,507 INFO L97 edCorrectnessWitness]: Location invariant before [L841-L841] (((((((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd3 == (_Bool)0) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX$read_delayed_var == 0 || (((0 <= *__unbuffered_p1_EAX$read_delayed_var && *__unbuffered_p1_EAX$read_delayed_var <= 1) && __unbuffered_p1_EAX$read_delayed_var == & x) && (*__unbuffered_p1_EAX$read_delayed_var == 0 || *__unbuffered_p1_EAX$read_delayed_var == 1))))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff0 == 0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0) [2024-06-03 20:07:30,507 INFO L97 edCorrectnessWitness]: Location invariant before [L843-L843] (((((((((((((((((((((((((((((((((((! multithreaded || x$r_buff0_thd3 == (_Bool)0) && (! multithreaded || x$w_buff1_used == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || x$w_buff0_used == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX$read_delayed_var == 0 || (((0 <= *__unbuffered_p1_EAX$read_delayed_var && *__unbuffered_p1_EAX$read_delayed_var <= 1) && __unbuffered_p1_EAX$read_delayed_var == & x) && (*__unbuffered_p1_EAX$read_delayed_var == 0 || *__unbuffered_p1_EAX$read_delayed_var == 1))))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || x$w_buff0 == 0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 2) && __unbuffered_p0_EAX <= 127) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff1 == 0)) && (! multithreaded || __unbuffered_p1_EAX$w_buff0 == 0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$w_buff1 == 0)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || __unbuffered_p1_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0) [2024-06-03 20:07:30,507 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 20:07:30,507 INFO L106 edCorrectnessWitness]: ghost_update [L839-L839] multithreaded = 1; [2024-06-03 20:07:30,550 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 20:07:30,978 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 20:07:30,988 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 20:07:31,146 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 20:07:31,183 INFO L206 MainTranslator]: Completed translation [2024-06-03 20:07:31,183 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:07:31 WrapperNode [2024-06-03 20:07:31,183 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 20:07:31,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 20:07:31,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 20:07:31,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 20:07:31,189 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 03.06 08:07:31" (1/1) ... [2024-06-03 20:07:31,218 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 03.06 08:07:31" (1/1) ... [2024-06-03 20:07:31,261 INFO L138 Inliner]: procedures = 175, calls = 82, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 204 [2024-06-03 20:07:31,262 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 20:07:31,269 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 20:07:31,270 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 20:07:31,270 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 20:07:31,278 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:07:31" (1/1) ... [2024-06-03 20:07:31,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:07:31" (1/1) ... [2024-06-03 20:07:31,282 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:07:31" (1/1) ... [2024-06-03 20:07:31,302 INFO L175 MemorySlicer]: Split 43 memory accesses to 2 slices as follows [2, 41]. 95 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 7 writes are split as follows [0, 7]. [2024-06-03 20:07:31,302 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:07:31" (1/1) ... [2024-06-03 20:07:31,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:07:31" (1/1) ... [2024-06-03 20:07:31,322 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:07:31" (1/1) ... [2024-06-03 20:07:31,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:07:31" (1/1) ... [2024-06-03 20:07:31,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:07:31" (1/1) ... [2024-06-03 20:07:31,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:07:31" (1/1) ... [2024-06-03 20:07:31,345 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 20:07:31,346 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 20:07:31,346 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 20:07:31,346 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 20:07:31,346 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:07:31" (1/1) ... [2024-06-03 20:07:31,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 20:07:31,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 20:07:31,414 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-03 20:07:31,459 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-03 20:07:31,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-03 20:07:31,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-03 20:07:31,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-03 20:07:31,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-03 20:07:31,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 20:07:31,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 20:07:31,485 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 20:07:31,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 20:07:31,485 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 20:07:31,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 20:07:31,485 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-03 20:07:31,485 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-03 20:07:31,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 20:07:31,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-03 20:07:31,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 20:07:31,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 20:07:31,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 20:07:31,487 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 20:07:31,701 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 20:07:31,703 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 20:07:32,207 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 20:07:32,207 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 20:07:32,505 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 20:07:32,505 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 20:07:32,505 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 08:07:32 BoogieIcfgContainer [2024-06-03 20:07:32,506 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 20:07:32,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 20:07:32,508 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 20:07:32,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 20:07:32,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 08:07:30" (1/4) ... [2024-06-03 20:07:32,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f8e95ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 08:07:32, skipping insertion in model container [2024-06-03 20:07:32,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 08:07:30" (2/4) ... [2024-06-03 20:07:32,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f8e95ed and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 08:07:32, skipping insertion in model container [2024-06-03 20:07:32,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 08:07:31" (3/4) ... [2024-06-03 20:07:32,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f8e95ed and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 08:07:32, skipping insertion in model container [2024-06-03 20:07:32,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 08:07:32" (4/4) ... [2024-06-03 20:07:32,513 INFO L112 eAbstractionObserver]: Analyzing ICFG safe009_rmo.opt.i [2024-06-03 20:07:32,526 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 20:07:32,526 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-03 20:07:32,527 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 20:07:32,575 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 20:07:32,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 40 transitions, 92 flow [2024-06-03 20:07:32,639 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2024-06-03 20:07:32,640 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 20:07:32,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 20:07:32,642 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 40 transitions, 92 flow [2024-06-03 20:07:32,646 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 31 transitions, 71 flow [2024-06-03 20:07:32,656 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 20:07:32,664 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;@587fcb05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 20:07:32,664 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-03 20:07:32,670 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 20:07:32,670 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-03 20:07:32,670 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 20:07:32,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:07:32,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 20:07:32,671 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:07:32,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:07:32,675 INFO L85 PathProgramCache]: Analyzing trace with hash 537007672, now seen corresponding path program 1 times [2024-06-03 20:07:32,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:07:32,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680351419] [2024-06-03 20:07:32,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:07:32,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:07:32,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:07:35,192 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-03 20:07:35,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:07:35,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680351419] [2024-06-03 20:07:35,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680351419] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:07:35,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:07:35,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 20:07:35,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582051341] [2024-06-03 20:07:35,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:07:35,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 20:07:35,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:07:35,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 20:07:35,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-03 20:07:35,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-03 20:07:35,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 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-03 20:07:35,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:07:35,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-03 20:07:35,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:07:35,741 INFO L124 PetriNetUnfolderBase]: 745/1165 cut-off events. [2024-06-03 20:07:35,741 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-06-03 20:07:35,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2401 conditions, 1165 events. 745/1165 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5009 event pairs, 414 based on Foata normal form. 0/1159 useless extension candidates. Maximal degree in co-relation 2386. Up to 1147 conditions per place. [2024-06-03 20:07:35,750 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 30 selfloop transitions, 9 changer transitions 0/45 dead transitions. [2024-06-03 20:07:35,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 183 flow [2024-06-03 20:07:35,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:07:35,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:07:35,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2024-06-03 20:07:35,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43 [2024-06-03 20:07:35,761 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 71 flow. Second operand 5 states and 86 transitions. [2024-06-03 20:07:35,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 183 flow [2024-06-03 20:07:35,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-03 20:07:35,765 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 130 flow [2024-06-03 20:07:35,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2024-06-03 20:07:35,769 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2024-06-03 20:07:35,769 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 130 flow [2024-06-03 20:07:35,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 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-03 20:07:35,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:07:35,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:07:35,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 20:07:35,770 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:07:35,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:07:35,771 INFO L85 PathProgramCache]: Analyzing trace with hash -753748411, now seen corresponding path program 1 times [2024-06-03 20:07:35,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:07:35,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878901476] [2024-06-03 20:07:35,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:07:35,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:07:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:07:38,677 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-03 20:07:38,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:07:38,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878901476] [2024-06-03 20:07:38,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878901476] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:07:38,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:07:38,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:07:38,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016406329] [2024-06-03 20:07:38,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:07:38,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:07:38,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:07:38,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:07:38,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:07:38,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-03 20:07:38,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 130 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 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-03 20:07:38,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:07:38,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-03 20:07:38,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:07:39,225 INFO L124 PetriNetUnfolderBase]: 907/1409 cut-off events. [2024-06-03 20:07:39,225 INFO L125 PetriNetUnfolderBase]: For 282/288 co-relation queries the response was YES. [2024-06-03 20:07:39,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3262 conditions, 1409 events. 907/1409 cut-off events. For 282/288 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5997 event pairs, 289 based on Foata normal form. 6/1411 useless extension candidates. Maximal degree in co-relation 3245. Up to 1342 conditions per place. [2024-06-03 20:07:39,232 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 41 selfloop transitions, 12 changer transitions 0/58 dead transitions. [2024-06-03 20:07:39,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 294 flow [2024-06-03 20:07:39,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 20:07:39,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 20:07:39,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2024-06-03 20:07:39,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46 [2024-06-03 20:07:39,234 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 130 flow. Second operand 5 states and 92 transitions. [2024-06-03 20:07:39,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 294 flow [2024-06-03 20:07:39,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 294 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-03 20:07:39,236 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 201 flow [2024-06-03 20:07:39,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=201, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2024-06-03 20:07:39,237 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2024-06-03 20:07:39,237 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 201 flow [2024-06-03 20:07:39,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 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-03 20:07:39,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:07:39,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:07:39,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 20:07:39,238 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:07:39,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:07:39,239 INFO L85 PathProgramCache]: Analyzing trace with hash -756861922, now seen corresponding path program 1 times [2024-06-03 20:07:39,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:07:39,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881583994] [2024-06-03 20:07:39,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:07:39,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:07:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:07:40,686 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-03 20:07:40,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:07:40,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881583994] [2024-06-03 20:07:40,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881583994] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:07:40,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:07:40,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 20:07:40,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377014508] [2024-06-03 20:07:40,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:07:40,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 20:07:40,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:07:40,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 20:07:40,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 20:07:40,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2024-06-03 20:07:40,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 201 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:07:40,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:07:40,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2024-06-03 20:07:40,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:07:41,510 INFO L124 PetriNetUnfolderBase]: 793/1240 cut-off events. [2024-06-03 20:07:41,510 INFO L125 PetriNetUnfolderBase]: For 680/682 co-relation queries the response was YES. [2024-06-03 20:07:41,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3167 conditions, 1240 events. 793/1240 cut-off events. For 680/682 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5435 event pairs, 383 based on Foata normal form. 0/1210 useless extension candidates. Maximal degree in co-relation 3146. Up to 1222 conditions per place. [2024-06-03 20:07:41,517 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 37 selfloop transitions, 13 changer transitions 0/56 dead transitions. [2024-06-03 20:07:41,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 56 transitions, 348 flow [2024-06-03 20:07:41,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:07:41,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:07:41,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2024-06-03 20:07:41,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4041666666666667 [2024-06-03 20:07:41,522 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 201 flow. Second operand 6 states and 97 transitions. [2024-06-03 20:07:41,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 56 transitions, 348 flow [2024-06-03 20:07:41,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 56 transitions, 329 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-06-03 20:07:41,527 INFO L231 Difference]: Finished difference. Result has 58 places, 52 transitions, 270 flow [2024-06-03 20:07:41,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=270, PETRI_PLACES=58, PETRI_TRANSITIONS=52} [2024-06-03 20:07:41,529 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2024-06-03 20:07:41,529 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 270 flow [2024-06-03 20:07:41,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:07:41,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:07:41,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:07:41,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 20:07:41,530 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:07:41,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:07:41,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1194627204, now seen corresponding path program 1 times [2024-06-03 20:07:41,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:07:41,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256752160] [2024-06-03 20:07:41,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:07:41,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:07:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:07:45,043 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-03 20:07:45,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:07:45,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256752160] [2024-06-03 20:07:45,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256752160] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:07:45,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:07:45,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:07:45,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303855579] [2024-06-03 20:07:45,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:07:45,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:07:45,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:07:45,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:07:45,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:07:45,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-03 20:07:45,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 270 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:07:45,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:07:45,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-03 20:07:45,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:07:45,799 INFO L124 PetriNetUnfolderBase]: 918/1433 cut-off events. [2024-06-03 20:07:45,801 INFO L125 PetriNetUnfolderBase]: For 834/844 co-relation queries the response was YES. [2024-06-03 20:07:45,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3770 conditions, 1433 events. 918/1433 cut-off events. For 834/844 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6187 event pairs, 388 based on Foata normal form. 10/1441 useless extension candidates. Maximal degree in co-relation 3744. Up to 1386 conditions per place. [2024-06-03 20:07:45,808 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 43 selfloop transitions, 17 changer transitions 0/65 dead transitions. [2024-06-03 20:07:45,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 65 transitions, 446 flow [2024-06-03 20:07:45,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 20:07:45,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 20:07:45,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2024-06-03 20:07:45,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35625 [2024-06-03 20:07:45,810 INFO L175 Difference]: Start difference. First operand has 58 places, 52 transitions, 270 flow. Second operand 8 states and 114 transitions. [2024-06-03 20:07:45,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 65 transitions, 446 flow [2024-06-03 20:07:45,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 65 transitions, 442 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-03 20:07:45,815 INFO L231 Difference]: Finished difference. Result has 66 places, 58 transitions, 350 flow [2024-06-03 20:07:45,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=350, PETRI_PLACES=66, PETRI_TRANSITIONS=58} [2024-06-03 20:07:45,817 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places. [2024-06-03 20:07:45,817 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 350 flow [2024-06-03 20:07:45,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:07:45,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:07:45,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:07:45,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 20:07:45,818 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:07:45,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:07:45,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1492818906, now seen corresponding path program 2 times [2024-06-03 20:07:45,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:07:45,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858792685] [2024-06-03 20:07:45,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:07:45,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:07:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:07:48,852 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-03 20:07:48,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:07:48,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858792685] [2024-06-03 20:07:48,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858792685] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:07:48,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:07:48,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 20:07:48,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722451286] [2024-06-03 20:07:48,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:07:48,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 20:07:48,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:07:48,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 20:07:48,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 20:07:48,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-03 20:07:48,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 350 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:07:48,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:07:48,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-03 20:07:48,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:07:49,458 INFO L124 PetriNetUnfolderBase]: 919/1436 cut-off events. [2024-06-03 20:07:49,458 INFO L125 PetriNetUnfolderBase]: For 1021/1031 co-relation queries the response was YES. [2024-06-03 20:07:49,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3911 conditions, 1436 events. 919/1436 cut-off events. For 1021/1031 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6214 event pairs, 388 based on Foata normal form. 10/1444 useless extension candidates. Maximal degree in co-relation 3882. Up to 1387 conditions per place. [2024-06-03 20:07:49,466 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 43 selfloop transitions, 17 changer transitions 0/65 dead transitions. [2024-06-03 20:07:49,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 65 transitions, 496 flow [2024-06-03 20:07:49,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:07:49,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:07:49,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2024-06-03 20:07:49,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-03 20:07:49,471 INFO L175 Difference]: Start difference. First operand has 66 places, 58 transitions, 350 flow. Second operand 6 states and 93 transitions. [2024-06-03 20:07:49,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 65 transitions, 496 flow [2024-06-03 20:07:49,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 65 transitions, 462 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-03 20:07:49,478 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 366 flow [2024-06-03 20:07:49,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=366, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2024-06-03 20:07:49,480 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 27 predicate places. [2024-06-03 20:07:49,480 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 366 flow [2024-06-03 20:07:49,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 20:07:49,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:07:49,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:07:49,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 20:07:49,481 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:07:49,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:07:49,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1497460536, now seen corresponding path program 3 times [2024-06-03 20:07:49,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:07:49,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909901297] [2024-06-03 20:07:49,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:07:49,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:07:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:07:53,335 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-03 20:07:53,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:07:53,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909901297] [2024-06-03 20:07:53,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909901297] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:07:53,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:07:53,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:07:53,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169168235] [2024-06-03 20:07:53,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:07:53,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:07:53,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:07:53,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:07:53,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:07:53,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-03 20:07:53,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 366 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 20:07:53,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:07:53,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-03 20:07:53,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:07:53,971 INFO L124 PetriNetUnfolderBase]: 920/1441 cut-off events. [2024-06-03 20:07:53,971 INFO L125 PetriNetUnfolderBase]: For 1060/1070 co-relation queries the response was YES. [2024-06-03 20:07:53,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3939 conditions, 1441 events. 920/1441 cut-off events. For 1060/1070 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6231 event pairs, 309 based on Foata normal form. 10/1449 useless extension candidates. Maximal degree in co-relation 3909. Up to 1356 conditions per place. [2024-06-03 20:07:53,978 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 48 selfloop transitions, 19 changer transitions 0/72 dead transitions. [2024-06-03 20:07:53,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 72 transitions, 548 flow [2024-06-03 20:07:53,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:07:53,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:07:53,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-03 20:07:53,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-03 20:07:53,980 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 366 flow. Second operand 6 states and 102 transitions. [2024-06-03 20:07:53,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 72 transitions, 548 flow [2024-06-03 20:07:53,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 72 transitions, 508 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-03 20:07:53,984 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 380 flow [2024-06-03 20:07:53,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=380, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2024-06-03 20:07:53,987 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2024-06-03 20:07:53,987 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 380 flow [2024-06-03 20:07:53,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 20:07:53,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:07:53,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:07:53,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 20:07:53,988 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:07:53,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:07:53,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1497467046, now seen corresponding path program 4 times [2024-06-03 20:07:53,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:07:53,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682320959] [2024-06-03 20:07:53,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:07:53,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:07:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 20:07:57,388 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-03 20:07:57,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 20:07:57,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682320959] [2024-06-03 20:07:57,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682320959] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 20:07:57,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 20:07:57,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 20:07:57,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246585548] [2024-06-03 20:07:57,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 20:07:57,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 20:07:57,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 20:07:57,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 20:07:57,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 20:07:57,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-06-03 20:07:57,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 380 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 20:07:57,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 20:07:57,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-06-03 20:07:57,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 20:07:58,040 INFO L124 PetriNetUnfolderBase]: 919/1441 cut-off events. [2024-06-03 20:07:58,040 INFO L125 PetriNetUnfolderBase]: For 1085/1095 co-relation queries the response was YES. [2024-06-03 20:07:58,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3952 conditions, 1441 events. 919/1441 cut-off events. For 1085/1095 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6245 event pairs, 217 based on Foata normal form. 10/1449 useless extension candidates. Maximal degree in co-relation 3921. Up to 1312 conditions per place. [2024-06-03 20:07:58,048 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 52 selfloop transitions, 20 changer transitions 0/77 dead transitions. [2024-06-03 20:07:58,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 77 transitions, 576 flow [2024-06-03 20:07:58,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 20:07:58,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 20:07:58,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2024-06-03 20:07:58,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-03 20:07:58,050 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 380 flow. Second operand 6 states and 105 transitions. [2024-06-03 20:07:58,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 77 transitions, 576 flow [2024-06-03 20:07:58,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 77 transitions, 527 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-03 20:07:58,053 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 384 flow [2024-06-03 20:07:58,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=384, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2024-06-03 20:07:58,054 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2024-06-03 20:07:58,054 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 384 flow [2024-06-03 20:07:58,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 0 states have call successors, (0), 0 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-03 20:07:58,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 20:07:58,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 20:07:58,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 20:07:58,055 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-03 20:07:58,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 20:07:58,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1493760459, now seen corresponding path program 1 times [2024-06-03 20:07:58,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 20:07:58,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680140783] [2024-06-03 20:07:58,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 20:07:58,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 20:07:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-03 20:07:58,071 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-03 20:07:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-03 20:07:58,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-03 20:07:58,143 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-03 20:07:58,144 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 6 remaining) [2024-06-03 20:07:58,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 6 remaining) [2024-06-03 20:07:58,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 6 remaining) [2024-06-03 20:07:58,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-06-03 20:07:58,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-06-03 20:07:58,148 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-06-03 20:07:58,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 20:07:58,148 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2024-06-03 20:07:58,152 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-03 20:07:58,152 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-03 20:07:58,183 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:58,187 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:58,189 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:58,189 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:58,189 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:58,189 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:58,189 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:58,190 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:58,194 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:58,195 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:58,195 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:58,195 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:58,195 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:58,195 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:58,195 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:58,195 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-03 20:07:58,198 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-06-03 20:07:58,209 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-06-03 20:07:58,209 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-06-03 20:07:58,224 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.06 08:07:58 BasicIcfg [2024-06-03 20:07:58,224 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-03 20:07:58,225 INFO L158 Benchmark]: Toolchain (without parser) took 27849.87ms. Allocated memory was 140.5MB in the beginning and 866.1MB in the end (delta: 725.6MB). Free memory was 96.9MB in the beginning and 316.9MB in the end (delta: -220.0MB). Peak memory consumption was 505.0MB. Max. memory is 16.1GB. [2024-06-03 20:07:58,225 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 115.3MB. Free memory was 66.1MB in the beginning and 66.0MB in the end (delta: 147.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 20:07:58,227 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 140.5MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 20:07:58,227 INFO L158 Benchmark]: CACSL2BoogieTranslator took 806.89ms. Allocated memory is still 140.5MB. Free memory was 96.9MB in the beginning and 92.9MB in the end (delta: 4.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-06-03 20:07:58,227 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.63ms. Allocated memory is still 140.5MB. Free memory was 92.9MB in the beginning and 89.6MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-03 20:07:58,227 INFO L158 Benchmark]: Boogie Preprocessor took 75.76ms. Allocated memory is still 140.5MB. Free memory was 89.6MB in the beginning and 85.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-03 20:07:58,228 INFO L158 Benchmark]: RCFGBuilder took 1160.18ms. Allocated memory was 140.5MB in the beginning and 195.0MB in the end (delta: 54.5MB). Free memory was 84.5MB in the beginning and 123.2MB in the end (delta: -38.7MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. [2024-06-03 20:07:58,228 INFO L158 Benchmark]: TraceAbstraction took 25715.98ms. Allocated memory was 195.0MB in the beginning and 866.1MB in the end (delta: 671.1MB). Free memory was 123.2MB in the beginning and 316.9MB in the end (delta: -193.7MB). Peak memory consumption was 477.4MB. Max. memory is 16.1GB. [2024-06-03 20:07:58,229 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 115.3MB. Free memory was 66.1MB in the beginning and 66.0MB in the end (delta: 147.8kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.16ms. Allocated memory is still 140.5MB. Free memory is still 110.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 806.89ms. Allocated memory is still 140.5MB. Free memory was 96.9MB in the beginning and 92.9MB in the end (delta: 4.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.63ms. Allocated memory is still 140.5MB. Free memory was 92.9MB in the beginning and 89.6MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.76ms. Allocated memory is still 140.5MB. Free memory was 89.6MB in the beginning and 85.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1160.18ms. Allocated memory was 140.5MB in the beginning and 195.0MB in the end (delta: 54.5MB). Free memory was 84.5MB in the beginning and 123.2MB in the end (delta: -38.7MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. * TraceAbstraction took 25715.98ms. Allocated memory was 195.0MB in the beginning and 866.1MB in the end (delta: 671.1MB). Free memory was 123.2MB in the beginning and 316.9MB in the end (delta: -193.7MB). Peak memory consumption was 477.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 843]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L730] 0 _Bool main$tmp_guard0; [L731] 0 _Bool main$tmp_guard1; [L733] 0 int x = 0; [L733] 0 int x = 0; [L734] 0 _Bool x$flush_delayed; [L735] 0 int x$mem_tmp; [L736] 0 _Bool x$r_buff0_thd0; [L737] 0 _Bool x$r_buff0_thd1; [L738] 0 _Bool x$r_buff0_thd2; [L739] 0 _Bool x$r_buff0_thd3; [L740] 0 _Bool x$r_buff1_thd0; [L741] 0 _Bool x$r_buff1_thd1; [L742] 0 _Bool x$r_buff1_thd2; [L743] 0 _Bool x$r_buff1_thd3; [L744] 0 _Bool x$read_delayed; [L745] 0 int *x$read_delayed_var; [L746] 0 int x$w_buff0; [L747] 0 _Bool x$w_buff0_used; [L748] 0 int x$w_buff1; [L749] 0 _Bool x$w_buff1_used; [L751] 0 int y = 0; [L752] 0 _Bool weak$$choice0; [L753] 0 _Bool weak$$choice1; [L754] 0 _Bool weak$$choice2; [L838] 0 pthread_t t2000; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L839] 0 //@ ghost multithreaded = 1; [L839] FCALL, FORK 0 pthread_create(&t2000, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2000=-3, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L840] 0 pthread_t t2001; [L841] 0 //@ assert ((((((((((((((((((((((((((((((((((((!multithreaded || (x$r_buff0_thd3 == (_Bool) 0)) && (!multithreaded || (x$w_buff1_used == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (x$w_buff0_used == (_Bool) 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$mem_tmp == 0))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EAX$read_delayed_var == 0) || ((((0 <= *__unbuffered_p1_EAX$read_delayed_var) && (*__unbuffered_p1_EAX$read_delayed_var <= 1)) && (__unbuffered_p1_EAX$read_delayed_var == &x)) && ((*__unbuffered_p1_EAX$read_delayed_var == 0) || (*__unbuffered_p1_EAX$read_delayed_var == 1)))))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$w_buff0 == 0))) && (!multithreaded || ((((0 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff0 == 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$w_buff1 == 0))) && (!multithreaded || (((0 <= x$mem_tmp) && (x$mem_tmp <= 1)) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))))) && (!multithreaded || (((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))); [L841] 0 x [L841] 0 x [L841] 0 x [L841] 0 x [L841] 0 __unbuffered_p1_EAX$read_delayed_var [L841] 0 __unbuffered_p1_EAX$read_delayed_var [L841] 0 __unbuffered_p1_EAX$read_delayed_var [L841] 0 __unbuffered_p1_EAX$read_delayed_var [L841] FCALL, FORK 0 pthread_create(&t2001, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2000=-3, t2001=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L841] 0 x [L841] 0 x [L841] 0 x [L841] 0 x [L841] 0 __unbuffered_p1_EAX$read_delayed_var [L841] 0 __unbuffered_p1_EAX$read_delayed_var [L841] 0 __unbuffered_p1_EAX$read_delayed_var [L841] 0 __unbuffered_p1_EAX$read_delayed_var [L842] 0 pthread_t t2002; [L778] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L779] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L780] 2 x$flush_delayed = weak$$choice2 [L781] EXPR 2 \read(x) [L781] 2 x$mem_tmp = x [L782] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L782] EXPR 2 \read(x) [L782] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L782] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L783] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L784] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L785] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L786] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L787] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L788] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L789] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L790] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L791] EXPR 2 \read(x) [L791] 2 __unbuffered_p1_EAX = x [L792] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L792] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L792] 2 x = x$flush_delayed ? x$mem_tmp : x [L793] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L843] 0 //@ assert ((((((((((((((((((((((((((((((((((((!multithreaded || (x$r_buff0_thd3 == (_Bool) 0)) && (!multithreaded || (x$w_buff1_used == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (x$w_buff0_used == (_Bool) 0))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$mem_tmp == 0))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff1_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$flush_delayed == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd3 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EAX$read_delayed_var == 0) || ((((0 <= *__unbuffered_p1_EAX$read_delayed_var) && (*__unbuffered_p1_EAX$read_delayed_var <= 1)) && (__unbuffered_p1_EAX$read_delayed_var == &x)) && ((*__unbuffered_p1_EAX$read_delayed_var == 0) || (*__unbuffered_p1_EAX$read_delayed_var == 1)))))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (x$w_buff0 == 0))) && (!multithreaded || ((((0 <= y) && (y <= 2)) && (y <= 127)) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff0_used == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 2)) && (__unbuffered_p0_EAX <= 127)) && (((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)) || (__unbuffered_p0_EAX == 2))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff1 == 0))) && (!multithreaded || (__unbuffered_p1_EAX$w_buff0 == 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$w_buff1 == 0))) && (!multithreaded || (((0 <= x$mem_tmp) && (x$mem_tmp <= 1)) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))))) && (!multithreaded || (((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))))) && (!multithreaded || (__unbuffered_p1_EAX$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2000=-3, t2001=-2, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] - UnprovableResult [Line: 841]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 843]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 64 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 25.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 243 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 193 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1287 IncrementalHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 9 mSDtfsCounter, 1287 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=384occurred in iteration=7, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 20.3s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 9069 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-03 20:07:58,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE