./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix009.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix009.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2cc22fce Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix009.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix009.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-2cc22fc-m [2024-07-22 20:56:20,222 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-07-22 20:56:20,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-07-22 20:56:20,293 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-07-22 20:56:20,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-07-22 20:56:20,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-07-22 20:56:20,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-07-22 20:56:20,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-07-22 20:56:20,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-07-22 20:56:20,322 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-07-22 20:56:20,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-07-22 20:56:20,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-07-22 20:56:20,323 INFO L153 SettingsManager]: * Use SBE=true [2024-07-22 20:56:20,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-07-22 20:56:20,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-07-22 20:56:20,324 INFO L153 SettingsManager]: * sizeof long=4 [2024-07-22 20:56:20,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-07-22 20:56:20,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-07-22 20:56:20,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-07-22 20:56:20,325 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-07-22 20:56:20,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-07-22 20:56:20,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-07-22 20:56:20,326 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-07-22 20:56:20,326 INFO L153 SettingsManager]: * sizeof long double=12 [2024-07-22 20:56:20,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-07-22 20:56:20,327 INFO L153 SettingsManager]: * Use constant arrays=true [2024-07-22 20:56:20,327 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-07-22 20:56:20,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-07-22 20:56:20,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-07-22 20:56:20,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-07-22 20:56:20,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-07-22 20:56:20,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-07-22 20:56:20,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-07-22 20:56:20,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-07-22 20:56:20,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-07-22 20:56:20,329 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-07-22 20:56:20,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-07-22 20:56:20,330 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-07-22 20:56:20,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-07-22 20:56:20,330 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-07-22 20:56:20,330 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-07-22 20:56:20,330 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-07-22 20:56:20,330 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-07-22 20:56:20,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-07-22 20:56:20,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-07-22 20:56:20,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-07-22 20:56:20,630 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-07-22 20:56:20,631 INFO L274 PluginConnector]: Witness Parser initialized [2024-07-22 20:56:20,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/mix009.oepc.yml/witness.yml [2024-07-22 20:56:20,754 INFO L270 PluginConnector]: Initializing CDTParser... [2024-07-22 20:56:20,754 INFO L274 PluginConnector]: CDTParser initialized [2024-07-22 20:56:20,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix009.oepc.i [2024-07-22 20:56:21,754 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-07-22 20:56:21,914 INFO L384 CDTParser]: Found 1 translation units. [2024-07-22 20:56:21,915 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009.oepc.i [2024-07-22 20:56:21,927 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/a53e40bcd/57ddb4747f85439bb7617cfc537691ea/FLAG3b504c0c7 [2024-07-22 20:56:21,944 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/a53e40bcd/57ddb4747f85439bb7617cfc537691ea [2024-07-22 20:56:21,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-07-22 20:56:21,945 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-07-22 20:56:21,946 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-07-22 20:56:21,946 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-07-22 20:56:21,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-07-22 20:56:21,953 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 22.07 08:56:20" (1/2) ... [2024-07-22 20:56:21,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79479ab6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 22.07 08:56:21, skipping insertion in model container [2024-07-22 20:56:21,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 22.07 08:56:20" (1/2) ... [2024-07-22 20:56:21,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1df5ba1c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 22.07 08:56:21, skipping insertion in model container [2024-07-22 20:56:21,955 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 08:56:21" (2/2) ... [2024-07-22 20:56:21,956 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79479ab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:56:21, skipping insertion in model container [2024-07-22 20:56:21,956 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 08:56:21" (2/2) ... [2024-07-22 20:56:21,956 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-07-22 20:56:22,008 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-07-22 20:56:22,009 INFO L97 edCorrectnessWitness]: Location invariant before [L826-L826] (((((((((((((((((! multithreaded || z$r_buff0_thd2 == (_Bool)0) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || (z$mem_tmp == 0 || z$mem_tmp == 1))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || (((((((((((((((((0 <= __unbuffered_cnt && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 1))) && (! multithreaded || (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 1))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-07-22 20:56:22,009 INFO L97 edCorrectnessWitness]: Location invariant before [L825-L825] (((((((((((((((((! multithreaded || z$r_buff0_thd2 == (_Bool)0) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || (z$mem_tmp == 0 || z$mem_tmp == 1))) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || (((((((((((((((((0 <= __unbuffered_cnt && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (z$w_buff0 == 0 || z$w_buff0 == 1))) && (! multithreaded || (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) && (! multithreaded || (z$w_buff1 == 0 || z$w_buff1 == 1))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-07-22 20:56:22,009 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-07-22 20:56:22,010 INFO L106 edCorrectnessWitness]: ghost_update [L823-L823] multithreaded = 1; [2024-07-22 20:56:22,047 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-07-22 20:56:22,199 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009.oepc.i[945,958] [2024-07-22 20:56:22,370 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-07-22 20:56:22,378 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-07-22 20:56:22,407 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009.oepc.i[945,958] Start Parsing Local Start Parsing Local Start Parsing Local [2024-07-22 20:56:22,463 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-07-22 20:56:22,496 INFO L206 MainTranslator]: Completed translation [2024-07-22 20:56:22,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:56:22 WrapperNode [2024-07-22 20:56:22,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-07-22 20:56:22,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-07-22 20:56:22,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-07-22 20:56:22,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-07-22 20:56:22,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:56:22" (1/1) ... [2024-07-22 20:56:22,514 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:56:22" (1/1) ... [2024-07-22 20:56:22,542 INFO L138 Inliner]: procedures = 174, calls = 39, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 118 [2024-07-22 20:56:22,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-07-22 20:56:22,547 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-07-22 20:56:22,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-07-22 20:56:22,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-07-22 20:56:22,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:56:22" (1/1) ... [2024-07-22 20:56:22,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:56:22" (1/1) ... [2024-07-22 20:56:22,560 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:56:22" (1/1) ... [2024-07-22 20:56:22,560 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:56:22" (1/1) ... [2024-07-22 20:56:22,570 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:56:22" (1/1) ... [2024-07-22 20:56:22,572 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:56:22" (1/1) ... [2024-07-22 20:56:22,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:56:22" (1/1) ... [2024-07-22 20:56:22,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:56:22" (1/1) ... [2024-07-22 20:56:22,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-07-22 20:56:22,586 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-07-22 20:56:22,586 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-07-22 20:56:22,586 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-07-22 20:56:22,613 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:56:22" (1/1) ... [2024-07-22 20:56:22,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-07-22 20:56:22,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-22 20:56:22,662 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-07-22 20:56:22,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-07-22 20:56:22,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-07-22 20:56:22,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-07-22 20:56:22,695 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-07-22 20:56:22,695 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-07-22 20:56:22,695 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-07-22 20:56:22,695 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-07-22 20:56:22,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-07-22 20:56:22,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-07-22 20:56:22,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-07-22 20:56:22,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-07-22 20:56:22,697 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-07-22 20:56:22,820 INFO L244 CfgBuilder]: Building ICFG [2024-07-22 20:56:22,822 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-07-22 20:56:23,054 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-07-22 20:56:23,055 INFO L293 CfgBuilder]: Performing block encoding [2024-07-22 20:56:23,181 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-07-22 20:56:23,181 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-07-22 20:56:23,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 08:56:23 BoogieIcfgContainer [2024-07-22 20:56:23,187 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-07-22 20:56:23,189 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-07-22 20:56:23,189 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-07-22 20:56:23,192 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-07-22 20:56:23,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 22.07 08:56:20" (1/4) ... [2024-07-22 20:56:23,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7612bae5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 22.07 08:56:23, skipping insertion in model container [2024-07-22 20:56:23,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 08:56:21" (2/4) ... [2024-07-22 20:56:23,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7612bae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 08:56:23, skipping insertion in model container [2024-07-22 20:56:23,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:56:22" (3/4) ... [2024-07-22 20:56:23,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7612bae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 08:56:23, skipping insertion in model container [2024-07-22 20:56:23,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 08:56:23" (4/4) ... [2024-07-22 20:56:23,194 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009.oepc.i [2024-07-22 20:56:23,207 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-07-22 20:56:23,208 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-07-22 20:56:23,208 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-07-22 20:56:23,242 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-07-22 20:56:23,274 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-22 20:56:23,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-07-22 20:56:23,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-22 20:56:23,276 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-07-22 20:56:23,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-07-22 20:56:23,301 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-07-22 20:56:23,311 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-07-22 20:56:23,318 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=PARTIAL_ORDER_FA, 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;@5f2a4fa8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-22 20:56:23,318 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-07-22 20:56:23,399 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-07-22 20:56:23,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 20:56:23,404 INFO L85 PathProgramCache]: Analyzing trace with hash 319772151, now seen corresponding path program 1 times [2024-07-22 20:56:23,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 20:56:23,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077443141] [2024-07-22 20:56:23,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 20:56:23,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 20:56:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 20:56:24,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 20:56:24,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 20:56:24,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077443141] [2024-07-22 20:56:24,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077443141] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-22 20:56:24,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-22 20:56:24,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-07-22 20:56:24,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132887582] [2024-07-22 20:56:24,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-22 20:56:24,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-07-22 20:56:24,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 20:56:24,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-07-22 20:56:24,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-07-22 20:56:24,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 20:56:24,105 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 20:56:24,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-07-22 20:56:24,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 20:56:24,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-22 20:56:24,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-07-22 20:56:24,250 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-07-22 20:56:24,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 20:56:24,251 INFO L85 PathProgramCache]: Analyzing trace with hash -602184754, now seen corresponding path program 1 times [2024-07-22 20:56:24,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 20:56:24,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469590107] [2024-07-22 20:56:24,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 20:56:24,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 20:56:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 20:56:26,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 20:56:26,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 20:56:26,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469590107] [2024-07-22 20:56:26,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469590107] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-22 20:56:26,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-22 20:56:26,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-07-22 20:56:26,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846410038] [2024-07-22 20:56:26,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-22 20:56:26,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-07-22 20:56:26,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 20:56:26,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-07-22 20:56:26,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-07-22 20:56:26,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 20:56:26,100 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 20:56:26,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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-07-22 20:56:26,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-22 20:56:26,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 20:56:26,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-22 20:56:26,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-07-22 20:56:26,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-07-22 20:56:26,447 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-07-22 20:56:26,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 20:56:26,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1597455995, now seen corresponding path program 1 times [2024-07-22 20:56:26,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 20:56:26,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122546388] [2024-07-22 20:56:26,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 20:56:26,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 20:56:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 20:56:26,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 20:56:26,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 20:56:26,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122546388] [2024-07-22 20:56:26,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122546388] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-22 20:56:26,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-22 20:56:26,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-07-22 20:56:26,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563079155] [2024-07-22 20:56:26,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-22 20:56:26,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-07-22 20:56:26,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 20:56:26,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-07-22 20:56:26,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-07-22 20:56:26,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 20:56:26,580 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 20:56:26,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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-07-22 20:56:26,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-22 20:56:26,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-07-22 20:56:26,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 20:56:26,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-22 20:56:26,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-07-22 20:56:26,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-07-22 20:56:26,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-07-22 20:56:26,706 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-07-22 20:56:26,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 20:56:26,706 INFO L85 PathProgramCache]: Analyzing trace with hash 2114661228, now seen corresponding path program 1 times [2024-07-22 20:56:26,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 20:56:26,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133835390] [2024-07-22 20:56:26,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 20:56:26,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 20:56:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 20:56:26,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 20:56:26,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 20:56:26,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133835390] [2024-07-22 20:56:26,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133835390] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-22 20:56:26,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-22 20:56:26,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-07-22 20:56:26,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526976322] [2024-07-22 20:56:26,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-22 20:56:26,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-07-22 20:56:26,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 20:56:26,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-07-22 20:56:26,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-07-22 20:56:26,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 20:56:26,896 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 20:56:26,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-07-22 20:56:26,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-22 20:56:26,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-07-22 20:56:26,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-07-22 20:56:26,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 20:56:27,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-22 20:56:27,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-07-22 20:56:27,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-07-22 20:56:27,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-22 20:56:27,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-07-22 20:56:27,409 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-07-22 20:56:27,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 20:56:27,410 INFO L85 PathProgramCache]: Analyzing trace with hash 958691532, now seen corresponding path program 1 times [2024-07-22 20:56:27,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 20:56:27,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158097034] [2024-07-22 20:56:27,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 20:56:27,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 20:56:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 20:56:28,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 20:56:28,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 20:56:28,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158097034] [2024-07-22 20:56:28,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158097034] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-22 20:56:28,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-22 20:56:28,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-07-22 20:56:28,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802960525] [2024-07-22 20:56:28,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-22 20:56:28,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-07-22 20:56:28,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 20:56:28,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-07-22 20:56:28,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-07-22 20:56:28,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 20:56:28,053 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 20:56:28,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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-07-22 20:56:28,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-22 20:56:28,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-07-22 20:56:28,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-07-22 20:56:28,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-22 20:56:28,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 20:56:28,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-22 20:56:28,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-07-22 20:56:28,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-07-22 20:56:28,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-22 20:56:28,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-07-22 20:56:28,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-07-22 20:56:28,436 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-07-22 20:56:28,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 20:56:28,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1552993644, now seen corresponding path program 2 times [2024-07-22 20:56:28,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 20:56:28,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871609632] [2024-07-22 20:56:28,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 20:56:28,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 20:56:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 20:56:28,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 20:56:28,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 20:56:28,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871609632] [2024-07-22 20:56:28,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871609632] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-22 20:56:28,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-22 20:56:28,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-07-22 20:56:28,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691101641] [2024-07-22 20:56:28,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-22 20:56:28,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-07-22 20:56:28,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 20:56:28,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-07-22 20:56:28,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-07-22 20:56:28,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 20:56:28,624 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 20:56:28,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-07-22 20:56:28,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-22 20:56:28,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-07-22 20:56:28,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-07-22 20:56:28,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-22 20:56:28,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-07-22 20:56:28,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 20:56:28,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-22 20:56:28,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-07-22 20:56:28,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-07-22 20:56:28,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-22 20:56:28,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-07-22 20:56:28,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-07-22 20:56:28,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-07-22 20:56:28,809 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-07-22 20:56:28,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 20:56:28,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1139303401, now seen corresponding path program 1 times [2024-07-22 20:56:28,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 20:56:28,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755046698] [2024-07-22 20:56:28,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 20:56:28,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 20:56:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 20:56:29,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 20:56:29,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 20:56:29,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755046698] [2024-07-22 20:56:29,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755046698] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-22 20:56:29,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-22 20:56:29,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-07-22 20:56:29,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816481456] [2024-07-22 20:56:29,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-22 20:56:29,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-07-22 20:56:29,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 20:56:29,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-07-22 20:56:29,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-07-22 20:56:29,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 20:56:29,236 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 20:56:29,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-07-22 20:56:29,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-22 20:56:29,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-07-22 20:56:29,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-07-22 20:56:29,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-07-22 20:56:29,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-07-22 20:56:29,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-07-22 20:56:29,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 20:56:29,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-22 20:56:29,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-07-22 20:56:29,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-07-22 20:56:29,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-07-22 20:56:29,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-07-22 20:56:29,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-07-22 20:56:29,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-07-22 20:56:29,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-07-22 20:56:29,527 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-07-22 20:56:29,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 20:56:29,528 INFO L85 PathProgramCache]: Analyzing trace with hash 418068934, now seen corresponding path program 3 times [2024-07-22 20:56:29,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 20:56:29,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946848971] [2024-07-22 20:56:29,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 20:56:29,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 20:56:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-07-22 20:56:29,557 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-07-22 20:56:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-07-22 20:56:29,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-07-22 20:56:29,599 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-07-22 20:56:29,600 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-07-22 20:56:29,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-07-22 20:56:29,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-07-22 20:56:29,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-07-22 20:56:29,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-07-22 20:56:29,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-07-22 20:56:29,606 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2024-07-22 20:56:29,607 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2024-07-22 20:56:29,610 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-07-22 20:56:29,610 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-07-22 20:56:29,671 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-07-22 20:56:29,671 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-07-22 20:56:29,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 08:56:29 BasicIcfg [2024-07-22 20:56:29,672 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-07-22 20:56:29,672 INFO L158 Benchmark]: Toolchain (without parser) took 7726.95ms. Allocated memory was 167.8MB in the beginning and 297.8MB in the end (delta: 130.0MB). Free memory was 127.2MB in the beginning and 164.5MB in the end (delta: -37.3MB). Peak memory consumption was 91.9MB. Max. memory is 16.1GB. [2024-07-22 20:56:29,673 INFO L158 Benchmark]: Witness Parser took 0.23ms. Allocated memory is still 104.9MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-07-22 20:56:29,673 INFO L158 Benchmark]: CDTParser took 0.75ms. Allocated memory is still 104.9MB. Free memory is still 68.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-07-22 20:56:29,673 INFO L158 Benchmark]: CACSL2BoogieTranslator took 551.07ms. Allocated memory is still 167.8MB. Free memory was 126.6MB in the beginning and 92.8MB in the end (delta: 33.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-07-22 20:56:29,673 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.46ms. Allocated memory is still 167.8MB. Free memory was 92.8MB in the beginning and 89.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-07-22 20:56:29,673 INFO L158 Benchmark]: Boogie Preprocessor took 38.49ms. Allocated memory is still 167.8MB. Free memory was 89.5MB in the beginning and 87.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-07-22 20:56:29,674 INFO L158 Benchmark]: RCFGBuilder took 601.38ms. Allocated memory is still 167.8MB. Free memory was 87.4MB in the beginning and 84.6MB in the end (delta: 2.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-07-22 20:56:29,674 INFO L158 Benchmark]: TraceAbstraction took 6482.96ms. Allocated memory was 167.8MB in the beginning and 297.8MB in the end (delta: 130.0MB). Free memory was 83.7MB in the beginning and 164.5MB in the end (delta: -80.8MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB. [2024-07-22 20:56:29,675 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.23ms. Allocated memory is still 104.9MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.75ms. Allocated memory is still 104.9MB. Free memory is still 68.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 551.07ms. Allocated memory is still 167.8MB. Free memory was 126.6MB in the beginning and 92.8MB in the end (delta: 33.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.46ms. Allocated memory is still 167.8MB. Free memory was 92.8MB in the beginning and 89.5MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.49ms. Allocated memory is still 167.8MB. Free memory was 89.5MB in the beginning and 87.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 601.38ms. Allocated memory is still 167.8MB. Free memory was 87.4MB in the beginning and 84.6MB in the end (delta: 2.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6482.96ms. Allocated memory was 167.8MB in the beginning and 297.8MB in the end (delta: 130.0MB). Free memory was 83.7MB in the beginning and 164.5MB in the end (delta: -80.8MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2786, independent: 2377, independent conditional: 1971, independent unconditional: 406, dependent: 409, dependent conditional: 363, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2593, independent: 2377, independent conditional: 1971, independent unconditional: 406, dependent: 216, dependent conditional: 170, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2593, independent: 2377, independent conditional: 1971, independent unconditional: 406, dependent: 216, dependent conditional: 170, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3385, independent: 2377, independent conditional: 139, independent unconditional: 2238, dependent: 1008, dependent conditional: 653, dependent unconditional: 355, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3385, independent: 2377, independent conditional: 139, independent unconditional: 2238, dependent: 1008, dependent conditional: 360, dependent unconditional: 648, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3385, independent: 2377, independent conditional: 139, independent unconditional: 2238, dependent: 1008, dependent conditional: 360, dependent unconditional: 648, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 511, independent: 424, independent conditional: 13, independent unconditional: 411, dependent: 87, dependent conditional: 38, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 511, independent: 387, independent conditional: 0, independent unconditional: 387, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 124, independent: 37, independent conditional: 13, independent unconditional: 24, dependent: 87, dependent conditional: 38, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 124, independent: 37, independent conditional: 13, independent unconditional: 24, dependent: 87, dependent conditional: 38, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 650, independent: 224, independent conditional: 80, independent unconditional: 144, dependent: 426, dependent conditional: 190, dependent unconditional: 235, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3385, independent: 1953, independent conditional: 126, independent unconditional: 1827, dependent: 921, dependent conditional: 322, dependent unconditional: 599, unknown: 511, unknown conditional: 51, unknown unconditional: 460] , Statistics on independence cache: Total cache size (in pairs): 511, Positive cache size: 424, Positive conditional cache size: 13, Positive unconditional cache size: 411, Negative cache size: 87, Negative conditional cache size: 38, Negative unconditional cache size: 49, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 293, Maximal queried relation: 5, Independence queries for same thread: 193 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.4s, Number of persistent set computation: 192, Number of trivial persistent sets: 131, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 452, independent: 406, independent conditional: 0, independent unconditional: 406, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2786, independent: 2377, independent conditional: 1971, independent unconditional: 406, dependent: 409, dependent conditional: 363, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2593, independent: 2377, independent conditional: 1971, independent unconditional: 406, dependent: 216, dependent conditional: 170, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2593, independent: 2377, independent conditional: 1971, independent unconditional: 406, dependent: 216, dependent conditional: 170, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3385, independent: 2377, independent conditional: 139, independent unconditional: 2238, dependent: 1008, dependent conditional: 653, dependent unconditional: 355, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3385, independent: 2377, independent conditional: 139, independent unconditional: 2238, dependent: 1008, dependent conditional: 360, dependent unconditional: 648, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3385, independent: 2377, independent conditional: 139, independent unconditional: 2238, dependent: 1008, dependent conditional: 360, dependent unconditional: 648, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 511, independent: 424, independent conditional: 13, independent unconditional: 411, dependent: 87, dependent conditional: 38, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 511, independent: 387, independent conditional: 0, independent unconditional: 387, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 124, independent: 37, independent conditional: 13, independent unconditional: 24, dependent: 87, dependent conditional: 38, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 124, independent: 37, independent conditional: 13, independent unconditional: 24, dependent: 87, dependent conditional: 38, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 650, independent: 224, independent conditional: 80, independent unconditional: 144, dependent: 426, dependent conditional: 190, dependent unconditional: 235, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3385, independent: 1953, independent conditional: 126, independent unconditional: 1827, dependent: 921, dependent conditional: 322, dependent unconditional: 599, unknown: 511, unknown conditional: 51, unknown unconditional: 460] , Statistics on independence cache: Total cache size (in pairs): 511, Positive cache size: 424, Positive conditional cache size: 13, Positive unconditional cache size: 411, Negative cache size: 87, Negative conditional cache size: 38, Negative unconditional cache size: 49, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 293, Maximal queried relation: 5, Independence queries for same thread: 193 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p0_EBX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$read_delayed; [L734] 0 int *z$read_delayed_var; [L735] 0 int z$w_buff0; [L736] 0 _Bool z$w_buff0_used; [L737] 0 int z$w_buff1; [L738] 0 _Bool z$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L822] 0 pthread_t t241; [L823] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t241=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] FCALL, FORK 0 pthread_create(&t241, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t241=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L824] 0 pthread_t t242; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t241=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L825] 0 //@ assert ((((((((((((((((((!multithreaded || (z$r_buff0_thd2 == (_Bool) 0)) && (!multithreaded || (z$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (z$read_delayed == (_Bool) 0))) && (!multithreaded || ((z$mem_tmp == 0) || (z$mem_tmp == 1)))) && (!multithreaded || ((z == 0) || (z == 1)))) && (!multithreaded || ((((((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool) 0)) && (z$r_buff0_thd0 == (_Bool) 0)) && (z$r_buff0_thd2 == (_Bool) 0)) && (z$r_buff1_thd0 == (_Bool) 0)) && (z$r_buff1_thd2 == (_Bool) 0)) && (z$read_delayed == (_Bool) 0)) && (z$read_delayed_var == 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((z == 0) || (z == 1))) && ((z$mem_tmp == 0) || (z$mem_tmp == 1))) && ((z$w_buff0 == 0) || (z$w_buff0 == 1))) && ((z$w_buff1 == 0) || (z$w_buff1 == 1))))) && (!multithreaded || (z$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || ((z$w_buff0 == 0) || (z$w_buff0 == 1)))) && (!multithreaded || ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1)))) && (!multithreaded || ((z$w_buff1 == 0) || (z$w_buff1 == 1)))) && (!multithreaded || (z$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || (z$read_delayed_var == 0))) && (!multithreaded || (0 <= __unbuffered_cnt))); [L825] FCALL, FORK 0 pthread_create(&t242, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t241=-1, t242=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L826] 0 //@ assert ((((((((((((((((((!multithreaded || (z$r_buff0_thd2 == (_Bool) 0)) && (!multithreaded || (z$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (z$read_delayed == (_Bool) 0))) && (!multithreaded || ((z$mem_tmp == 0) || (z$mem_tmp == 1)))) && (!multithreaded || ((z == 0) || (z == 1)))) && (!multithreaded || ((((((((((((((((((0 <= __unbuffered_cnt) && (z$flush_delayed == (_Bool) 0)) && (z$r_buff0_thd0 == (_Bool) 0)) && (z$r_buff0_thd2 == (_Bool) 0)) && (z$r_buff1_thd0 == (_Bool) 0)) && (z$r_buff1_thd2 == (_Bool) 0)) && (z$read_delayed == (_Bool) 0)) && (z$read_delayed_var == 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((z == 0) || (z == 1))) && ((z$mem_tmp == 0) || (z$mem_tmp == 1))) && ((z$w_buff0 == 0) || (z$w_buff0 == 1))) && ((z$w_buff1 == 0) || (z$w_buff1 == 1))))) && (!multithreaded || (z$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || ((z$w_buff0 == 0) || (z$w_buff0 == 1)))) && (!multithreaded || ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1)))) && (!multithreaded || ((z$w_buff1 == 0) || (z$w_buff1 == 1)))) && (!multithreaded || (z$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || (z$read_delayed_var == 0))) && (!multithreaded || (0 <= __unbuffered_cnt))); VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t241=-1, t242=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L744] 1 z$w_buff1 = z$w_buff0 [L745] 1 z$w_buff0 = 1 [L746] 1 z$w_buff1_used = z$w_buff0_used [L747] 1 z$w_buff0_used = (_Bool)1 [L748] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L748] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L749] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L750] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L751] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L758] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L761] 1 __unbuffered_p0_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L785] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L786] 2 z$flush_delayed = weak$$choice2 [L787] 2 z$mem_tmp = z [L788] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L789] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L790] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L791] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L792] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L794] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L795] 2 __unbuffered_p1_EBX = z [L796] 2 z = z$flush_delayed ? z$mem_tmp : z [L797] 2 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L801] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L802] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L803] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L804] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L807] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L809] 2 return 0; [L764] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L765] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L766] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L768] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t241=-1, t242=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L832] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L833] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L834] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L835] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t241=-1, t242=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L838] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t241=-1, t242=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L840] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 825]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 823]: 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: 825]: 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 for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 58 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 2.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 40, 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, 3.8s InterpolantComputationTime, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 2515 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-07-22 20:56:29,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-07-22 20:56:29,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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