./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-local/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e94c40da 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-local/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-dev-e94c40d-m [2024-09-24 10:54:01,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-24 10:54:01,355 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-09-24 10:54:01,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-24 10:54:01,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-24 10:54:01,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-24 10:54:01,392 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-24 10:54:01,392 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-24 10:54:01,393 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-24 10:54:01,393 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-24 10:54:01,393 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-24 10:54:01,394 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-24 10:54:01,394 INFO L153 SettingsManager]: * Use SBE=true [2024-09-24 10:54:01,394 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-24 10:54:01,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-24 10:54:01,395 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-24 10:54:01,395 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-24 10:54:01,396 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-24 10:54:01,396 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-24 10:54:01,396 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-24 10:54:01,397 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-24 10:54:01,397 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-24 10:54:01,398 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-24 10:54:01,398 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-24 10:54:01,398 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-24 10:54:01,398 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-24 10:54:01,399 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-24 10:54:01,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-24 10:54:01,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-24 10:54:01,400 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-24 10:54:01,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-24 10:54:01,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-24 10:54:01,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-24 10:54:01,401 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-24 10:54:01,401 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-24 10:54:01,401 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-24 10:54:01,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-24 10:54:01,402 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-24 10:54:01,402 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-24 10:54:01,402 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-24 10:54:01,403 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-24 10:54:01,403 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-24 10:54:01,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-24 10:54:01,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-24 10:54:01,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-24 10:54:01,708 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-24 10:54:01,709 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-24 10:54:01,710 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-local/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.yml/witness.yml [2024-09-24 10:54:01,854 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-24 10:54:01,855 INFO L274 PluginConnector]: CDTParser initialized [2024-09-24 10:54:01,855 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-24 10:54:03,169 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-24 10:54:03,393 INFO L384 CDTParser]: Found 1 translation units. [2024-09-24 10:54:03,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-09-24 10:54:03,406 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/df164e425/87c7b367c0944322b5a59e36596186de/FLAG5af7e07da [2024-09-24 10:54:03,419 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/df164e425/87c7b367c0944322b5a59e36596186de [2024-09-24 10:54:03,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-24 10:54:03,421 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-24 10:54:03,422 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-24 10:54:03,422 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-24 10:54:03,427 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-24 10:54:03,427 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 24.09 10:54:01" (1/2) ... [2024-09-24 10:54:03,428 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@595e3df2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 10:54:03, skipping insertion in model container [2024-09-24 10:54:03,428 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 24.09 10:54:01" (1/2) ... [2024-09-24 10:54:03,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2024279f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 24.09 10:54:03, skipping insertion in model container [2024-09-24 10:54:03,430 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 10:54:03" (2/2) ... [2024-09-24 10:54:03,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@595e3df2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:54:03, skipping insertion in model container [2024-09-24 10:54:03,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 10:54:03" (2/2) ... [2024-09-24 10:54:03,586 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-24 10:54:03,588 INFO L1541 ArrayList]: Location invariant before [L801-L801] (((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2) [2024-09-24 10:54:03,588 INFO L1541 ArrayList]: Location invariant before [L749-L749] (((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2) [2024-09-24 10:54:03,588 INFO L1541 ArrayList]: Location invariant before [L767-L767] (((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2) [2024-09-24 10:54:03,589 INFO L1541 ArrayList]: Location invariant before [L770-L770] (((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2) [2024-09-24 10:54:03,590 INFO L1541 ArrayList]: Location invariant before [L808-L808] (((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2) [2024-09-24 10:54:03,590 INFO L1541 ArrayList]: Location invariant before [L756-L756] (((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2) [2024-09-24 10:54:03,590 INFO L1541 ArrayList]: Location invariant before [L736-L736] (((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2) [2024-09-24 10:54:03,590 INFO L1541 ArrayList]: Location invariant before [L777-L777] (((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2) [2024-09-24 10:54:03,590 INFO L1541 ArrayList]: Location invariant before [L742-L742] (((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2) [2024-09-24 10:54:03,590 INFO L1541 ArrayList]: Location invariant before [L797-L797] (((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2) [2024-09-24 10:54:03,591 INFO L1541 ArrayList]: Location invariant before [L739-L739] (((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2) [2024-09-24 10:54:03,655 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-24 10:54:03,812 WARN L248 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-24 10:54:03,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 10:54:04,006 INFO L200 MainTranslator]: Completed pre-run [2024-09-24 10:54:04,017 WARN L248 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 Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-09-24 10:54:04,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 10:54:04,157 INFO L204 MainTranslator]: Completed translation [2024-09-24 10:54:04,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:54:04 WrapperNode [2024-09-24 10:54:04,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-24 10:54:04,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-24 10:54:04,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-24 10:54:04,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-24 10:54:04,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:54:04" (1/1) ... [2024-09-24 10:54:04,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:54:04" (1/1) ... [2024-09-24 10:54:04,228 INFO L138 Inliner]: procedures = 174, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 136 [2024-09-24 10:54:04,228 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-24 10:54:04,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-24 10:54:04,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-24 10:54:04,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-24 10:54:04,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:54:04" (1/1) ... [2024-09-24 10:54:04,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:54:04" (1/1) ... [2024-09-24 10:54:04,244 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:54:04" (1/1) ... [2024-09-24 10:54:04,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:54:04" (1/1) ... [2024-09-24 10:54:04,259 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:54:04" (1/1) ... [2024-09-24 10:54:04,261 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:54:04" (1/1) ... [2024-09-24 10:54:04,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:54:04" (1/1) ... [2024-09-24 10:54:04,268 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:54:04" (1/1) ... [2024-09-24 10:54:04,275 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-24 10:54:04,276 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-24 10:54:04,279 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-24 10:54:04,279 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-24 10:54:04,280 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:54:04" (1/1) ... [2024-09-24 10:54:04,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-24 10:54:04,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 10:54:04,311 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-24 10:54:04,313 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-24 10:54:04,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-09-24 10:54:04,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-24 10:54:04,362 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-09-24 10:54:04,362 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-09-24 10:54:04,362 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-09-24 10:54:04,362 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-09-24 10:54:04,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-24 10:54:04,362 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-09-24 10:54:04,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-24 10:54:04,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-24 10:54:04,365 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-24 10:54:04,488 INFO L242 CfgBuilder]: Building ICFG [2024-09-24 10:54:04,490 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-24 10:54:04,930 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-24 10:54:04,931 INFO L291 CfgBuilder]: Performing block encoding [2024-09-24 10:54:05,161 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-24 10:54:05,161 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-24 10:54:05,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 10:54:05 BoogieIcfgContainer [2024-09-24 10:54:05,161 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-24 10:54:05,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-24 10:54:05,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-24 10:54:05,170 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-24 10:54:05,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 24.09 10:54:01" (1/4) ... [2024-09-24 10:54:05,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a35199d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 24.09 10:54:05, skipping insertion in model container [2024-09-24 10:54:05,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 10:54:03" (2/4) ... [2024-09-24 10:54:05,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a35199d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 10:54:05, skipping insertion in model container [2024-09-24 10:54:05,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:54:04" (3/4) ... [2024-09-24 10:54:05,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a35199d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 10:54:05, skipping insertion in model container [2024-09-24 10:54:05,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 10:54:05" (4/4) ... [2024-09-24 10:54:05,174 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-09-24 10:54:05,190 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-24 10:54:05,190 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-09-24 10:54:05,190 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-24 10:54:05,277 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-24 10:54:05,316 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 10:54:05,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-24 10:54:05,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-24 10:54:05,318 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-24 10:54:05,320 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-24 10:54:05,350 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-24 10:54:05,362 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-24 10:54:05,368 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;@56f5ccfe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 10:54:05,369 INFO L337 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-09-24 10:54:05,847 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-24 10:54:05,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 10:54:05,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1029420972, now seen corresponding path program 1 times [2024-09-24 10:54:05,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 10:54:05,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300824724] [2024-09-24 10:54:05,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 10:54:05,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 10:54:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 10:54:06,553 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-24 10:54:06,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 10:54:06,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300824724] [2024-09-24 10:54:06,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300824724] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 10:54:06,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 10:54:06,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 10:54:06,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461854257] [2024-09-24 10:54:06,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 10:54:06,562 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 10:54:06,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 10:54:06,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 10:54:06,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 10:54:06,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:54:06,587 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 10:54:06,588 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-24 10:54:06,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:54:06,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:06,622 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-24 10:54:06,622 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-24 10:54:06,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 10:54:06,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1029420011, now seen corresponding path program 1 times [2024-09-24 10:54:06,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 10:54:06,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627119421] [2024-09-24 10:54:06,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 10:54:06,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 10:54:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 10:54:06,891 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-24 10:54:06,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 10:54:06,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627119421] [2024-09-24 10:54:06,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627119421] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 10:54:06,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 10:54:06,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 10:54:06,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67931352] [2024-09-24 10:54:06,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 10:54:06,895 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-24 10:54:06,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 10:54:06,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-24 10:54:06,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-24 10:54:06,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:54:06,897 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 10:54:06,898 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-24 10:54:06,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:06,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:54:07,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:07,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:54:07,170 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-24 10:54:07,170 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-24 10:54:07,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 10:54:07,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1922078347, now seen corresponding path program 1 times [2024-09-24 10:54:07,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 10:54:07,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628072761] [2024-09-24 10:54:07,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 10:54:07,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 10:54:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 10:54:07,468 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-24 10:54:07,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 10:54:07,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628072761] [2024-09-24 10:54:07,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628072761] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 10:54:07,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 10:54:07,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 10:54:07,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278293689] [2024-09-24 10:54:07,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 10:54:07,470 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 10:54:07,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 10:54:07,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 10:54:07,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 10:54:07,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:54:07,472 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 10:54:07,472 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 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-24 10:54:07,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:07,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:54:07,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:54:07,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:07,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:54:07,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:07,887 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-24 10:54:07,887 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-24 10:54:07,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 10:54:07,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1340179724, now seen corresponding path program 1 times [2024-09-24 10:54:07,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 10:54:07,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399349975] [2024-09-24 10:54:07,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 10:54:07,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 10:54:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 10:54:08,482 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-24 10:54:08,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 10:54:08,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399349975] [2024-09-24 10:54:08,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399349975] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 10:54:08,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 10:54:08,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 10:54:08,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288475140] [2024-09-24 10:54:08,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 10:54:08,484 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-24 10:54:08,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 10:54:08,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-24 10:54:08,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-24 10:54:08,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:54:08,487 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 10:54:08,488 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) 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-24 10:54:08,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:08,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:54:08,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:08,488 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:54:08,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:08,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:54:08,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:08,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 10:54:08,580 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-24 10:54:08,580 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-24 10:54:08,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 10:54:08,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1404152409, now seen corresponding path program 1 times [2024-09-24 10:54:08,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 10:54:08,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747829272] [2024-09-24 10:54:08,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 10:54:08,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 10:54:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 10:54:08,971 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-24 10:54:08,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 10:54:08,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747829272] [2024-09-24 10:54:08,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747829272] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 10:54:08,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 10:54:08,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-24 10:54:08,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783403027] [2024-09-24 10:54:08,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 10:54:08,973 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-24 10:54:08,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 10:54:08,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-24 10:54:08,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-24 10:54:08,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:54:08,974 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 10:54:08,975 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-24 10:54:08,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:08,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:54:08,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:08,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 10:54:08,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:54:09,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:09,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:54:09,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:09,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 10:54:09,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 10:54:09,146 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-24 10:54:09,146 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-24 10:54:09,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 10:54:09,146 INFO L85 PathProgramCache]: Analyzing trace with hash -140114759, now seen corresponding path program 1 times [2024-09-24 10:54:09,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 10:54:09,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306229320] [2024-09-24 10:54:09,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 10:54:09,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 10:54:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 10:54:09,475 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-24 10:54:09,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 10:54:09,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306229320] [2024-09-24 10:54:09,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306229320] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 10:54:09,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 10:54:09,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-24 10:54:09,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284298794] [2024-09-24 10:54:09,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 10:54:09,477 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 10:54:09,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 10:54:09,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 10:54:09,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-24 10:54:09,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:54:09,478 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 10:54:09,478 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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-24 10:54:09,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:09,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:54:09,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:09,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 10:54:09,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 10:54:09,479 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:54:09,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:09,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:54:09,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:09,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 10:54:09,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 10:54:09,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:54:09,931 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-24 10:54:09,931 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-24 10:54:09,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 10:54:09,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1340870593, now seen corresponding path program 1 times [2024-09-24 10:54:09,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 10:54:09,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211527470] [2024-09-24 10:54:09,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 10:54:09,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 10:54:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 10:54:10,723 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-24 10:54:10,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 10:54:10,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211527470] [2024-09-24 10:54:10,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211527470] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 10:54:10,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 10:54:10,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-24 10:54:10,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628058911] [2024-09-24 10:54:10,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 10:54:10,726 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-24 10:54:10,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 10:54:10,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-24 10:54:10,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-24 10:54:10,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:54:10,727 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 10:54:10,727 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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-24 10:54:10,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:10,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:54:10,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:10,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 10:54:10,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 10:54:10,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:54:10,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:54:10,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:10,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:54:10,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:10,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 10:54:10,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 10:54:10,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:54:10,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 10:54:10,897 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-24 10:54:10,898 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-24 10:54:10,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 10:54:10,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1463522341, now seen corresponding path program 1 times [2024-09-24 10:54:10,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 10:54:10,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468507173] [2024-09-24 10:54:10,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 10:54:10,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 10:54:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 10:54:11,535 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-24 10:54:11,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 10:54:11,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468507173] [2024-09-24 10:54:11,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468507173] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 10:54:11,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 10:54:11,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-24 10:54:11,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979575102] [2024-09-24 10:54:11,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 10:54:11,537 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-24 10:54:11,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 10:54:11,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-24 10:54:11,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-24 10:54:11,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:54:11,538 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 10:54:11,538 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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-24 10:54:11,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:11,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:54:11,538 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:11,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 10:54:11,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 10:54:11,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:54:11,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 10:54:11,539 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:54:12,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:12,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:54:12,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:12,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 10:54:12,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 10:54:12,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:54:12,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 10:54:12,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 10:54:12,238 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-24 10:54:12,239 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-24 10:54:12,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 10:54:12,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1431615013, now seen corresponding path program 2 times [2024-09-24 10:54:12,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 10:54:12,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159904931] [2024-09-24 10:54:12,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 10:54:12,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 10:54:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 10:54:12,799 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-24 10:54:12,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 10:54:12,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159904931] [2024-09-24 10:54:12,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159904931] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 10:54:12,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 10:54:12,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-24 10:54:12,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173195191] [2024-09-24 10:54:12,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 10:54:12,800 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-24 10:54:12,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 10:54:12,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-24 10:54:12,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-09-24 10:54:12,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:54:12,801 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-24 10:54:12,801 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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-24 10:54:12,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:12,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:54:12,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:12,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 10:54:12,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-24 10:54:12,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:54:12,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 10:54:12,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-24 10:54:12,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-24 10:54:13,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:13,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:54:13,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 10:54:13,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 10:54:13,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 10:54:13,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 10:54:13,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 10:54:13,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 10:54:13,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 10:54:13,019 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-24 10:54:13,019 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-24 10:54:13,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 10:54:13,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1832661311, now seen corresponding path program 2 times [2024-09-24 10:54:13,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 10:54:13,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034280133] [2024-09-24 10:54:13,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 10:54:13,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 10:54:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-24 10:54:13,075 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-24 10:54:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-24 10:54:13,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-24 10:54:13,157 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-24 10:54:13,157 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-09-24 10:54:13,159 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 6 remaining) [2024-09-24 10:54:13,159 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 6 remaining) [2024-09-24 10:54:13,159 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 6 remaining) [2024-09-24 10:54:13,159 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-09-24 10:54:13,159 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-09-24 10:54:13,160 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-24 10:54:13,167 INFO L408 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2024-09-24 10:54:13,169 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/3) [2024-09-24 10:54:13,236 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-09-24 10:54:13,238 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-24 10:54:13,240 INFO L469 ceAbstractionStarter]: Automizer considered 11 witness invariants [2024-09-24 10:54:13,241 INFO L470 ceAbstractionStarter]: WitnessConsidered=11 [2024-09-24 10:54:13,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.09 10:54:13 BasicIcfg [2024-09-24 10:54:13,242 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-24 10:54:13,242 INFO L158 Benchmark]: Toolchain (without parser) took 9821.83ms. Allocated memory was 159.4MB in the beginning and 371.2MB in the end (delta: 211.8MB). Free memory was 97.0MB in the beginning and 137.7MB in the end (delta: -40.7MB). Peak memory consumption was 171.2MB. Max. memory is 16.1GB. [2024-09-24 10:54:13,242 INFO L158 Benchmark]: Witness Parser took 0.18ms. Allocated memory is still 94.4MB. Free memory was 55.9MB in the beginning and 55.8MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-24 10:54:13,243 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 94.4MB. Free memory was 49.0MB in the beginning and 49.0MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-24 10:54:13,243 INFO L158 Benchmark]: CACSL2BoogieTranslator took 736.11ms. Allocated memory is still 159.4MB. Free memory was 96.4MB in the beginning and 100.7MB in the end (delta: -4.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-09-24 10:54:13,243 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.92ms. Allocated memory is still 159.4MB. Free memory was 100.7MB in the beginning and 97.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-24 10:54:13,243 INFO L158 Benchmark]: Boogie Preprocessor took 46.41ms. Allocated memory is still 159.4MB. Free memory was 97.5MB in the beginning and 95.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-24 10:54:13,244 INFO L158 Benchmark]: RCFGBuilder took 885.27ms. Allocated memory is still 159.4MB. Free memory was 95.4MB in the beginning and 62.0MB in the end (delta: 33.4MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. [2024-09-24 10:54:13,244 INFO L158 Benchmark]: TraceAbstraction took 8076.04ms. Allocated memory was 159.4MB in the beginning and 371.2MB in the end (delta: 211.8MB). Free memory was 60.9MB in the beginning and 137.7MB in the end (delta: -76.8MB). Peak memory consumption was 134.0MB. Max. memory is 16.1GB. [2024-09-24 10:54:13,245 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.18ms. Allocated memory is still 94.4MB. Free memory was 55.9MB in the beginning and 55.8MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 94.4MB. Free memory was 49.0MB in the beginning and 49.0MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 736.11ms. Allocated memory is still 159.4MB. Free memory was 96.4MB in the beginning and 100.7MB in the end (delta: -4.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.92ms. Allocated memory is still 159.4MB. Free memory was 100.7MB in the beginning and 97.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.41ms. Allocated memory is still 159.4MB. Free memory was 97.5MB in the beginning and 95.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 885.27ms. Allocated memory is still 159.4MB. Free memory was 95.4MB in the beginning and 62.0MB in the end (delta: 33.4MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8076.04ms. Allocated memory was 159.4MB in the beginning and 371.2MB in the end (delta: 211.8MB). Free memory was 60.9MB in the beginning and 137.7MB in the end (delta: -76.8MB). Peak memory consumption was 134.0MB. 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: 1423, independent: 1244, independent conditional: 666, independent unconditional: 578, dependent: 179, dependent conditional: 167, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1268, independent: 1244, independent conditional: 666, independent unconditional: 578, dependent: 24, dependent conditional: 12, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1268, independent: 1244, independent conditional: 666, independent unconditional: 578, dependent: 24, dependent conditional: 12, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1330, independent: 1244, independent conditional: 666, independent unconditional: 578, dependent: 86, dependent conditional: 74, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1330, independent: 1244, independent conditional: 7, independent unconditional: 1237, dependent: 86, dependent conditional: 55, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1330, independent: 1244, independent conditional: 7, independent unconditional: 1237, dependent: 86, dependent conditional: 55, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 609, independent: 581, independent conditional: 3, independent unconditional: 578, dependent: 28, dependent conditional: 16, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 609, independent: 426, independent conditional: 0, independent unconditional: 426, dependent: 183, dependent conditional: 0, dependent unconditional: 183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 183, independent: 155, independent conditional: 3, independent unconditional: 152, dependent: 28, dependent conditional: 16, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 183, independent: 155, independent conditional: 3, independent unconditional: 152, dependent: 28, dependent conditional: 16, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1439, independent: 1240, independent conditional: 8, independent unconditional: 1231, dependent: 199, dependent conditional: 84, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1330, independent: 663, independent conditional: 4, independent unconditional: 659, dependent: 58, dependent conditional: 39, dependent unconditional: 19, unknown: 609, unknown conditional: 19, unknown unconditional: 590] , Statistics on independence cache: Total cache size (in pairs): 609, Positive cache size: 581, Positive conditional cache size: 3, Positive unconditional cache size: 578, Negative cache size: 28, Negative conditional cache size: 16, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 678, Maximal queried relation: 4, Independence queries for same thread: 155, Persistent sets #1 benchmarks: Persistent set computation time: 1.4s, Number of persistent set computation: 84, Number of trivial persistent sets: 42, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 590, independent: 578, independent conditional: 0, independent unconditional: 578, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1423, independent: 1244, independent conditional: 666, independent unconditional: 578, dependent: 179, dependent conditional: 167, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1268, independent: 1244, independent conditional: 666, independent unconditional: 578, dependent: 24, dependent conditional: 12, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1268, independent: 1244, independent conditional: 666, independent unconditional: 578, dependent: 24, dependent conditional: 12, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1330, independent: 1244, independent conditional: 666, independent unconditional: 578, dependent: 86, dependent conditional: 74, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1330, independent: 1244, independent conditional: 7, independent unconditional: 1237, dependent: 86, dependent conditional: 55, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1330, independent: 1244, independent conditional: 7, independent unconditional: 1237, dependent: 86, dependent conditional: 55, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 609, independent: 581, independent conditional: 3, independent unconditional: 578, dependent: 28, dependent conditional: 16, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 609, independent: 426, independent conditional: 0, independent unconditional: 426, dependent: 183, dependent conditional: 0, dependent unconditional: 183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 183, independent: 155, independent conditional: 3, independent unconditional: 152, dependent: 28, dependent conditional: 16, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 183, independent: 155, independent conditional: 3, independent unconditional: 152, dependent: 28, dependent conditional: 16, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1439, independent: 1240, independent conditional: 8, independent unconditional: 1231, dependent: 199, dependent conditional: 84, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1330, independent: 663, independent conditional: 4, independent unconditional: 659, dependent: 58, dependent conditional: 39, dependent unconditional: 19, unknown: 609, unknown conditional: 19, unknown unconditional: 590] , Statistics on independence cache: Total cache size (in pairs): 609, Positive cache size: 581, Positive conditional cache size: 3, Positive unconditional cache size: 578, Negative cache size: 28, Negative conditional cache size: 16, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 678, Maximal queried relation: 4, Independence queries for same thread: 155 - 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; [L792] 0 pthread_t t1447; [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=-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] [L794] 0 pthread_t t1448; [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=-1, t1448=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=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 //@ assert ((((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && ((y == 0) || (y == 1))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))); [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 //@ assert ((((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && ((y == 0) || (y == 1))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))); [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] [L736] 1 //@ assert ((((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && ((y == 0) || (y == 1))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))); [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 //@ assert ((((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && ((y == 0) || (y == 1))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))); [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 //@ assert ((((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && ((y == 0) || (y == 1))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))); [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 //@ assert ((((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && ((y == 0) || (y == 1))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))); [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 //@ assert ((((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && ((y == 0) || (y == 1))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))); [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 //@ assert ((((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && ((y == 0) || (y == 1))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))); [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 //@ assert ((((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && ((y == 0) || (y == 1))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))); [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=-1, t1448=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] [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 //@ assert ((((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && ((y == 0) || (y == 1))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))); [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=-1, t1448=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] [L808] 0 //@ assert ((((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && ((y == 0) || (y == 1))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))); [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=-1, t1448=0, weak$$choice0=1, weak$$choice2=1, 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=1, weak$$choice2=1, 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=1, weak$$choice2=1, 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: 797]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 801]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 808]: 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, 66 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 3.0s, 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.2s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 2842 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-24 10:54:13,277 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-24 10:54:13,476 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