./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-09-02_08-21-23.files/protection-ghost/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a4c57e3 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i ./goblint.2024-09-02_08-21-23.files/protection-ghost/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-4a4c57e-m [2024-09-08 13:51:01,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-08 13:51:01,394 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-09-08 13:51:01,398 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-08 13:51:01,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-08 13:51:01,423 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-08 13:51:01,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-08 13:51:01,424 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-08 13:51:01,425 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-08 13:51:01,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-08 13:51:01,426 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-08 13:51:01,426 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-08 13:51:01,426 INFO L153 SettingsManager]: * Use SBE=true [2024-09-08 13:51:01,427 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-08 13:51:01,428 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-08 13:51:01,428 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-08 13:51:01,429 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-08 13:51:01,429 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-08 13:51:01,429 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-08 13:51:01,429 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-08 13:51:01,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-08 13:51:01,433 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-08 13:51:01,433 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-08 13:51:01,433 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-08 13:51:01,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-08 13:51:01,433 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-08 13:51:01,434 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-08 13:51:01,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-08 13:51:01,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-08 13:51:01,435 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-08 13:51:01,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 13:51:01,436 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-08 13:51:01,436 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-08 13:51:01,436 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-08 13:51:01,436 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-08 13:51:01,436 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-08 13:51:01,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-08 13:51:01,437 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-08 13:51:01,437 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-08 13:51:01,437 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-08 13:51:01,437 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-08 13:51:01,438 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: Positions where we compute the Hoare Annotation -> None Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-09-08 13:51:01,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-08 13:51:01,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-08 13:51:01,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-08 13:51:01,671 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-08 13:51:01,671 INFO L274 PluginConnector]: CDTParser initialized [2024-09-08 13:51:01,672 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-09-08 13:51:02,959 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-08 13:51:03,154 INFO L384 CDTParser]: Found 1 translation units. [2024-09-08 13:51:03,155 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-09-08 13:51:03,171 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5821624f7/ba3e63dac3f74b64aa03ec9926ff432e/FLAG605a6bbbd [2024-09-08 13:51:03,520 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5821624f7/ba3e63dac3f74b64aa03ec9926ff432e [2024-09-08 13:51:03,522 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-08 13:51:03,523 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-08 13:51:03,524 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-09-02_08-21-23.files/protection-ghost/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.yml/witness.yml [2024-09-08 13:51:03,599 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-08 13:51:03,600 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-08 13:51:03,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-08 13:51:03,601 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-08 13:51:03,611 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-08 13:51:03,611 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:51:03" (1/2) ... [2024-09-08 13:51:03,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@284867f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:51:03, skipping insertion in model container [2024-09-08 13:51:03,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:51:03" (1/2) ... [2024-09-08 13:51:03,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@616bbfb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:51:03, skipping insertion in model container [2024-09-08 13:51:03,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 01:51:03" (2/2) ... [2024-09-08 13:51:03,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@284867f4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 01:51:03, skipping insertion in model container [2024-09-08 13:51:03,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 01:51:03" (2/2) ... [2024-09-08 13:51:03,666 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-08 13:51:03,673 INFO L1541 ArrayList]: Location invariant before [L796-L796] (((((((((((((! multithreaded || x$read_delayed_var == 0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 2))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) [2024-09-08 13:51:03,674 INFO L1541 ArrayList]: Location invariant before [L795-L795] (((((((((((((! multithreaded || x$read_delayed_var == 0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 2))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) [2024-09-08 13:51:03,674 INFO L1541 ArrayList]: ghost_variable multithreaded = 0 [2024-09-08 13:51:03,674 INFO L1541 ArrayList]: ghost_update [L793-L793] multithreaded = 1; [2024-09-08 13:51:03,710 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-08 13:51:03,882 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2024-09-08 13:51:03,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 13:51:03,998 INFO L200 MainTranslator]: Completed pre-run Start Parsing Local [2024-09-08 13:51:04,028 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] Start Parsing Local Start Parsing Local Start Parsing Local [2024-09-08 13:51:04,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 13:51:04,116 INFO L204 MainTranslator]: Completed translation [2024-09-08 13:51:04,116 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 01:51:04 WrapperNode [2024-09-08 13:51:04,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-08 13:51:04,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-08 13:51:04,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-08 13:51:04,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-08 13:51:04,123 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 01:51:04" (1/1) ... [2024-09-08 13:51:04,133 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 01:51:04" (1/1) ... [2024-09-08 13:51:04,161 INFO L138 Inliner]: procedures = 174, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2024-09-08 13:51:04,161 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-08 13:51:04,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-08 13:51:04,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-08 13:51:04,162 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-08 13:51:04,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 01:51:04" (1/1) ... [2024-09-08 13:51:04,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 01:51:04" (1/1) ... [2024-09-08 13:51:04,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 01:51:04" (1/1) ... [2024-09-08 13:51:04,180 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 01:51:04" (1/1) ... [2024-09-08 13:51:04,191 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 01:51:04" (1/1) ... [2024-09-08 13:51:04,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 01:51:04" (1/1) ... [2024-09-08 13:51:04,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 01:51:04" (1/1) ... [2024-09-08 13:51:04,202 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 01:51:04" (1/1) ... [2024-09-08 13:51:04,205 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-08 13:51:04,206 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-08 13:51:04,206 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-08 13:51:04,206 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-08 13:51:04,207 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 01:51:04" (1/1) ... [2024-09-08 13:51:04,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 13:51:04,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 13:51:04,235 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-09-08 13:51:04,249 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-09-08 13:51:04,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-09-08 13:51:04,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-08 13:51:04,288 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-09-08 13:51:04,288 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-09-08 13:51:04,288 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-09-08 13:51:04,288 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-09-08 13:51:04,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-08 13:51:04,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-09-08 13:51:04,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-08 13:51:04,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-08 13:51:04,290 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-08 13:51:04,417 INFO L242 CfgBuilder]: Building ICFG [2024-09-08 13:51:04,421 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-08 13:51:04,749 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-08 13:51:04,750 INFO L291 CfgBuilder]: Performing block encoding [2024-09-08 13:51:04,872 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-08 13:51:04,872 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-08 13:51:04,873 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:51:04 BoogieIcfgContainer [2024-09-08 13:51:04,874 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-08 13:51:04,876 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-08 13:51:04,876 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-08 13:51:04,879 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-08 13:51:04,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:51:03" (1/4) ... [2024-09-08 13:51:04,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6583156a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:51:04, skipping insertion in model container [2024-09-08 13:51:04,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 01:51:03" (2/4) ... [2024-09-08 13:51:04,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6583156a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 08.09 01:51:04, skipping insertion in model container [2024-09-08 13:51:04,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 01:51:04" (3/4) ... [2024-09-08 13:51:04,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6583156a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 08.09 01:51:04, skipping insertion in model container [2024-09-08 13:51:04,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:51:04" (4/4) ... [2024-09-08 13:51:04,882 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-09-08 13:51:04,896 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-08 13:51:04,896 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-09-08 13:51:04,897 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-08 13:51:04,930 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 13:51:04,968 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 13:51:04,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 13:51:04,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 13:51:04,973 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-09-08 13:51:04,974 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-09-08 13:51:04,996 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 13:51:05,005 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-08 13:51:05,010 INFO L336 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@3254293b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 13:51:05,010 INFO L337 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-09-08 13:51:05,087 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-08 13:51:05,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 13:51:05,092 INFO L85 PathProgramCache]: Analyzing trace with hash 313264910, now seen corresponding path program 1 times [2024-09-08 13:51:05,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 13:51:05,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137152040] [2024-09-08 13:51:05,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 13:51:05,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 13:51:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 13:51:05,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 13:51:05,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 13:51:05,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137152040] [2024-09-08 13:51:05,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137152040] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 13:51:05,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 13:51:05,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-09-08 13:51:05,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158111101] [2024-09-08 13:51:05,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 13:51:05,686 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 13:51:05,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 13:51:05,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 13:51:05,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 13:51:05,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 13:51:05,708 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 13:51:05,709 INFO L475 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-09-08 13:51:05,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 13:51:05,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:51:05,768 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-08 13:51:05,768 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-08 13:51:05,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 13:51:05,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1819891382, now seen corresponding path program 1 times [2024-09-08 13:51:05,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 13:51:05,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395790407] [2024-09-08 13:51:05,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 13:51:05,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 13:51:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 13:51:06,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 13:51:06,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 13:51:06,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395790407] [2024-09-08 13:51:06,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395790407] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 13:51:06,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 13:51:06,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 13:51:06,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278801050] [2024-09-08 13:51:06,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 13:51:06,277 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-08 13:51:06,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 13:51:06,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-08 13:51:06,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-08 13:51:06,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 13:51:06,292 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 13:51:06,292 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-09-08 13:51:06,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:51:06,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 13:51:06,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:51:06,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:51:06,465 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-08 13:51:06,466 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-08 13:51:06,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 13:51:06,466 INFO L85 PathProgramCache]: Analyzing trace with hash 240444913, now seen corresponding path program 1 times [2024-09-08 13:51:06,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 13:51:06,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930733113] [2024-09-08 13:51:06,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 13:51:06,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 13:51:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 13:51:06,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 13:51:06,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 13:51:06,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930733113] [2024-09-08 13:51:06,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930733113] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 13:51:06,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 13:51:06,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 13:51:06,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704542676] [2024-09-08 13:51:06,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 13:51:06,694 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 13:51:06,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 13:51:06,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 13:51:06,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 13:51:06,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 13:51:06,695 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 13:51:06,695 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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-09-08 13:51:06,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:51:06,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:51:06,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 13:51:06,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:51:06,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:51:06,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:51:06,801 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-08 13:51:06,801 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-08 13:51:06,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 13:51:06,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1753155271, now seen corresponding path program 1 times [2024-09-08 13:51:06,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 13:51:06,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815884544] [2024-09-08 13:51:06,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 13:51:06,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 13:51:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 13:51:07,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 13:51:07,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 13:51:07,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815884544] [2024-09-08 13:51:07,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815884544] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 13:51:07,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 13:51:07,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-08 13:51:07,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768802728] [2024-09-08 13:51:07,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 13:51:07,864 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-08 13:51:07,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 13:51:07,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-08 13:51:07,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-09-08 13:51:07,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 13:51:07,865 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 13:51:07,870 INFO L475 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-09-08 13:51:07,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:51:07,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:51:07,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:51:07,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 13:51:08,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:51:08,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:51:08,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:51:08,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 13:51:08,057 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-08 13:51:08,057 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-08 13:51:08,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 13:51:08,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1678572046, now seen corresponding path program 1 times [2024-09-08 13:51:08,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 13:51:08,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856887878] [2024-09-08 13:51:08,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 13:51:08,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 13:51:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 13:51:08,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 13:51:08,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 13:51:08,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856887878] [2024-09-08 13:51:08,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856887878] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 13:51:08,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 13:51:08,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 13:51:08,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420148375] [2024-09-08 13:51:08,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 13:51:08,241 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 13:51:08,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 13:51:08,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 13:51:08,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-08 13:51:08,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 13:51:08,242 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 13:51:08,242 INFO L475 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-09-08 13:51:08,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:51:08,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:51:08,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:51:08,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-08 13:51:08,242 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 13:51:08,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:51:08,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:51:08,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:51:08,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 13:51:08,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:51:08,427 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-08 13:51:08,428 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-08 13:51:08,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 13:51:08,428 INFO L85 PathProgramCache]: Analyzing trace with hash -863833964, now seen corresponding path program 1 times [2024-09-08 13:51:08,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 13:51:08,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334954300] [2024-09-08 13:51:08,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 13:51:08,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 13:51:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 13:51:09,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 13:51:09,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 13:51:09,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334954300] [2024-09-08 13:51:09,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334954300] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 13:51:09,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 13:51:09,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-09-08 13:51:09,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570125979] [2024-09-08 13:51:09,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 13:51:09,373 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-08 13:51:09,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 13:51:09,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-08 13:51:09,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-09-08 13:51:09,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 13:51:09,374 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 13:51:09,374 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 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-09-08 13:51:09,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:51:09,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:51:09,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:51:09,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-08 13:51:09,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:51:09,374 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 13:51:09,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:51:09,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:51:09,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:51:09,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 13:51:09,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:51:09,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 13:51:09,800 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-08 13:51:09,800 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-08 13:51:09,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 13:51:09,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1359193036, now seen corresponding path program 2 times [2024-09-08 13:51:09,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 13:51:09,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71740413] [2024-09-08 13:51:09,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 13:51:09,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 13:51:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 13:51:10,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 13:51:10,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 13:51:10,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71740413] [2024-09-08 13:51:10,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71740413] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 13:51:10,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 13:51:10,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-09-08 13:51:10,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361306669] [2024-09-08 13:51:10,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 13:51:10,921 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-08 13:51:10,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 13:51:10,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-08 13:51:10,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-09-08 13:51:10,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 13:51:10,922 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 13:51:10,922 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 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-09-08 13:51:10,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:51:10,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:51:10,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:51:10,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-09-08 13:51:10,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:51:10,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-09-08 13:51:10,923 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 13:51:11,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:51:11,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:51:11,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 13:51:11,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-08 13:51:11,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 13:51:11,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-08 13:51:11,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-08 13:51:11,567 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-08 13:51:11,567 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-09-08 13:51:11,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 13:51:11,567 INFO L85 PathProgramCache]: Analyzing trace with hash -41122792, now seen corresponding path program 3 times [2024-09-08 13:51:11,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 13:51:11,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794184690] [2024-09-08 13:51:11,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 13:51:11,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 13:51:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 13:51:11,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-08 13:51:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 13:51:11,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-08 13:51:11,668 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-08 13:51:11,669 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-09-08 13:51:11,670 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-09-08 13:51:11,670 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-09-08 13:51:11,670 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-09-08 13:51:11,671 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-09-08 13:51:11,671 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-08 13:51:11,675 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2024-09-08 13:51:11,676 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2024-09-08 13:51:11,718 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-09-08 13:51:11,718 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-08 13:51:11,720 INFO L469 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-09-08 13:51:11,720 INFO L470 ceAbstractionStarter]: WitnessConsidered=2 [2024-09-08 13:51:11,720 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 01:51:11 BasicIcfg [2024-09-08 13:51:11,720 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-08 13:51:11,721 INFO L158 Benchmark]: Toolchain (without parser) took 8120.63ms. Allocated memory was 182.5MB in the beginning and 371.2MB in the end (delta: 188.7MB). Free memory was 106.4MB in the beginning and 250.9MB in the end (delta: -144.5MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. [2024-09-08 13:51:11,721 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-08 13:51:11,721 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 182.5MB. Free memory is still 109.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-08 13:51:11,721 INFO L158 Benchmark]: CACSL2BoogieTranslator took 515.66ms. Allocated memory is still 182.5MB. Free memory was 106.0MB in the beginning and 75.4MB in the end (delta: 30.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-09-08 13:51:11,722 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.06ms. Allocated memory is still 182.5MB. Free memory was 75.4MB in the beginning and 72.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-08 13:51:11,722 INFO L158 Benchmark]: Boogie Preprocessor took 43.23ms. Allocated memory is still 182.5MB. Free memory was 72.1MB in the beginning and 70.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-08 13:51:11,722 INFO L158 Benchmark]: RCFGBuilder took 668.60ms. Allocated memory is still 182.5MB. Free memory was 70.4MB in the beginning and 106.8MB in the end (delta: -36.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-09-08 13:51:11,722 INFO L158 Benchmark]: TraceAbstraction took 6844.47ms. Allocated memory was 182.5MB in the beginning and 371.2MB in the end (delta: 188.7MB). Free memory was 106.5MB in the beginning and 250.9MB in the end (delta: -144.4MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. [2024-09-08 13:51:11,723 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.17ms. Allocated memory is still 182.5MB. Free memory is still 109.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 515.66ms. Allocated memory is still 182.5MB. Free memory was 106.0MB in the beginning and 75.4MB in the end (delta: 30.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.06ms. Allocated memory is still 182.5MB. Free memory was 75.4MB in the beginning and 72.1MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.23ms. Allocated memory is still 182.5MB. Free memory was 72.1MB in the beginning and 70.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 668.60ms. Allocated memory is still 182.5MB. Free memory was 70.4MB in the beginning and 106.8MB in the end (delta: -36.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6844.47ms. Allocated memory was 182.5MB in the beginning and 371.2MB in the end (delta: 188.7MB). Free memory was 106.5MB in the beginning and 250.9MB in the end (delta: -144.4MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 760, independent: 692, independent conditional: 403, independent unconditional: 289, dependent: 68, dependent conditional: 38, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 732, independent: 692, independent conditional: 403, independent unconditional: 289, dependent: 40, dependent conditional: 10, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 732, independent: 692, independent conditional: 403, independent unconditional: 289, dependent: 40, dependent conditional: 10, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 794, independent: 692, independent conditional: 403, independent unconditional: 289, dependent: 102, dependent conditional: 72, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 794, independent: 692, independent conditional: 14, independent unconditional: 678, dependent: 102, dependent conditional: 33, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 794, independent: 692, independent conditional: 14, independent unconditional: 678, dependent: 102, dependent conditional: 33, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 340, independent: 299, independent conditional: 8, independent unconditional: 291, dependent: 41, dependent conditional: 11, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 340, independent: 275, independent conditional: 0, independent unconditional: 275, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 65, independent: 24, independent conditional: 8, independent unconditional: 16, dependent: 41, dependent conditional: 11, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 24, independent conditional: 8, independent unconditional: 16, dependent: 41, dependent conditional: 11, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 428, independent: 117, independent conditional: 30, independent unconditional: 87, dependent: 310, dependent conditional: 34, dependent unconditional: 276, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 794, independent: 393, independent conditional: 6, independent unconditional: 387, dependent: 61, dependent conditional: 22, dependent unconditional: 39, unknown: 340, unknown conditional: 19, unknown unconditional: 321] , Statistics on independence cache: Total cache size (in pairs): 340, Positive cache size: 299, Positive conditional cache size: 8, Positive unconditional cache size: 291, Negative cache size: 41, Negative conditional cache size: 11, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 428, Maximal queried relation: 4, Independence queries for same thread: 28, Persistent sets #1 benchmarks: Persistent set computation time: 0.4s, Number of persistent set computation: 91, Number of trivial persistent sets: 52, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 319, independent: 289, independent conditional: 0, independent unconditional: 289, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 760, independent: 692, independent conditional: 403, independent unconditional: 289, dependent: 68, dependent conditional: 38, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 732, independent: 692, independent conditional: 403, independent unconditional: 289, dependent: 40, dependent conditional: 10, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 732, independent: 692, independent conditional: 403, independent unconditional: 289, dependent: 40, dependent conditional: 10, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 794, independent: 692, independent conditional: 403, independent unconditional: 289, dependent: 102, dependent conditional: 72, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 794, independent: 692, independent conditional: 14, independent unconditional: 678, dependent: 102, dependent conditional: 33, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 794, independent: 692, independent conditional: 14, independent unconditional: 678, dependent: 102, dependent conditional: 33, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 340, independent: 299, independent conditional: 8, independent unconditional: 291, dependent: 41, dependent conditional: 11, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 340, independent: 275, independent conditional: 0, independent unconditional: 275, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 65, independent: 24, independent conditional: 8, independent unconditional: 16, dependent: 41, dependent conditional: 11, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 24, independent conditional: 8, independent unconditional: 16, dependent: 41, dependent conditional: 11, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 428, independent: 117, independent conditional: 30, independent unconditional: 87, dependent: 310, dependent conditional: 34, dependent unconditional: 276, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 794, independent: 393, independent conditional: 6, independent unconditional: 387, dependent: 61, dependent conditional: 22, dependent unconditional: 39, unknown: 340, unknown conditional: 19, unknown unconditional: 321] , Statistics on independence cache: Total cache size (in pairs): 340, Positive cache size: 299, Positive conditional cache size: 8, Positive unconditional cache size: 291, Negative cache size: 41, Negative conditional cache size: 11, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 428, Maximal queried relation: 4, Independence queries for same thread: 28 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L1] 0 //@ ghost int multithreaded = 0; [L792] 0 pthread_t t1447; [L793] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1447=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1447=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L794] 0 pthread_t t1448; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1447=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L795] 0 //@ assert ((((((((((((((!multithreaded || (x$read_delayed_var == 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((x$w_buff1 == 0) || (x$w_buff1 == 2)))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (((x == 0) || (x == 1)) || (x == 2)))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || ((x$w_buff0 == 0) || (x$w_buff0 == 2)))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2)))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))); VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1447=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1447=-2, t1448=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L760] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L760] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L796] 0 //@ assert ((((((((((((((!multithreaded || (x$read_delayed_var == 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((x$w_buff1 == 0) || (x$w_buff1 == 2)))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (((x == 0) || (x == 1)) || (x == 2)))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || ((x$w_buff0 == 0) || (x$w_buff0 == 2)))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2)))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))); VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1447=-2, t1448=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L736] 1 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L739] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L779] 2 return 0; [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447=-2, t1448=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447=-2, t1448=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447=-2, t1448=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] - UnprovableResult [Line: 795]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 796]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 795]: 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, 53 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 1.9s, 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: 46, 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, 4.3s InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 2924 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-09-08 13:51:11,765 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-09-08 13:51:11,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE