./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix000.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-08-08_07-59-58.files/protection-ghost/mix000.oepc.yml/witness.yml --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version c091e2ee
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/mix000.oepc.i ./goblint.2024-08-08_07-59-58.files/protection-ghost/mix000.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-c091e2e-m
[2024-08-14 04:21:17,082 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-08-14 04:21:17,153 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf
[2024-08-14 04:21:17,156 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-08-14 04:21:17,156 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-08-14 04:21:17,171 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-08-14 04:21:17,171 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-08-14 04:21:17,171 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-08-14 04:21:17,172 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-08-14 04:21:17,172 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-08-14 04:21:17,173 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-08-14 04:21:17,173 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-08-14 04:21:17,173 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-08-14 04:21:17,174 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-08-14 04:21:17,174 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-08-14 04:21:17,174 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-08-14 04:21:17,174 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-08-14 04:21:17,175 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-08-14 04:21:17,175 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-08-14 04:21:17,175 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-08-14 04:21:17,176 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-08-14 04:21:17,176 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-08-14 04:21:17,176 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-08-14 04:21:17,177 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-08-14 04:21:17,177 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-08-14 04:21:17,177 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-08-14 04:21:17,177 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-08-14 04:21:17,178 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-08-14 04:21:17,178 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-08-14 04:21:17,178 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-08-14 04:21:17,179 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-08-14 04:21:17,179 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-08-14 04:21:17,179 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-08-14 04:21:17,179 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-08-14 04:21:17,179 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-08-14 04:21:17,180 INFO  L153        SettingsManager]:  * DFS Order used in POR=LOOP_LOCKSTEP
[2024-08-14 04:21:17,180 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-08-14 04:21:17,180 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-08-14 04:21:17,180 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2024-08-14 04:21:17,181 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-08-14 04:21:17,181 INFO  L153        SettingsManager]:  * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE
[2024-08-14 04:21:17,181 INFO  L153        SettingsManager]:  * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER
[2024-08-14 04:21:17,181 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
[2024-08-14 04:21:17,372 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-08-14 04:21:17,393 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-08-14 04:21:17,400 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-08-14 04:21:17,401 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-08-14 04:21:17,401 INFO  L274        PluginConnector]: CDTParser initialized
[2024-08-14 04:21:17,402 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000.oepc.i
[2024-08-14 04:21:18,758 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-08-14 04:21:18,990 INFO  L384              CDTParser]: Found 1 translation units.
[2024-08-14 04:21:18,990 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.oepc.i
[2024-08-14 04:21:19,006 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/74c3993f8/f8d10a06529a4a76b87cab4d40ca5f3f/FLAG912f4a998
[2024-08-14 04:21:19,021 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/74c3993f8/f8d10a06529a4a76b87cab4d40ca5f3f
[2024-08-14 04:21:19,023 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-08-14 04:21:19,025 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-08-14 04:21:19,025 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-08-08_07-59-58.files/protection-ghost/mix000.oepc.yml/witness.yml
[2024-08-14 04:21:19,151 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-08-14 04:21:19,152 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-08-14 04:21:19,154 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-08-14 04:21:19,155 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-08-14 04:21:19,159 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-08-14 04:21:19,159 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 04:21:19" (1/2) ...
[2024-08-14 04:21:19,160 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e44b3df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 04:21:19, skipping insertion in model container
[2024-08-14 04:21:19,160 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.08 04:21:19" (1/2) ...
[2024-08-14 04:21:19,161 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2a541d94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.08 04:21:19, skipping insertion in model container
[2024-08-14 04:21:19,163 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.08 04:21:19" (2/2) ...
[2024-08-14 04:21:19,163 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e44b3df and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 04:21:19, skipping insertion in model container
[2024-08-14 04:21:19,163 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.08 04:21:19" (2/2) ...
[2024-08-14 04:21:19,163 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-08-14 04:21:19,246 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-08-14 04:21:19,247 INFO  L97    edCorrectnessWitness]: Location invariant before [L834-L834] ((((((((((((((((! multithreaded || (y$mem_tmp == 0 || y$mem_tmp == 1)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 1))) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 1))
[2024-08-14 04:21:19,266 INFO  L97    edCorrectnessWitness]: Location invariant before [L835-L835] ((((((((((((((((! multithreaded || (y$mem_tmp == 0 || y$mem_tmp == 1)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$flush_delayed == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 1))) && (! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 1))
[2024-08-14 04:21:19,266 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-08-14 04:21:19,266 INFO  L106   edCorrectnessWitness]: ghost_update [L832-L832] multithreaded = 1;
[2024-08-14 04:21:19,307 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-08-14 04:21:19,457 WARN  L247   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.oepc.i[988,1001]
[2024-08-14 04:21:19,574 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-08-14 04:21:19,583 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
[2024-08-14 04:21:19,615 WARN  L247   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.oepc.i[988,1001]
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-08-14 04:21:19,679 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-08-14 04:21:19,710 INFO  L206         MainTranslator]: Completed translation
[2024-08-14 04:21:19,711 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 04:21:19 WrapperNode
[2024-08-14 04:21:19,711 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-08-14 04:21:19,712 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-08-14 04:21:19,712 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-08-14 04:21:19,712 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-08-14 04:21:19,718 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 04:21:19" (1/1) ...
[2024-08-14 04:21:19,732 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 04:21:19" (1/1) ...
[2024-08-14 04:21:19,756 INFO  L138                Inliner]: procedures = 174, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133
[2024-08-14 04:21:19,757 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-08-14 04:21:19,757 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-08-14 04:21:19,758 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-08-14 04:21:19,758 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-08-14 04:21:19,765 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 04:21:19" (1/1) ...
[2024-08-14 04:21:19,765 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 04:21:19" (1/1) ...
[2024-08-14 04:21:19,768 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 04:21:19" (1/1) ...
[2024-08-14 04:21:19,768 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 04:21:19" (1/1) ...
[2024-08-14 04:21:19,777 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 04:21:19" (1/1) ...
[2024-08-14 04:21:19,779 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 04:21:19" (1/1) ...
[2024-08-14 04:21:19,781 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 04:21:19" (1/1) ...
[2024-08-14 04:21:19,782 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 04:21:19" (1/1) ...
[2024-08-14 04:21:19,789 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-08-14 04:21:19,789 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-08-14 04:21:19,790 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-08-14 04:21:19,790 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-08-14 04:21:19,790 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 04:21:19" (1/1) ...
[2024-08-14 04:21:19,800 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-08-14 04:21:19,807 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-08-14 04:21:19,828 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-08-14 04:21:19,831 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-08-14 04:21:19,862 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-08-14 04:21:19,862 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-08-14 04:21:19,863 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-08-14 04:21:19,863 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-08-14 04:21:19,863 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-08-14 04:21:19,863 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-08-14 04:21:19,863 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-08-14 04:21:19,863 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-08-14 04:21:19,864 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-08-14 04:21:19,864 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-08-14 04:21:19,865 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-08-14 04:21:19,996 INFO  L244             CfgBuilder]: Building ICFG
[2024-08-14 04:21:19,998 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-08-14 04:21:20,288 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-08-14 04:21:20,289 INFO  L293             CfgBuilder]: Performing block encoding
[2024-08-14 04:21:20,516 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-08-14 04:21:20,523 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-08-14 04:21:20,524 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.08 04:21:20 BoogieIcfgContainer
[2024-08-14 04:21:20,524 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-08-14 04:21:20,525 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-08-14 04:21:20,525 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-08-14 04:21:20,533 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-08-14 04:21:20,533 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.08 04:21:19" (1/4) ...
[2024-08-14 04:21:20,533 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399af7fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.08 04:21:20, skipping insertion in model container
[2024-08-14 04:21:20,533 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.08 04:21:19" (2/4) ...
[2024-08-14 04:21:20,534 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399af7fe and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.08 04:21:20, skipping insertion in model container
[2024-08-14 04:21:20,534 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.08 04:21:19" (3/4) ...
[2024-08-14 04:21:20,534 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399af7fe and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.08 04:21:20, skipping insertion in model container
[2024-08-14 04:21:20,534 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.08 04:21:20" (4/4) ...
[2024-08-14 04:21:20,535 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix000.oepc.i
[2024-08-14 04:21:20,568 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-08-14 04:21:20,568 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations.
[2024-08-14 04:21:20,572 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-08-14 04:21:20,625 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-08-14 04:21:20,660 INFO  L100   denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-08-14 04:21:20,661 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2024-08-14 04:21:20,661 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-08-14 04:21:20,668 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-08-14 04:21:20,679 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-08-14 04:21:20,714 INFO  L158   artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2024-08-14 04:21:20,726 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ========
[2024-08-14 04:21:20,733 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@74f7c1c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-08-14 04:21:20,734 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2024-08-14 04:21:20,820 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] ===
[2024-08-14 04:21:20,824 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-08-14 04:21:20,824 INFO  L85        PathProgramCache]: Analyzing trace with hash 351384175, now seen corresponding path program 1 times
[2024-08-14 04:21:20,832 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-08-14 04:21:20,832 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883634747]
[2024-08-14 04:21:20,832 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-08-14 04:21:20,833 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-08-14 04:21:20,999 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 04:21:21,639 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-08-14 04:21:21,639 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-08-14 04:21:21,639 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883634747]
[2024-08-14 04:21:21,640 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883634747] provided 1 perfect and 0 imperfect interpolant sequences
[2024-08-14 04:21:21,640 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-08-14 04:21:21,640 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-08-14 04:21:21,641 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177920805]
[2024-08-14 04:21:21,642 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-08-14 04:21:21,645 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-08-14 04:21:21,645 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-08-14 04:21:21,663 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-08-14 04:21:21,663 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-08-14 04:21:21,664 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-08-14 04:21:21,665 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-08-14 04:21:21,666 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-08-14 04:21:21,667 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-08-14 04:21:21,817 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-08-14 04:21:21,818 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-08-14 04:21:21,818 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] ===
[2024-08-14 04:21:21,819 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-08-14 04:21:21,819 INFO  L85        PathProgramCache]: Analyzing trace with hash 1897745754, now seen corresponding path program 1 times
[2024-08-14 04:21:21,819 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-08-14 04:21:21,819 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094695225]
[2024-08-14 04:21:21,820 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-08-14 04:21:21,820 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-08-14 04:21:21,884 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 04:21:23,429 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-08-14 04:21:23,429 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-08-14 04:21:23,430 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094695225]
[2024-08-14 04:21:23,430 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094695225] provided 1 perfect and 0 imperfect interpolant sequences
[2024-08-14 04:21:23,430 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-08-14 04:21:23,430 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-08-14 04:21:23,430 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942609712]
[2024-08-14 04:21:23,431 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-08-14 04:21:23,431 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-08-14 04:21:23,432 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-08-14 04:21:23,432 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-08-14 04:21:23,432 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-08-14 04:21:23,432 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-08-14 04:21:23,433 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-08-14 04:21:23,433 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-08-14 04:21:23,433 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2024-08-14 04:21:23,433 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-08-14 04:21:23,709 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-08-14 04:21:23,710 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-08-14 04:21:23,710 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-08-14 04:21:23,710 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] ===
[2024-08-14 04:21:23,711 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-08-14 04:21:23,711 INFO  L85        PathProgramCache]: Analyzing trace with hash 1676085865, now seen corresponding path program 1 times
[2024-08-14 04:21:23,711 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-08-14 04:21:23,711 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967019739]
[2024-08-14 04:21:23,711 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-08-14 04:21:23,711 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-08-14 04:21:23,725 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 04:21:23,844 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-08-14 04:21:23,844 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-08-14 04:21:23,844 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967019739]
[2024-08-14 04:21:23,844 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967019739] provided 1 perfect and 0 imperfect interpolant sequences
[2024-08-14 04:21:23,844 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-08-14 04:21:23,845 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-08-14 04:21:23,845 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49362325]
[2024-08-14 04:21:23,845 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-08-14 04:21:23,846 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-08-14 04:21:23,846 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-08-14 04:21:23,847 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-08-14 04:21:23,848 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-08-14 04:21:23,848 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-08-14 04:21:23,848 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-08-14 04:21:23,849 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-08-14 04:21:23,849 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2024-08-14 04:21:23,849 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. 
[2024-08-14 04:21:23,849 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-08-14 04:21:23,970 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-08-14 04:21:23,970 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-08-14 04:21:23,970 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-08-14 04:21:23,971 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-08-14 04:21:23,971 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] ===
[2024-08-14 04:21:23,972 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-08-14 04:21:23,972 INFO  L85        PathProgramCache]: Analyzing trace with hash 170043662, now seen corresponding path program 1 times
[2024-08-14 04:21:23,973 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-08-14 04:21:23,973 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901871865]
[2024-08-14 04:21:23,973 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-08-14 04:21:23,973 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-08-14 04:21:24,009 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 04:21:24,154 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-08-14 04:21:24,154 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-08-14 04:21:24,154 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901871865]
[2024-08-14 04:21:24,155 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901871865] provided 1 perfect and 0 imperfect interpolant sequences
[2024-08-14 04:21:24,155 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-08-14 04:21:24,155 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-08-14 04:21:24,155 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243894175]
[2024-08-14 04:21:24,155 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-08-14 04:21:24,155 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-08-14 04:21:24,156 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-08-14 04:21:24,156 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-08-14 04:21:24,156 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-08-14 04:21:24,156 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-08-14 04:21:24,157 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-08-14 04:21:24,157 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 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-08-14 04:21:24,157 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2024-08-14 04:21:24,157 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. 
[2024-08-14 04:21:24,157 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-08-14 04:21:24,157 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-08-14 04:21:24,272 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-08-14 04:21:24,276 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-08-14 04:21:24,276 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-08-14 04:21:24,276 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-08-14 04:21:24,277 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-08-14 04:21:24,277 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] ===
[2024-08-14 04:21:24,277 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-08-14 04:21:24,277 INFO  L85        PathProgramCache]: Analyzing trace with hash 967617061, now seen corresponding path program 1 times
[2024-08-14 04:21:24,277 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-08-14 04:21:24,277 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111548254]
[2024-08-14 04:21:24,277 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-08-14 04:21:24,277 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-08-14 04:21:24,295 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 04:21:24,439 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-08-14 04:21:24,439 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-08-14 04:21:24,439 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111548254]
[2024-08-14 04:21:24,439 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111548254] provided 1 perfect and 0 imperfect interpolant sequences
[2024-08-14 04:21:24,439 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-08-14 04:21:24,439 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-08-14 04:21:24,440 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064614545]
[2024-08-14 04:21:24,440 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-08-14 04:21:24,440 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-08-14 04:21:24,440 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-08-14 04:21:24,440 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-08-14 04:21:24,441 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-08-14 04:21:24,441 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-08-14 04:21:24,441 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-08-14 04:21:24,441 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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-08-14 04:21:24,441 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2024-08-14 04:21:24,441 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. 
[2024-08-14 04:21:24,441 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-08-14 04:21:24,441 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-08-14 04:21:24,441 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-08-14 04:21:24,888 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-08-14 04:21:24,889 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-08-14 04:21:24,889 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-08-14 04:21:24,889 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-08-14 04:21:24,889 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-08-14 04:21:24,889 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-08-14 04:21:24,889 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] ===
[2024-08-14 04:21:24,890 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-08-14 04:21:24,890 INFO  L85        PathProgramCache]: Analyzing trace with hash -1930555880, now seen corresponding path program 1 times
[2024-08-14 04:21:24,890 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-08-14 04:21:24,890 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495582892]
[2024-08-14 04:21:24,890 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-08-14 04:21:24,890 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-08-14 04:21:24,896 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 04:21:25,415 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-08-14 04:21:25,415 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-08-14 04:21:25,415 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495582892]
[2024-08-14 04:21:25,415 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495582892] provided 1 perfect and 0 imperfect interpolant sequences
[2024-08-14 04:21:25,415 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-08-14 04:21:25,415 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-08-14 04:21:25,416 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540601126]
[2024-08-14 04:21:25,416 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-08-14 04:21:25,416 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-08-14 04:21:25,416 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-08-14 04:21:25,417 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-08-14 04:21:25,417 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-08-14 04:21:25,417 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-08-14 04:21:25,417 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-08-14 04:21:25,417 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-08-14 04:21:25,417 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2024-08-14 04:21:25,417 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. 
[2024-08-14 04:21:25,417 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-08-14 04:21:25,418 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-08-14 04:21:25,418 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. 
[2024-08-14 04:21:25,418 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-08-14 04:21:25,822 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-08-14 04:21:25,822 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-08-14 04:21:25,822 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-08-14 04:21:25,822 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-08-14 04:21:25,822 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-08-14 04:21:25,822 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-08-14 04:21:25,823 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-08-14 04:21:25,823 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] ===
[2024-08-14 04:21:25,823 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-08-14 04:21:25,823 INFO  L85        PathProgramCache]: Analyzing trace with hash -339371834, now seen corresponding path program 1 times
[2024-08-14 04:21:25,824 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-08-14 04:21:25,824 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635990530]
[2024-08-14 04:21:25,824 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-08-14 04:21:25,824 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-08-14 04:21:25,830 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-08-14 04:21:26,267 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-08-14 04:21:26,268 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-08-14 04:21:26,268 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635990530]
[2024-08-14 04:21:26,268 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635990530] provided 1 perfect and 0 imperfect interpolant sequences
[2024-08-14 04:21:26,269 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-08-14 04:21:26,269 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-08-14 04:21:26,269 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465208655]
[2024-08-14 04:21:26,269 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-08-14 04:21:26,269 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-08-14 04:21:26,269 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-08-14 04:21:26,270 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-08-14 04:21:26,270 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-08-14 04:21:26,270 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-08-14 04:21:26,270 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-08-14 04:21:26,271 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-08-14 04:21:26,271 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2024-08-14 04:21:26,271 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. 
[2024-08-14 04:21:26,271 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-08-14 04:21:26,271 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-08-14 04:21:26,271 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. 
[2024-08-14 04:21:26,271 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. 
[2024-08-14 04:21:26,271 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-08-14 04:21:26,578 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-08-14 04:21:26,578 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-08-14 04:21:26,579 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-08-14 04:21:26,579 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-08-14 04:21:26,579 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-08-14 04:21:26,579 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-08-14 04:21:26,579 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-08-14 04:21:26,583 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-08-14 04:21:26,583 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] ===
[2024-08-14 04:21:26,584 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-08-14 04:21:26,584 INFO  L85        PathProgramCache]: Analyzing trace with hash 1400059429, now seen corresponding path program 2 times
[2024-08-14 04:21:26,584 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-08-14 04:21:26,585 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752305729]
[2024-08-14 04:21:26,585 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-08-14 04:21:26,585 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-08-14 04:21:26,625 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-08-14 04:21:26,625 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-08-14 04:21:26,654 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-08-14 04:21:26,693 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-08-14 04:21:26,693 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-08-14 04:21:26,696 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining)
[2024-08-14 04:21:26,699 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining)
[2024-08-14 04:21:26,700 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining)
[2024-08-14 04:21:26,700 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining)
[2024-08-14 04:21:26,700 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining)
[2024-08-14 04:21:26,700 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-08-14 04:21:26,704 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1]
[2024-08-14 04:21:26,707 INFO  L308   ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2)
[2024-08-14 04:21:26,710 INFO  L229   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-08-14 04:21:26,710 INFO  L179   ceAbstractionStarter]: Computing trace abstraction results
[2024-08-14 04:21:26,784 INFO  L507   ceAbstractionStarter]: Automizer considered 2 witness invariants
[2024-08-14 04:21:26,784 INFO  L508   ceAbstractionStarter]: WitnessConsidered=2
[2024-08-14 04:21:26,785 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.08 04:21:26 BasicIcfg
[2024-08-14 04:21:26,785 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-08-14 04:21:26,785 INFO  L158              Benchmark]: Toolchain (without parser) took 7633.02ms. Allocated memory was 151.0MB in the beginning and 417.3MB in the end (delta: 266.3MB). Free memory was 70.7MB in the beginning and 239.5MB in the end (delta: -168.8MB). Peak memory consumption was 98.5MB. Max. memory is 16.1GB.
[2024-08-14 04:21:26,786 INFO  L158              Benchmark]: CDTParser took 0.13ms. Allocated memory is still 151.0MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-08-14 04:21:26,786 INFO  L158              Benchmark]: Witness Parser took 0.39ms. Allocated memory is still 151.0MB. Free memory was 76.6MB in the beginning and 76.5MB in the end (delta: 153.8kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-08-14 04:21:26,786 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 556.87ms. Allocated memory was 151.0MB in the beginning and 228.6MB in the end (delta: 77.6MB). Free memory was 70.5MB in the beginning and 172.6MB in the end (delta: -102.1MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB.
[2024-08-14 04:21:26,786 INFO  L158              Benchmark]: Boogie Procedure Inliner took 45.35ms. Allocated memory is still 228.6MB. Free memory was 172.6MB in the beginning and 169.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-08-14 04:21:26,786 INFO  L158              Benchmark]: Boogie Preprocessor took 31.47ms. Allocated memory is still 228.6MB. Free memory was 169.5MB in the beginning and 167.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-08-14 04:21:26,786 INFO  L158              Benchmark]: RCFGBuilder took 734.22ms. Allocated memory is still 228.6MB. Free memory was 167.4MB in the beginning and 112.8MB in the end (delta: 54.5MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB.
[2024-08-14 04:21:26,787 INFO  L158              Benchmark]: TraceAbstraction took 6259.71ms. Allocated memory was 228.6MB in the beginning and 417.3MB in the end (delta: 188.7MB). Free memory was 111.8MB in the beginning and 239.5MB in the end (delta: -127.7MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB.
[2024-08-14 04:21:26,788 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.13ms. Allocated memory is still 151.0MB. Free memory is still 103.1MB. There was no memory consumed. Max. memory is 16.1GB.
 * Witness Parser took 0.39ms. Allocated memory is still 151.0MB. Free memory was 76.6MB in the beginning and 76.5MB in the end (delta: 153.8kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 556.87ms. Allocated memory was 151.0MB in the beginning and 228.6MB in the end (delta: 77.6MB). Free memory was 70.5MB in the beginning and 172.6MB in the end (delta: -102.1MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 45.35ms. Allocated memory is still 228.6MB. Free memory was 172.6MB in the beginning and 169.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 31.47ms. Allocated memory is still 228.6MB. Free memory was 169.5MB in the beginning and 167.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 734.22ms. Allocated memory is still 228.6MB. Free memory was 167.4MB in the beginning and 112.8MB in the end (delta: 54.5MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB.
 * TraceAbstraction took 6259.71ms. Allocated memory was 228.6MB in the beginning and 417.3MB in the end (delta: 188.7MB). Free memory was 111.8MB in the beginning and 239.5MB in the end (delta: -127.7MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: Independence relation #1 benchmarks
    ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2137, independent: 1813, independent conditional: 1430, independent unconditional: 383, dependent: 324, dependent conditional: 274, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2000, independent: 1813, independent conditional: 1430, independent unconditional: 383, dependent: 187, dependent conditional: 137, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2000, independent: 1813, independent conditional: 1430, independent unconditional: 383, dependent: 187, dependent conditional: 137, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2553, independent: 1813, independent conditional: 122, independent unconditional: 1691, dependent: 740, dependent conditional: 431, dependent unconditional: 309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2553, independent: 1813, independent conditional: 122, independent unconditional: 1691, dependent: 740, dependent conditional: 222, dependent unconditional: 518, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2553, independent: 1813, independent conditional: 122, independent unconditional: 1691, dependent: 740, dependent conditional: 222, dependent unconditional: 518, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 491, independent: 407, independent conditional: 19, independent unconditional: 388, dependent: 84, dependent conditional: 31, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 491, independent: 365, independent conditional: 0, independent unconditional: 365, dependent: 126, dependent conditional: 0, dependent unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 126, independent: 42, independent conditional: 19, independent unconditional: 23, dependent: 84, dependent conditional: 31, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 126, independent: 42, independent conditional: 19, independent unconditional: 23, dependent: 84, dependent conditional: 31, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 606, independent: 214, independent conditional: 71, independent unconditional: 144, dependent: 392, dependent conditional: 123, dependent unconditional: 269, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2553, independent: 1406, independent conditional: 103, independent unconditional: 1303, dependent: 656, dependent conditional: 191, dependent unconditional: 465, unknown: 491, unknown conditional: 50, unknown unconditional: 441] , Statistics on independence cache: Total cache size (in pairs): 491, Positive cache size: 407, Positive conditional cache size: 19, Positive unconditional cache size: 388, Negative cache size: 84, Negative conditional cache size: 31, Negative unconditional cache size: 53, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 209, Maximal queried relation: 5, Independence queries for same thread: 137
  - StatisticsResult: Persistent set benchmarks
    Persistent set computation time: 0.4s, Number of persistent set computation: 194, Number of trivial persistent sets: 131, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 433, independent: 383, independent conditional: 0, independent unconditional: 383, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2137, independent: 1813, independent conditional: 1430, independent unconditional: 383, dependent: 324, dependent conditional: 274, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2000, independent: 1813, independent conditional: 1430, independent unconditional: 383, dependent: 187, dependent conditional: 137, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2000, independent: 1813, independent conditional: 1430, independent unconditional: 383, dependent: 187, dependent conditional: 137, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2553, independent: 1813, independent conditional: 122, independent unconditional: 1691, dependent: 740, dependent conditional: 431, dependent unconditional: 309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2553, independent: 1813, independent conditional: 122, independent unconditional: 1691, dependent: 740, dependent conditional: 222, dependent unconditional: 518, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2553, independent: 1813, independent conditional: 122, independent unconditional: 1691, dependent: 740, dependent conditional: 222, dependent unconditional: 518, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 491, independent: 407, independent conditional: 19, independent unconditional: 388, dependent: 84, dependent conditional: 31, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 491, independent: 365, independent conditional: 0, independent unconditional: 365, dependent: 126, dependent conditional: 0, dependent unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 126, independent: 42, independent conditional: 19, independent unconditional: 23, dependent: 84, dependent conditional: 31, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 126, independent: 42, independent conditional: 19, independent unconditional: 23, dependent: 84, dependent conditional: 31, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 606, independent: 214, independent conditional: 71, independent unconditional: 144, dependent: 392, dependent conditional: 123, dependent unconditional: 269, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2553, independent: 1406, independent conditional: 103, independent unconditional: 1303, dependent: 656, dependent conditional: 191, dependent unconditional: 465, unknown: 491, unknown conditional: 50, unknown unconditional: 441] , Statistics on independence cache: Total cache size (in pairs): 491, Positive cache size: 407, Positive conditional cache size: 19, Positive unconditional cache size: 388, Negative cache size: 84, Negative conditional cache size: 31, Negative unconditional cache size: 53, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 209, Maximal queried relation: 5, Independence queries for same thread: 137
  - CounterExampleResult [Line: 19]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L1]                 0  //@ ghost int multithreaded = 0;
[L709]               0  int __unbuffered_cnt = 0;
[L711]               0  int __unbuffered_p0_EAX = 0;
[L713]               0  int __unbuffered_p0_EBX = 0;
[L715]               0  int __unbuffered_p1_EAX = 0;
[L717]               0  int __unbuffered_p1_EBX = 0;
[L718]               0  _Bool main$tmp_guard0;
[L719]               0  _Bool main$tmp_guard1;
[L721]               0  int x = 0;
[L723]               0  int y = 0;
[L724]               0  _Bool y$flush_delayed;
[L725]               0  int y$mem_tmp;
[L726]               0  _Bool y$r_buff0_thd0;
[L727]               0  _Bool y$r_buff0_thd1;
[L728]               0  _Bool y$r_buff0_thd2;
[L729]               0  _Bool y$r_buff1_thd0;
[L730]               0  _Bool y$r_buff1_thd1;
[L731]               0  _Bool y$r_buff1_thd2;
[L732]               0  _Bool y$read_delayed;
[L733]               0  int *y$read_delayed_var;
[L734]               0  int y$w_buff0;
[L735]               0  _Bool y$w_buff0_used;
[L736]               0  int y$w_buff1;
[L737]               0  _Bool y$w_buff1_used;
[L738]               0  _Bool weak$$choice0;
[L739]               0  _Bool weak$$choice2;
[L831]               0  pthread_t t0;
[L832]               0  //@ ghost multithreaded = 1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L832]  FCALL, FORK  0  pthread_create(&t0, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L833]               0  pthread_t t1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L834]               0  //@ assert (((((((((((((((((!multithreaded || ((y$mem_tmp == 0) || (y$mem_tmp == 1))) && (!multithreaded || (y$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1)))) && (!multithreaded || (y$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (y$flush_delayed == (_Bool) 0))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || ((y$w_buff0 == 0) || (y$w_buff0 == 1)))) && (!multithreaded || ((y$w_buff1 == 0) || (y$w_buff1 == 1))));
[L834]  FCALL, FORK  0  pthread_create(&t1, ((void *)0), P1, ((void *)0))
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t0=-1, t1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L835]               0  //@ assert (((((((((((((((((!multithreaded || ((y$mem_tmp == 0) || (y$mem_tmp == 1))) && (!multithreaded || (y$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1)))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || ((__unbuffered_p0_EBX == 0) || (__unbuffered_p0_EBX == 1)))) && (!multithreaded || (y$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (y$flush_delayed == (_Bool) 0))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || ((y$w_buff0 == 0) || (y$w_buff0 == 1)))) && (!multithreaded || ((y$w_buff1 == 0) || (y$w_buff1 == 1))));
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t0=-1, t1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L743]               1  y$w_buff1 = y$w_buff0
[L744]               1  y$w_buff0 = 1
[L745]               1  y$w_buff1_used = y$w_buff0_used
[L746]               1  y$w_buff0_used = (_Bool)1
[L747]  CALL         1  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L19]   COND FALSE   1  !(!expression)
[L747]  RET          1  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L748]               1  y$r_buff1_thd0 = y$r_buff0_thd0
[L749]               1  y$r_buff1_thd1 = y$r_buff0_thd1
[L750]               1  y$r_buff1_thd2 = y$r_buff0_thd2
[L751]               1  y$r_buff0_thd1 = (_Bool)1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L754]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L755]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L756]               1  y$flush_delayed = weak$$choice2
[L757]               1  y$mem_tmp = y
[L758]               1  y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L759]               1  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L760]               1  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L761]               1  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L762]               1  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L763]               1  y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L764]               1  y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L765]               1  __unbuffered_p0_EAX = y
[L766]               1  y = y$flush_delayed ? y$mem_tmp : y
[L767]               1  y$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L770]               1  __unbuffered_p0_EBX = x
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L787]               2  x = 1
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L790]               2  __unbuffered_p1_EAX = x
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L793]               2  weak$$choice0 = __VERIFIER_nondet_bool()
[L794]               2  weak$$choice2 = __VERIFIER_nondet_bool()
[L795]               2  y$flush_delayed = weak$$choice2
[L796]               2  y$mem_tmp = y
[L797]               2  y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)
[L798]               2  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))
[L799]               2  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))
[L800]               2  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))
[L801]               2  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L802]               2  y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))
[L803]               2  y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L804]               2  __unbuffered_p1_EBX = y
[L805]               2  y = y$flush_delayed ? y$mem_tmp : y
[L806]               2  y$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L809]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L810]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L811]               2  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L812]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L813]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L816]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L818]               2  return 0;
[L773]               1  y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L774]               1  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L775]               1  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L776]               1  y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L777]               1  y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L780]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L836]               0  main$tmp_guard0 = __unbuffered_cnt == 2
        VAL             [\old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0=-1, t1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L838]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L4]    COND FALSE   0  !(!cond)
[L838]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L840]               0  y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L841]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L842]               0  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L843]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L844]               0  y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
        VAL             [\old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0=-1, t1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L847]               0  main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0)
        VAL             [\old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0=-1, t1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L849]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L19]   COND TRUE    0  !expression
        VAL             [\old(arg)={0:0}, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L19]                0  reach_error()
        VAL             [\old(arg)={0:0}, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1]

  - UnprovableResult [Line: 834]: Unable to prove that invariant of correctness witness holds
    Unable to prove that invariant of correctness witness holds
 Reason: Not analyzed. 
  - UnprovableResult [Line: 835]: Unable to prove that invariant of correctness witness holds
    Unable to prove that invariant of correctness witness holds
 Reason: Not analyzed. 
  - UnprovableResult [Line: 834]: 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: 832]: 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, 56 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 1.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 109 ConstructedInterpolants, 0 QuantifiedInterpolants, 2302 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-08-14 04:21:26,813 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-08-14 04:21:27,011 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE