This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m
[2024-10-16 13:17:49,033 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-10-16 13:17:49,110 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf
[2024-10-16 13:17:49,114 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-10-16 13:17:49,114 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-16 13:17:49,138 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-16 13:17:49,139 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-16 13:17:49,139 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-16 13:17:49,140 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-16 13:17:49,140 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-16 13:17:49,141 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-16 13:17:49,141 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-10-16 13:17:49,142 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-10-16 13:17:49,142 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-16 13:17:49,142 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-10-16 13:17:49,143 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-10-16 13:17:49,143 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-10-16 13:17:49,143 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-10-16 13:17:49,143 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-10-16 13:17:49,144 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-10-16 13:17:49,147 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-16 13:17:49,147 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-10-16 13:17:49,148 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-10-16 13:17:49,150 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-10-16 13:17:49,151 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-10-16 13:17:49,151 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-10-16 13:17:49,151 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-16 13:17:49,151 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-10-16 13:17:49,152 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-10-16 13:17:49,152 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-10-16 13:17:49,152 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-10-16 13:17:49,152 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-16 13:17:49,153 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-10-16 13:17:49,153 INFO  L153        SettingsManager]:  * DFS Order used in POR=LOOP_LOCKSTEP
[2024-10-16 13:17:49,153 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-16 13:17:49,156 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-16 13:17:49,156 INFO  L153        SettingsManager]:  * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER
[2024-10-16 13:17:49,156 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-16 13:17:49,157 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-10-16 13:17:49,157 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2024-10-16 13:17:49,157 INFO  L153        SettingsManager]:  * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE
[2024-10-16 13:17:49,157 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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7ff9a02e3a4860dd4559a47ff1369af4fea93a232a0eb144fdecc9bc5971fe5b
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> COUNTEREXAMPLE
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: TraceCheck mode for conditional commutativity -> SYMBOLIC_RELATION
[2024-10-16 13:17:49,489 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-16 13:17:49,514 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-16 13:17:49,517 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-16 13:17:49,518 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-10-16 13:17:49,518 INFO  L274        PluginConnector]: CDTParser initialized
[2024-10-16 13:17:49,519 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/safe014_power.oepc.i
[2024-10-16 13:17:51,002 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-10-16 13:17:51,295 INFO  L384              CDTParser]: Found 1 translation units.
[2024-10-16 13:17:51,296 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe014_power.oepc.i
[2024-10-16 13:17:51,314 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8b6011fe0/0f20f46ac5454002aca38db1b634b6a3/FLAG5dfd4c122
[2024-10-16 13:17:51,333 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8b6011fe0/0f20f46ac5454002aca38db1b634b6a3
[2024-10-16 13:17:51,335 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-16 13:17:51,337 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-10-16 13:17:51,339 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-16 13:17:51,340 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-16 13:17:51,345 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-16 13:17:51,346 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:17:51" (1/1) ...
[2024-10-16 13:17:51,348 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6596db0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:17:51, skipping insertion in model container
[2024-10-16 13:17:51,348 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:17:51" (1/1) ...
[2024-10-16 13:17:51,405 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-10-16 13:17:51,610 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/safe014_power.oepc.i[995,1008]
[2024-10-16 13:17:51,814 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-10-16 13:17:51,832 INFO  L200         MainTranslator]: Completed pre-run
[2024-10-16 13:17:51,845 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/safe014_power.oepc.i[995,1008]
[2024-10-16 13:17:51,889 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-10-16 13:17:51,928 INFO  L204         MainTranslator]: Completed translation
[2024-10-16 13:17:51,928 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:17:51 WrapperNode
[2024-10-16 13:17:51,929 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-16 13:17:51,930 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-16 13:17:51,930 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-16 13:17:51,930 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-16 13:17:51,937 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:17:51" (1/1) ...
[2024-10-16 13:17:51,959 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:17:51" (1/1) ...
[2024-10-16 13:17:51,984 INFO  L138                Inliner]: procedures = 175, calls = 57, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125
[2024-10-16 13:17:51,984 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-16 13:17:51,985 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-16 13:17:51,985 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-16 13:17:51,985 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-10-16 13:17:51,995 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:17:51" (1/1) ...
[2024-10-16 13:17:51,995 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:17:51" (1/1) ...
[2024-10-16 13:17:51,998 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:17:51" (1/1) ...
[2024-10-16 13:17:51,999 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:17:51" (1/1) ...
[2024-10-16 13:17:52,007 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:17:51" (1/1) ...
[2024-10-16 13:17:52,009 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:17:51" (1/1) ...
[2024-10-16 13:17:52,014 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:17:51" (1/1) ...
[2024-10-16 13:17:52,015 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:17:51" (1/1) ...
[2024-10-16 13:17:52,023 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-16 13:17:52,024 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-16 13:17:52,024 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-10-16 13:17:52,024 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-10-16 13:17:52,029 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:17:51" (1/1) ...
[2024-10-16 13:17:52,034 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-10-16 13:17:52,046 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-10-16 13:17:52,060 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-10-16 13:17:52,062 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-10-16 13:17:52,096 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-10-16 13:17:52,096 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-10-16 13:17:52,096 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-10-16 13:17:52,096 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-16 13:17:52,096 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-10-16 13:17:52,096 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-10-16 13:17:52,096 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-10-16 13:17:52,097 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-10-16 13:17:52,097 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-10-16 13:17:52,097 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-10-16 13:17:52,097 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-10-16 13:17:52,097 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-10-16 13:17:52,097 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-16 13:17:52,097 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-16 13:17:52,099 WARN  L207             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-10-16 13:17:52,254 INFO  L238             CfgBuilder]: Building ICFG
[2024-10-16 13:17:52,259 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-16 13:17:52,671 INFO  L283             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-10-16 13:17:52,671 INFO  L287             CfgBuilder]: Performing block encoding
[2024-10-16 13:17:52,973 INFO  L309             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-16 13:17:52,974 INFO  L314             CfgBuilder]: Removed 0 assume(true) statements.
[2024-10-16 13:17:52,974 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:17:52 BoogieIcfgContainer
[2024-10-16 13:17:52,975 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-16 13:17:52,978 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-16 13:17:52,978 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-10-16 13:17:52,981 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-10-16 13:17:52,982 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:17:51" (1/3) ...
[2024-10-16 13:17:52,983 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0f65bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:17:52, skipping insertion in model container
[2024-10-16 13:17:52,983 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:17:51" (2/3) ...
[2024-10-16 13:17:52,983 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0f65bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:17:52, skipping insertion in model container
[2024-10-16 13:17:52,983 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:17:52" (3/3) ...
[2024-10-16 13:17:52,984 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe014_power.oepc.i
[2024-10-16 13:17:53,001 INFO  L209   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-16 13:17:53,002 INFO  L149   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-10-16 13:17:53,003 INFO  L484   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-10-16 13:17:53,054 INFO  L143    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-10-16 13:17:53,107 INFO  L106   denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-16 13:17:53,108 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2024-10-16 13:17:53,108 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-10-16 13:17:53,110 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-10-16 13:17:53,112 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-10-16 13:17:53,219 INFO  L194   artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2024-10-16 13:17:53,239 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 13:17:53,241 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ========
[2024-10-16 13:17:53,249 INFO  L333      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@7e116190, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=SYMBOLIC_RELATION, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false
[2024-10-16 13:17:53,249 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 4 error locations.
[2024-10-16 13:18:30,669 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-10-16 13:18:30,673 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 13:18:30,673 INFO  L85        PathProgramCache]: Analyzing trace with hash 82443899, now seen corresponding path program 1 times
[2024-10-16 13:18:30,681 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-16 13:18:30,681 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002990716]
[2024-10-16 13:18:30,681 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:18:30,682 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:18:30,932 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-16 13:18:31,645 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-16 13:18:31,646 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-16 13:18:31,647 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002990716]
[2024-10-16 13:18:31,647 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002990716] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-16 13:18:31,647 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-16 13:18:31,648 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-16 13:18:31,649 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049357004]
[2024-10-16 13:18:31,650 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-16 13:18:31,653 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-10-16 13:18:31,654 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-16 13:18:31,676 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-10-16 13:18:31,678 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-10-16 13:18:31,678 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-10-16 13:18:31,680 INFO  L471      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-16 13:18:31,681 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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-10-16 13:18:31,681 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-10-16 13:18:42,894 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-10-16 13:18:42,894 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-10-16 13:18:42,895 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-10-16 13:20:55,897 INFO  L85        PathProgramCache]: Analyzing trace with hash 317404626, now seen corresponding path program 1 times
[2024-10-16 13:20:55,898 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:20:55,898 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:20:56,003 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-16 13:20:56,321 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-16 13:20:56,321 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:20:56,321 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:20:56,421 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-16 13:20:56,687 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-16 13:20:56,691 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-16 13:20:56,692 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-16 13:20:56,692 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-10-16 13:20:56,692 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-10-16 13:20:56,693 INFO  L471      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-16 13:20:56,693 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-16 13:20:56,693 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-10-16 13:20:56,693 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-10-16 13:21:10,902 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-10-16 13:21:10,903 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 13:21:10,903 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1
[2024-10-16 13:21:10,903 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-10-16 13:21:10,954 INFO  L85        PathProgramCache]: Analyzing trace with hash 340541768, now seen corresponding path program 1 times
[2024-10-16 13:21:10,954 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:21:10,955 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:21:10,995 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:21:10,996 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 13:21:11,037 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:21:11,075 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 13:21:11,076 INFO  L85        PathProgramCache]: Analyzing trace with hash -2068281871, now seen corresponding path program 1 times
[2024-10-16 13:21:11,076 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-16 13:21:11,076 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442587079]
[2024-10-16 13:21:11,076 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:21:11,077 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:21:11,131 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-16 13:21:11,464 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-16 13:21:11,464 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-16 13:21:11,464 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442587079]
[2024-10-16 13:21:11,465 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442587079] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-16 13:21:11,465 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-16 13:21:11,465 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-10-16 13:21:11,465 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265250686]
[2024-10-16 13:21:11,465 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-16 13:21:11,467 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-16 13:21:11,467 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-16 13:21:11,468 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-16 13:21:11,468 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-10-16 13:21:11,468 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-10-16 13:21:11,468 INFO  L471      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-16 13:21:11,468 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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-10-16 13:21:11,469 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-10-16 13:21:11,469 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 13:21:11,469 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-10-16 13:21:28,253 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-10-16 13:21:28,253 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 13:21:28,253 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 13:21:28,254 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3
[2024-10-16 13:21:28,254 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-10-16 13:21:28,268 INFO  L85        PathProgramCache]: Analyzing trace with hash -491633072, now seen corresponding path program 1 times
[2024-10-16 13:21:28,268 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:21:28,268 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:21:28,302 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:21:28,303 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 13:21:28,337 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:21:28,414 INFO  L85        PathProgramCache]: Analyzing trace with hash -703398408, now seen corresponding path program 1 times
[2024-10-16 13:21:28,414 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:21:28,415 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:21:28,449 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:21:28,450 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 13:21:28,499 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:21:28,513 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 13:21:28,514 INFO  L85        PathProgramCache]: Analyzing trace with hash -1514358415, now seen corresponding path program 2 times
[2024-10-16 13:21:28,514 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-16 13:21:28,516 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372916767]
[2024-10-16 13:21:28,517 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:21:28,518 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:21:28,550 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-16 13:21:28,784 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-16 13:21:28,785 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-16 13:21:28,785 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372916767]
[2024-10-16 13:21:28,785 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372916767] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-16 13:21:28,786 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-16 13:21:28,786 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-10-16 13:21:28,786 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647696287]
[2024-10-16 13:21:28,786 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-16 13:21:28,787 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-16 13:21:28,788 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-16 13:21:28,788 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-16 13:21:28,788 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-10-16 13:21:28,789 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-10-16 13:21:28,789 INFO  L471      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-16 13:21:28,789 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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-10-16 13:21:28,789 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-10-16 13:21:28,793 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 13:21:28,793 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 13:21:28,793 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-10-16 13:21:29,079 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-10-16 13:21:29,081 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 13:21:29,081 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 13:21:29,081 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-10-16 13:21:29,082 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5
[2024-10-16 13:21:29,082 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-10-16 13:21:29,104 INFO  L85        PathProgramCache]: Analyzing trace with hash -1837060445, now seen corresponding path program 1 times
[2024-10-16 13:21:29,104 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:21:29,104 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:21:29,126 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:21:29,126 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 13:21:29,148 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:21:29,226 INFO  L85        PathProgramCache]: Analyzing trace with hash -858249190, now seen corresponding path program 1 times
[2024-10-16 13:21:29,227 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:21:29,227 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:21:29,275 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:21:29,278 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 13:21:29,311 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:21:29,322 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 13:21:29,322 INFO  L85        PathProgramCache]: Analyzing trace with hash 2004881447, now seen corresponding path program 3 times
[2024-10-16 13:21:29,322 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-16 13:21:29,323 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490419422]
[2024-10-16 13:21:29,323 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:21:29,323 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:21:29,360 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-16 13:21:29,599 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-16 13:21:29,600 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-16 13:21:29,600 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490419422]
[2024-10-16 13:21:29,601 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490419422] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-16 13:21:29,601 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-16 13:21:29,601 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-10-16 13:21:29,601 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046132345]
[2024-10-16 13:21:29,601 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-16 13:21:29,602 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-16 13:21:29,602 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-16 13:21:29,603 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-16 13:21:29,603 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-10-16 13:21:29,604 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-10-16 13:21:29,604 INFO  L471      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-16 13:21:29,604 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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-10-16 13:21:29,605 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-10-16 13:21:29,605 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 13:21:29,605 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 13:21:29,605 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. 
[2024-10-16 13:21:29,605 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-10-16 13:21:29,887 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-10-16 13:21:29,887 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 13:21:29,887 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 13:21:29,888 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-10-16 13:21:29,888 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-10-16 13:21:29,888 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable10,SelfDestructingSolverStorable9
[2024-10-16 13:21:29,888 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-10-16 13:21:29,902 INFO  L85        PathProgramCache]: Analyzing trace with hash 2031354521, now seen corresponding path program 1 times
[2024-10-16 13:21:29,903 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:21:29,903 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:21:29,935 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:21:29,936 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 13:21:29,970 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:21:30,046 INFO  L85        PathProgramCache]: Analyzing trace with hash -1311395700, now seen corresponding path program 1 times
[2024-10-16 13:21:30,047 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:21:30,047 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:21:30,073 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:21:30,074 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 13:21:30,105 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:21:30,116 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 13:21:30,117 INFO  L85        PathProgramCache]: Analyzing trace with hash 1621469259, now seen corresponding path program 4 times
[2024-10-16 13:21:30,117 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-16 13:21:30,117 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525278347]
[2024-10-16 13:21:30,117 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:21:30,118 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:21:30,144 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-16 13:21:30,366 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-16 13:21:30,366 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-16 13:21:30,366 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525278347]
[2024-10-16 13:21:30,366 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525278347] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-16 13:21:30,366 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-16 13:21:30,367 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-10-16 13:21:30,367 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974872394]
[2024-10-16 13:21:30,367 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-16 13:21:30,367 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-16 13:21:30,367 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-16 13:21:30,368 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-16 13:21:30,368 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-10-16 13:21:30,368 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-10-16 13:21:30,368 INFO  L471      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-16 13:21:30,369 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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-10-16 13:21:30,369 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-10-16 13:21:30,369 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 13:21:30,369 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 13:21:30,369 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. 
[2024-10-16 13:21:30,369 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. 
[2024-10-16 13:21:30,369 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-10-16 13:21:30,670 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-10-16 13:21:30,670 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 13:21:30,671 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 13:21:30,671 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-10-16 13:21:30,671 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-10-16 13:21:30,671 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-10-16 13:21:30,671 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13
[2024-10-16 13:21:30,672 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-10-16 13:21:30,693 INFO  L85        PathProgramCache]: Analyzing trace with hash -1325756974, now seen corresponding path program 1 times
[2024-10-16 13:21:30,693 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:21:30,693 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:21:30,725 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:21:30,726 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 13:21:30,747 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:21:30,822 INFO  L85        PathProgramCache]: Analyzing trace with hash -1630581666, now seen corresponding path program 1 times
[2024-10-16 13:21:30,825 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:21:30,826 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:21:30,862 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:21:30,863 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 13:21:30,900 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:21:30,909 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 13:21:30,909 INFO  L85        PathProgramCache]: Analyzing trace with hash 148306637, now seen corresponding path program 5 times
[2024-10-16 13:21:30,910 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-16 13:21:30,910 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547955001]
[2024-10-16 13:21:30,910 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:21:30,910 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:21:30,950 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:21:30,951 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 13:21:31,014 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:21:31,024 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-10-16 13:21:31,024 INFO  L332         BasicCegarLoop]: Counterexample is feasible
[2024-10-16 13:21:31,025 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining)
[2024-10-16 13:21:31,027 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining)
[2024-10-16 13:21:31,027 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining)
[2024-10-16 13:21:31,027 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining)
[2024-10-16 13:21:31,028 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16
[2024-10-16 13:21:31,036 INFO  L414         BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-16 13:21:31,147 INFO  L234   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-10-16 13:21:31,147 INFO  L165   ceAbstractionStarter]: Computing trace abstraction results
[2024-10-16 13:21:31,152 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:21:31 BasicIcfg
[2024-10-16 13:21:31,152 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-10-16 13:21:31,153 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-10-16 13:21:31,153 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-10-16 13:21:31,154 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-10-16 13:21:31,154 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:17:52" (3/4) ...
[2024-10-16 13:21:31,155 INFO  L133         WitnessPrinter]: Generating witness for reachability counterexample
[2024-10-16 13:21:31,248 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml
[2024-10-16 13:21:31,248 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-10-16 13:21:31,248 INFO  L158              Benchmark]: Toolchain (without parser) took 219911.49ms. Allocated memory was 67.1MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 45.0MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 307.6MB. Max. memory is 16.1GB.
[2024-10-16 13:21:31,249 INFO  L158              Benchmark]: CDTParser took 0.18ms. Allocated memory is still 44.0MB. Free memory is still 20.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-10-16 13:21:31,249 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 589.76ms. Allocated memory is still 67.1MB. Free memory was 44.8MB in the beginning and 37.5MB in the end (delta: 7.2MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB.
[2024-10-16 13:21:31,249 INFO  L158              Benchmark]: Boogie Procedure Inliner took 54.97ms. Allocated memory is still 67.1MB. Free memory was 37.5MB in the beginning and 35.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-16 13:21:31,249 INFO  L158              Benchmark]: Boogie Preprocessor took 38.01ms. Allocated memory is still 67.1MB. Free memory was 35.1MB in the beginning and 33.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-16 13:21:31,250 INFO  L158              Benchmark]: RCFGBuilder took 951.15ms. Allocated memory was 67.1MB in the beginning and 86.0MB in the end (delta: 18.9MB). Free memory was 33.0MB in the beginning and 42.1MB in the end (delta: -9.1MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB.
[2024-10-16 13:21:31,250 INFO  L158              Benchmark]: TraceAbstraction took 218174.26ms. Allocated memory was 86.0MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 41.2MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 265.0MB. Max. memory is 16.1GB.
[2024-10-16 13:21:31,250 INFO  L158              Benchmark]: Witness Printer took 95.33ms. Allocated memory is still 1.8GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
[2024-10-16 13:21:31,252 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.18ms. Allocated memory is still 44.0MB. Free memory is still 20.6MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 589.76ms. Allocated memory is still 67.1MB. Free memory was 44.8MB in the beginning and 37.5MB in the end (delta: 7.2MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 54.97ms. Allocated memory is still 67.1MB. Free memory was 37.5MB in the beginning and 35.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 38.01ms. Allocated memory is still 67.1MB. Free memory was 35.1MB in the beginning and 33.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 951.15ms. Allocated memory was 67.1MB in the beginning and 86.0MB in the end (delta: 18.9MB). Free memory was 33.0MB in the beginning and 42.1MB in the end (delta: -9.1MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB.
 * TraceAbstraction took 218174.26ms. Allocated memory was 86.0MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 41.2MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 265.0MB. Max. memory is 16.1GB.
 * Witness Printer took 95.33ms. Allocated memory is still 1.8GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: Partial order reduction statistics
    Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14295, independent: 13784, independent conditional: 13195, independent unconditional: 589, dependent: 511, dependent conditional: 479, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14288, independent: 13784, independent conditional: 13195, independent unconditional: 589, dependent: 504, dependent conditional: 473, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14288, independent: 13784, independent conditional: 13195, independent unconditional: 589, dependent: 504, dependent conditional: 473, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14288, independent: 13784, independent conditional: 13195, independent unconditional: 589, dependent: 504, dependent conditional: 473, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17689, independent: 13784, independent conditional: 13195, independent unconditional: 589, dependent: 3905, dependent conditional: 3843, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17689, independent: 13784, independent conditional: 499, independent unconditional: 13285, dependent: 3905, dependent conditional: 354, dependent unconditional: 3551, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17689, independent: 13784, independent conditional: 499, independent unconditional: 13285, dependent: 3905, dependent conditional: 354, dependent unconditional: 3551, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 650, independent: 599, independent conditional: 10, independent unconditional: 589, dependent: 51, dependent conditional: 20, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 650, independent: 581, independent conditional: 0, independent unconditional: 581, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 69, independent: 18, independent conditional: 10, independent unconditional: 8, dependent: 51, dependent conditional: 20, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 69, independent: 18, independent conditional: 10, independent unconditional: 8, dependent: 51, dependent conditional: 20, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 84276, independent: 304, independent conditional: 157, independent unconditional: 147, dependent: 83972, dependent conditional: 10683, dependent unconditional: 73290, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 17689, independent: 13185, independent conditional: 489, independent unconditional: 12696, dependent: 3854, dependent conditional: 334, dependent unconditional: 3520, unknown: 650, unknown conditional: 30, unknown unconditional: 620] , Statistics on independence cache: Total cache size (in pairs): 650, Positive cache size: 599, Positive conditional cache size: 10, Positive unconditional cache size: 589, Negative cache size: 51, Negative conditional cache size: 20, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16185, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17689, independent: 13784, independent conditional: 13195, independent unconditional: 589, dependent: 3905, dependent conditional: 3843, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17689, independent: 13784, independent conditional: 499, independent unconditional: 13285, dependent: 3905, dependent conditional: 354, dependent unconditional: 3551, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17689, independent: 13784, independent conditional: 499, independent unconditional: 13285, dependent: 3905, dependent conditional: 354, dependent unconditional: 3551, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 650, independent: 599, independent conditional: 10, independent unconditional: 589, dependent: 51, dependent conditional: 20, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 650, independent: 581, independent conditional: 0, independent unconditional: 581, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 69, independent: 18, independent conditional: 10, independent unconditional: 8, dependent: 51, dependent conditional: 20, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 69, independent: 18, independent conditional: 10, independent unconditional: 8, dependent: 51, dependent conditional: 20, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 84276, independent: 304, independent conditional: 157, independent unconditional: 147, dependent: 83972, dependent conditional: 10683, dependent unconditional: 73290, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 17689, independent: 13185, independent conditional: 489, independent unconditional: 12696, dependent: 3854, dependent conditional: 334, dependent unconditional: 3520, unknown: 650, unknown conditional: 30, unknown unconditional: 620] , Statistics on independence cache: Total cache size (in pairs): 650, Positive cache size: 599, Positive conditional cache size: 10, Positive unconditional cache size: 589, Negative cache size: 51, Negative conditional cache size: 20, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16185 ], Independence queries for same thread: 7, Persistent sets #1 benchmarks: Persistent set computation time: 73.6s, Number of persistent set computation: 576, Number of trivial persistent sets: 327, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 620, independent: 589, independent conditional: 0, independent unconditional: 589, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14295, independent: 13784, independent conditional: 13195, independent unconditional: 589, dependent: 511, dependent conditional: 479, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14288, independent: 13784, independent conditional: 13195, independent unconditional: 589, dependent: 504, dependent conditional: 473, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14288, independent: 13784, independent conditional: 13195, independent unconditional: 589, dependent: 504, dependent conditional: 473, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 14288, independent: 13784, independent conditional: 13195, independent unconditional: 589, dependent: 504, dependent conditional: 473, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17689, independent: 13784, independent conditional: 13195, independent unconditional: 589, dependent: 3905, dependent conditional: 3843, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17689, independent: 13784, independent conditional: 499, independent unconditional: 13285, dependent: 3905, dependent conditional: 354, dependent unconditional: 3551, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17689, independent: 13784, independent conditional: 499, independent unconditional: 13285, dependent: 3905, dependent conditional: 354, dependent unconditional: 3551, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 650, independent: 599, independent conditional: 10, independent unconditional: 589, dependent: 51, dependent conditional: 20, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 650, independent: 581, independent conditional: 0, independent unconditional: 581, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 69, independent: 18, independent conditional: 10, independent unconditional: 8, dependent: 51, dependent conditional: 20, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 69, independent: 18, independent conditional: 10, independent unconditional: 8, dependent: 51, dependent conditional: 20, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 84276, independent: 304, independent conditional: 157, independent unconditional: 147, dependent: 83972, dependent conditional: 10683, dependent unconditional: 73290, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 17689, independent: 13185, independent conditional: 489, independent unconditional: 12696, dependent: 3854, dependent conditional: 334, dependent unconditional: 3520, unknown: 650, unknown conditional: 30, unknown unconditional: 620] , Statistics on independence cache: Total cache size (in pairs): 650, Positive cache size: 599, Positive conditional cache size: 10, Positive unconditional cache size: 589, Negative cache size: 51, Negative conditional cache size: 20, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16185, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17689, independent: 13784, independent conditional: 13195, independent unconditional: 589, dependent: 3905, dependent conditional: 3843, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17689, independent: 13784, independent conditional: 499, independent unconditional: 13285, dependent: 3905, dependent conditional: 354, dependent unconditional: 3551, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17689, independent: 13784, independent conditional: 499, independent unconditional: 13285, dependent: 3905, dependent conditional: 354, dependent unconditional: 3551, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 650, independent: 599, independent conditional: 10, independent unconditional: 589, dependent: 51, dependent conditional: 20, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 650, independent: 581, independent conditional: 0, independent unconditional: 581, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 69, independent: 18, independent conditional: 10, independent unconditional: 8, dependent: 51, dependent conditional: 20, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 69, independent: 18, independent conditional: 10, independent unconditional: 8, dependent: 51, dependent conditional: 20, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 84276, independent: 304, independent conditional: 157, independent unconditional: 147, dependent: 83972, dependent conditional: 10683, dependent unconditional: 73290, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 17689, independent: 13185, independent conditional: 489, independent unconditional: 12696, dependent: 3854, dependent conditional: 334, dependent unconditional: 3520, unknown: 650, unknown conditional: 30, unknown unconditional: 620] , Statistics on independence cache: Total cache size (in pairs): 650, Positive cache size: 599, Positive conditional cache size: 10, Positive unconditional cache size: 589, Negative cache size: 51, Negative conditional cache size: 20, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16185 ], Independence queries for same thread: 7
  - CounterExampleResult [Line: 19]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L710]               0  int __unbuffered_cnt = 0;
[L712]               0  int __unbuffered_p0_EAX = 0;
[L713]               0  _Bool __unbuffered_p0_EAX$flush_delayed;
[L714]               0  int __unbuffered_p0_EAX$mem_tmp;
[L715]               0  _Bool __unbuffered_p0_EAX$r_buff0_thd0;
[L716]               0  _Bool __unbuffered_p0_EAX$r_buff0_thd1;
[L717]               0  _Bool __unbuffered_p0_EAX$r_buff0_thd2;
[L718]               0  _Bool __unbuffered_p0_EAX$r_buff0_thd3;
[L719]               0  _Bool __unbuffered_p0_EAX$r_buff1_thd0;
[L720]               0  _Bool __unbuffered_p0_EAX$r_buff1_thd1;
[L721]               0  _Bool __unbuffered_p0_EAX$r_buff1_thd2;
[L722]               0  _Bool __unbuffered_p0_EAX$r_buff1_thd3;
[L723]               0  _Bool __unbuffered_p0_EAX$read_delayed;
[L724]               0  int *__unbuffered_p0_EAX$read_delayed_var;
[L725]               0  int __unbuffered_p0_EAX$w_buff0;
[L726]               0  _Bool __unbuffered_p0_EAX$w_buff0_used;
[L727]               0  int __unbuffered_p0_EAX$w_buff1;
[L728]               0  _Bool __unbuffered_p0_EAX$w_buff1_used;
[L730]               0  int __unbuffered_p0_EBX = 0;
[L732]               0  int __unbuffered_p2_EAX = 0;
[L733]               0  _Bool main$tmp_guard0;
[L734]               0  _Bool main$tmp_guard1;
[L736]               0  int x = 0;
[L738]               0  int y = 0;
[L739]               0  _Bool y$flush_delayed;
[L740]               0  int y$mem_tmp;
[L741]               0  _Bool y$r_buff0_thd0;
[L742]               0  _Bool y$r_buff0_thd1;
[L743]               0  _Bool y$r_buff0_thd2;
[L744]               0  _Bool y$r_buff0_thd3;
[L745]               0  _Bool y$r_buff1_thd0;
[L746]               0  _Bool y$r_buff1_thd1;
[L747]               0  _Bool y$r_buff1_thd2;
[L748]               0  _Bool y$r_buff1_thd3;
[L749]               0  _Bool y$read_delayed;
[L750]               0  int *y$read_delayed_var;
[L751]               0  int y$w_buff0;
[L752]               0  _Bool y$w_buff0_used;
[L753]               0  int y$w_buff1;
[L754]               0  _Bool y$w_buff1_used;
[L755]               0  _Bool weak$$choice0;
[L756]               0  _Bool weak$$choice1;
[L757]               0  _Bool weak$$choice2;
[L835]               0  pthread_t t2097;
[L836]  FCALL, FORK  0  pthread_create(&t2097, ((void *)0), P0, ((void *)0))
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2097=-2, weak$$choice0=0, weak$$choice1=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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={3:0}]
[L837]               0  pthread_t t2098;
[L838]  FCALL, FORK  0  pthread_create(&t2098, ((void *)0), P1, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2097=-2, t2098=-1, weak$$choice0=0, weak$$choice1=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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={3:0}]
[L839]               0  pthread_t t2099;
[L840]  FCALL, FORK  0  pthread_create(&t2099, ((void *)0), P2, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2097=-2, t2098=-1, t2099=0, weak$$choice0=0, weak$$choice1=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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={3:0}]
[L761]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L762]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L763]               1  y$flush_delayed = weak$$choice2
[L764]  EXPR         1  \read(y)
[L764]               1  y$mem_tmp = y
[L765]               1  weak$$choice1 = __VERIFIER_nondet_bool()
[L766]  EXPR         1  !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y))))
[L766]  EXPR         1  \read(y)
[L766]  EXPR         1  !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y))))
[L766]               1  y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y))))
[L767]               1  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))))
[L768]               1  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))))
[L769]               1  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0))))
[L770]               1  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))))
[L771]               1  y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))))
[L772]               1  y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))))
[L773]               1  __unbuffered_p0_EAX$read_delayed = (_Bool)1
[L774]               1  __unbuffered_p0_EAX$read_delayed_var = &y
[L775]  EXPR         1  \read(y)
[L775]               1  __unbuffered_p0_EAX = y
[L776]  EXPR         1  y$flush_delayed ? y$mem_tmp : y
[L776]               1  y = y$flush_delayed ? y$mem_tmp : y
[L777]               1  y$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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={3:0}]
[L780]               1  __unbuffered_p0_EBX = x
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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={3:0}]
[L792]               2  x = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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={3:0}]
[L795]               2  x = 2
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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={3:0}]
[L800]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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={3:0}]
[L802]               2  return 0;
[L807]               3  __unbuffered_p2_EAX = x
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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={3:0}]
[L810]               3  y = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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={3:0}]
[L813]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L813]  EXPR         3  y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y
[L813]  EXPR         3  \read(y)
[L813]  EXPR         3  y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y
[L813]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L813]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L814]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L815]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L816]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L817]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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={3:0}]
[L820]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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={3:0}]
[L822]               3  return 0;
[L785]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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={3:0}]
[L842]               0  main$tmp_guard0 = __unbuffered_cnt == 3
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2097=-2, t2098=-1, t2099=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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={3:0}]
[L844]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L4]    COND FALSE   0  !(!cond)
[L844]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L846]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L846]  EXPR         0  y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L846]  EXPR         0  \read(y)
[L846]  EXPR         0  y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L846]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L846]               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)
[L847]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L848]               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
[L849]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L850]               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}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2097=-2, t2098=-1, t2099=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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={3:0}]
[L853]               0  weak$$choice1 = __VERIFIER_nondet_bool()
[L854]  EXPR         0  __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L854]  EXPR         0  weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX
[L854]  EXPR         0  \read(*__unbuffered_p0_EAX$read_delayed_var)
[L854]  EXPR         0  weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX
[L854]  EXPR         0  __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L854]               0  __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L855]               0  main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2)
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2097=-2, t2098=-1, t2099=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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={3:0}]
[L857]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L19]   COND TRUE    0  !expression
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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={3:0}]
[L19]                0  reach_error()
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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={3:0}]

  - UnprovableResult [Line: 838]: 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: 840]: 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: 836]: 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 7 procedures, 62 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 217.8s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 80.5s, 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: 37, 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.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 529 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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, ConComCheckerStatistics: ConditionalCommutativityOverallTime: 134.9s, ConditionalCommutativityCheckTime: 134.9s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityCommutingCounterexamples: 1, ConditionalCommutativityConditionCalculations: 17, ConditionalCommutativityTraceChecks: 10, ConditionalCommutativityImperfectProofs: 0
RESULT: Ultimate proved your program to be incorrect!
[2024-10-16 13:21:31,294 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-10-16 13:21:31,481 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...