This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m
[2024-10-16 13:08:05,145 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-10-16 13:08:05,211 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf
[2024-10-16 13:08:05,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-10-16 13:08:05,218 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-16 13:08:05,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-16 13:08:05,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-16 13:08:05,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-16 13:08:05,254 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-16 13:08:05,254 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-16 13:08:05,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-16 13:08:05,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-10-16 13:08:05,256 INFO L153 SettingsManager]: * Use SBE=true
[2024-10-16 13:08:05,259 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-16 13:08:05,260 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-10-16 13:08:05,260 INFO L153 SettingsManager]: * sizeof long=4
[2024-10-16 13:08:05,260 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-10-16 13:08:05,261 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-10-16 13:08:05,261 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-10-16 13:08:05,261 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-10-16 13:08:05,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-16 13:08:05,263 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-10-16 13:08:05,263 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-10-16 13:08:05,264 INFO L153 SettingsManager]: * sizeof long double=12
[2024-10-16 13:08:05,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-10-16 13:08:05,264 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-10-16 13:08:05,264 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-16 13:08:05,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-10-16 13:08:05,265 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-10-16 13:08:05,265 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-10-16 13:08:05,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-10-16 13:08:05,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-16 13:08:05,266 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-10-16 13:08:05,266 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP
[2024-10-16 13:08:05,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-16 13:08:05,268 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-16 13:08:05,268 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER
[2024-10-16 13:08:05,268 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-16 13:08:05,268 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-10-16 13:08:05,268 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2024-10-16 13:08:05,269 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE
[2024-10-16 13:08:05,270 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 -> 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf
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:08:05,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-16 13:08:05,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-16 13:08:05,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-16 13:08:05,610 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-10-16 13:08:05,610 INFO L274 PluginConnector]: CDTParser initialized
[2024-10-16 13:08:05,611 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-10-16 13:08:07,122 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-10-16 13:08:07,371 INFO L384 CDTParser]: Found 1 translation units.
[2024-10-16 13:08:07,371 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-10-16 13:08:07,391 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/20ca9759e/2aa81d4c35204142b379054157ad6102/FLAG5a0a99ac2
[2024-10-16 13:08:07,708 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/20ca9759e/2aa81d4c35204142b379054157ad6102
[2024-10-16 13:08:07,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-16 13:08:07,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-10-16 13:08:07,714 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-16 13:08:07,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-16 13:08:07,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-16 13:08:07,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:08:07" (1/1) ...
[2024-10-16 13:08:07,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6edabd7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:08:07, skipping insertion in model container
[2024-10-16 13:08:07,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:08:07" (1/1) ...
[2024-10-16 13:08:07,766 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-10-16 13:08:07,968 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/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999]
[2024-10-16 13:08:08,206 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-16 13:08:08,218 INFO L200 MainTranslator]: Completed pre-run
[2024-10-16 13:08:08,230 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/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[986,999]
[2024-10-16 13:08:08,294 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-16 13:08:08,342 INFO L204 MainTranslator]: Completed translation
[2024-10-16 13:08:08,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:08:08 WrapperNode
[2024-10-16 13:08:08,343 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-16 13:08:08,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-16 13:08:08,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-16 13:08:08,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-16 13:08:08,353 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:08:08" (1/1) ...
[2024-10-16 13:08:08,376 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:08:08" (1/1) ...
[2024-10-16 13:08:08,413 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134
[2024-10-16 13:08:08,416 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-16 13:08:08,417 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-16 13:08:08,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-16 13:08:08,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-10-16 13:08:08,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:08:08" (1/1) ...
[2024-10-16 13:08:08,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:08:08" (1/1) ...
[2024-10-16 13:08:08,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:08:08" (1/1) ...
[2024-10-16 13:08:08,434 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:08:08" (1/1) ...
[2024-10-16 13:08:08,450 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:08:08" (1/1) ...
[2024-10-16 13:08:08,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:08:08" (1/1) ...
[2024-10-16 13:08:08,458 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:08:08" (1/1) ...
[2024-10-16 13:08:08,459 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:08:08" (1/1) ...
[2024-10-16 13:08:08,467 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-16 13:08:08,468 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-16 13:08:08,469 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-10-16 13:08:08,469 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-10-16 13:08:08,472 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:08:08" (1/1) ...
[2024-10-16 13:08:08,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-10-16 13:08:08,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-10-16 13:08:08,512 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:08:08,515 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:08:08,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-10-16 13:08:08,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-16 13:08:08,552 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-10-16 13:08:08,552 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-10-16 13:08:08,553 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-10-16 13:08:08,553 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-10-16 13:08:08,553 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2024-10-16 13:08:08,553 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2024-10-16 13:08:08,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2024-10-16 13:08:08,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-10-16 13:08:08,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-16 13:08:08,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-16 13:08:08,555 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:08:08,678 INFO L238 CfgBuilder]: Building ICFG
[2024-10-16 13:08:08,680 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-16 13:08:09,056 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-10-16 13:08:09,056 INFO L287 CfgBuilder]: Performing block encoding
[2024-10-16 13:08:09,337 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-16 13:08:09,337 INFO L314 CfgBuilder]: Removed 0 assume(true) statements.
[2024-10-16 13:08:09,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:08:09 BoogieIcfgContainer
[2024-10-16 13:08:09,338 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-16 13:08:09,341 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-16 13:08:09,341 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-10-16 13:08:09,346 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-10-16 13:08:09,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:08:07" (1/3) ...
[2024-10-16 13:08:09,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a514f3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:08:09, skipping insertion in model container
[2024-10-16 13:08:09,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:08:08" (2/3) ...
[2024-10-16 13:08:09,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a514f3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:08:09, skipping insertion in model container
[2024-10-16 13:08:09,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:08:09" (3/3) ...
[2024-10-16 13:08:09,350 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-10-16 13:08:09,366 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-16 13:08:09,367 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2024-10-16 13:08:09,369 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-10-16 13:08:09,421 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-10-16 13:08:09,464 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-16 13:08:09,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2024-10-16 13:08:09,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-10-16 13:08:09,467 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:08:09,469 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:08:09,570 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2024-10-16 13:08:09,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 13:08:09,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ========
[2024-10-16 13:08:09,599 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;@27a297da, 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:08:09,600 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations.
[2024-10-16 13:08:46,917 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:08:46,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 13:08:46,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1781794813, now seen corresponding path program 1 times
[2024-10-16 13:08:46,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-16 13:08:46,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056541322]
[2024-10-16 13:08:46,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:08:46,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:08:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-16 13:08:48,027 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:08:48,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-16 13:08:48,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056541322]
[2024-10-16 13:08:48,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056541322] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-16 13:08:48,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-16 13:08:48,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-10-16 13:08:48,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690112297]
[2024-10-16 13:08:48,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-16 13:08:48,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-16 13:08:48,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-16 13:08:48,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-16 13:08:48,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-10-16 13:08:48,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-16 13:08:48,064 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-16 13:08:48,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 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:08:48,065 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-16 13:08:51,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-16 13:08:51,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-10-16 13:08:51,503 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:08:51,579 INFO L85 PathProgramCache]: Analyzing trace with hash 304833036, now seen corresponding path program 1 times
[2024-10-16 13:08:51,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:08:51,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:08:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:08:51,749 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 13:08:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:08:51,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 13:08:51,893 INFO L85 PathProgramCache]: Analyzing trace with hash 197752045, now seen corresponding path program 1 times
[2024-10-16 13:08:51,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-16 13:08:51,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556066811]
[2024-10-16 13:08:51,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:08:51,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:08:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-16 13:08:52,479 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:08:52,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-16 13:08:52,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556066811]
[2024-10-16 13:08:52,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556066811] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-16 13:08:52,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-16 13:08:52,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-10-16 13:08:52,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395840586]
[2024-10-16 13:08:52,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-16 13:08:52,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-16 13:08:52,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-16 13:08:52,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-16 13:08:52,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-10-16 13:08:52,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-16 13:08:52,485 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-16 13:08:52,486 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:08:52,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-10-16 13:08:52,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-16 13:10:08,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-16 13:10:08,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-16 13:10:08,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1
[2024-10-16 13:10:08,604 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:10:08,620 INFO L85 PathProgramCache]: Analyzing trace with hash -470465264, now seen corresponding path program 1 times
[2024-10-16 13:10:08,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:10:08,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:10:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:10:08,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 13:10:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:10:08,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1770741598, now seen corresponding path program 1 times
[2024-10-16 13:10:08,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:10:08,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:10:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:10:08,864 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 13:10:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:10:08,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 13:10:08,954 INFO L85 PathProgramCache]: Analyzing trace with hash -696852291, now seen corresponding path program 2 times
[2024-10-16 13:10:08,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-16 13:10:08,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488184446]
[2024-10-16 13:10:08,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:10:08,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:10:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-16 13:10:10,000 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:10:10,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-16 13:10:10,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488184446]
[2024-10-16 13:10:10,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488184446] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-16 13:10:10,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-16 13:10:10,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-10-16 13:10:10,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350593598]
[2024-10-16 13:10:10,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-16 13:10:10,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-10-16 13:10:10,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-16 13:10:10,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-10-16 13:10:10,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-10-16 13:10:10,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-16 13:10:10,006 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-16 13:10:10,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) 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:10:10,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-10-16 13:10:10,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-10-16 13:10:10,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-16 13:10:16,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-16 13:10:16,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-16 13:10:16,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-16 13:10:16,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable5
[2024-10-16 13:10:16,013 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:10:21,827 INFO L85 PathProgramCache]: Analyzing trace with hash 44828864, now seen corresponding path program 1 times
[2024-10-16 13:10:21,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:10:21,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:10:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-16 13:10:21,922 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:10:21,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:10:21,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:10:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-16 13:10:22,012 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:10:22,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-16 13:10:22,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-16 13:10:22,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-16 13:10:22,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-16 13:10:22,015 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-10-16 13:10:22,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 1 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-10-16 13:10:22,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-10-16 13:10:22,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-10-16 13:10:22,016 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-10-16 13:10:22,016 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-10-16 13:11:19,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-16 13:11:19,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-16 13:11:19,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-16 13:11:19,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-10-16 13:11:19,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,SelfDestructingSolverStorable6
[2024-10-16 13:11:19,342 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:11:19,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1389688939, now seen corresponding path program 1 times
[2024-10-16 13:11:19,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:11:19,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:11:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:11:19,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 13:11:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:11:19,444 INFO L85 PathProgramCache]: Analyzing trace with hash 85988791, now seen corresponding path program 1 times
[2024-10-16 13:11:19,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:11:19,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:11:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:11:19,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 13:11:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:11:19,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-16 13:11:19,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1586604877, now seen corresponding path program 3 times
[2024-10-16 13:11:19,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-16 13:11:19,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788971805]
[2024-10-16 13:11:19,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-16 13:11:19,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-16 13:11:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:11:19,672 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-16 13:11:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-16 13:11:19,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-10-16 13:11:19,771 INFO L332 BasicCegarLoop]: Counterexample is feasible
[2024-10-16 13:11:19,773 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining)
[2024-10-16 13:11:19,775 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining)
[2024-10-16 13:11:19,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining)
[2024-10-16 13:11:19,776 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining)
[2024-10-16 13:11:19,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable10,SelfDestructingSolverStorable9
[2024-10-16 13:11:19,785 INFO L414 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1]
[2024-10-16 13:11:19,790 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2)
[2024-10-16 13:11:19,869 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-10-16 13:11:19,869 INFO L165 ceAbstractionStarter]: Computing trace abstraction results
[2024-10-16 13:11:19,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:11:19 BasicIcfg
[2024-10-16 13:11:19,872 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-10-16 13:11:19,873 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-10-16 13:11:19,873 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-10-16 13:11:19,873 INFO L274 PluginConnector]: Witness Printer initialized
[2024-10-16 13:11:19,874 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:08:09" (3/4) ...
[2024-10-16 13:11:19,874 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample
[2024-10-16 13:11:19,954 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml
[2024-10-16 13:11:19,955 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-10-16 13:11:19,955 INFO L158 Benchmark]: Toolchain (without parser) took 192243.80ms. Allocated memory was 77.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 44.1MB in the beginning and 641.4MB in the end (delta: -597.3MB). Peak memory consumption was 835.6MB. Max. memory is 16.1GB.
[2024-10-16 13:11:19,955 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 54.5MB. Free memory is still 37.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-10-16 13:11:19,956 INFO L158 Benchmark]: CACSL2BoogieTranslator took 630.94ms. Allocated memory is still 77.6MB. Free memory was 43.9MB in the beginning and 35.1MB in the end (delta: 8.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2024-10-16 13:11:19,956 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.08ms. Allocated memory is still 77.6MB. Free memory was 35.1MB in the beginning and 32.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-16 13:11:19,956 INFO L158 Benchmark]: Boogie Preprocessor took 50.38ms. Allocated memory is still 77.6MB. Free memory was 32.3MB in the beginning and 29.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-16 13:11:19,957 INFO L158 Benchmark]: RCFGBuilder took 870.50ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 29.8MB in the beginning and 56.8MB in the end (delta: -27.0MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB.
[2024-10-16 13:11:19,957 INFO L158 Benchmark]: TraceAbstraction took 190531.32ms. Allocated memory was 94.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 55.5MB in the beginning and 656.1MB in the end (delta: -600.6MB). Peak memory consumption was 815.9MB. Max. memory is 16.1GB.
[2024-10-16 13:11:19,957 INFO L158 Benchmark]: Witness Printer took 81.74ms. Allocated memory is still 1.5GB. Free memory was 655.1MB in the beginning and 641.4MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB.
[2024-10-16 13:11:19,959 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.09ms. Allocated memory is still 54.5MB. Free memory is still 37.5MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 630.94ms. Allocated memory is still 77.6MB. Free memory was 43.9MB in the beginning and 35.1MB in the end (delta: 8.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 71.08ms. Allocated memory is still 77.6MB. Free memory was 35.1MB in the beginning and 32.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 50.38ms. Allocated memory is still 77.6MB. Free memory was 32.3MB in the beginning and 29.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 870.50ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 29.8MB in the beginning and 56.8MB in the end (delta: -27.0MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB.
* TraceAbstraction took 190531.32ms. Allocated memory was 94.4MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 55.5MB in the beginning and 656.1MB in the end (delta: -600.6MB). Peak memory consumption was 815.9MB. Max. memory is 16.1GB.
* Witness Printer took 81.74ms. Allocated memory is still 1.5GB. Free memory was 655.1MB in the beginning and 641.4MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. 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: 19277, independent: 17294, independent conditional: 16690, independent unconditional: 604, dependent: 1983, dependent conditional: 1932, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18896, independent: 17294, independent conditional: 16690, independent unconditional: 604, dependent: 1602, dependent conditional: 1552, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18896, independent: 17294, independent conditional: 16690, independent unconditional: 604, dependent: 1602, dependent conditional: 1552, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18896, independent: 17294, independent conditional: 16690, independent unconditional: 604, dependent: 1602, dependent conditional: 1552, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26565, independent: 17294, independent conditional: 16690, independent unconditional: 604, dependent: 9271, dependent conditional: 9171, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26565, independent: 17294, independent conditional: 710, independent unconditional: 16584, dependent: 9271, dependent conditional: 531, dependent unconditional: 8740, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26565, independent: 17294, independent conditional: 710, independent unconditional: 16584, dependent: 9271, dependent conditional: 531, dependent unconditional: 8740, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 703, independent: 616, independent conditional: 12, independent unconditional: 604, dependent: 87, dependent conditional: 33, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 703, independent: 596, independent conditional: 0, independent unconditional: 596, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 107, independent: 20, independent conditional: 12, independent unconditional: 8, dependent: 87, dependent conditional: 33, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 107, independent: 20, independent conditional: 12, independent unconditional: 8, dependent: 87, dependent conditional: 33, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 180225, independent: 2887, independent conditional: 2721, independent unconditional: 165, dependent: 177338, dependent conditional: 61576, dependent unconditional: 115762, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 26565, independent: 16678, independent conditional: 698, independent unconditional: 15980, dependent: 9184, dependent conditional: 498, dependent unconditional: 8686, unknown: 703, unknown conditional: 45, unknown unconditional: 658] , Statistics on independence cache: Total cache size (in pairs): 703, Positive cache size: 616, Positive conditional cache size: 12, Positive unconditional cache size: 604, Negative cache size: 87, Negative conditional cache size: 33, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24620, Maximal queried relation: 4, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26565, independent: 17294, independent conditional: 16690, independent unconditional: 604, dependent: 9271, dependent conditional: 9171, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26565, independent: 17294, independent conditional: 710, independent unconditional: 16584, dependent: 9271, dependent conditional: 531, dependent unconditional: 8740, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26565, independent: 17294, independent conditional: 710, independent unconditional: 16584, dependent: 9271, dependent conditional: 531, dependent unconditional: 8740, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 703, independent: 616, independent conditional: 12, independent unconditional: 604, dependent: 87, dependent conditional: 33, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 703, independent: 596, independent conditional: 0, independent unconditional: 596, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 107, independent: 20, independent conditional: 12, independent unconditional: 8, dependent: 87, dependent conditional: 33, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 107, independent: 20, independent conditional: 12, independent unconditional: 8, dependent: 87, dependent conditional: 33, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 180225, independent: 2887, independent conditional: 2721, independent unconditional: 165, dependent: 177338, dependent conditional: 61576, dependent unconditional: 115762, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 26565, independent: 16678, independent conditional: 698, independent unconditional: 15980, dependent: 9184, dependent conditional: 498, dependent unconditional: 8686, unknown: 703, unknown conditional: 45, unknown unconditional: 658] , Statistics on independence cache: Total cache size (in pairs): 703, Positive cache size: 616, Positive conditional cache size: 12, Positive unconditional cache size: 604, Negative cache size: 87, Negative conditional cache size: 33, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24620 ], Independence queries for same thread: 381, Persistent sets #1 benchmarks: Persistent set computation time: 112.6s, Number of persistent set computation: 816, Number of trivial persistent sets: 574, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 654, independent: 604, independent conditional: 0, independent unconditional: 604, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 19277, independent: 17294, independent conditional: 16690, independent unconditional: 604, dependent: 1983, dependent conditional: 1932, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18896, independent: 17294, independent conditional: 16690, independent unconditional: 604, dependent: 1602, dependent conditional: 1552, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18896, independent: 17294, independent conditional: 16690, independent unconditional: 604, dependent: 1602, dependent conditional: 1552, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18896, independent: 17294, independent conditional: 16690, independent unconditional: 604, dependent: 1602, dependent conditional: 1552, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26565, independent: 17294, independent conditional: 16690, independent unconditional: 604, dependent: 9271, dependent conditional: 9171, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26565, independent: 17294, independent conditional: 710, independent unconditional: 16584, dependent: 9271, dependent conditional: 531, dependent unconditional: 8740, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26565, independent: 17294, independent conditional: 710, independent unconditional: 16584, dependent: 9271, dependent conditional: 531, dependent unconditional: 8740, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 703, independent: 616, independent conditional: 12, independent unconditional: 604, dependent: 87, dependent conditional: 33, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 703, independent: 596, independent conditional: 0, independent unconditional: 596, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 107, independent: 20, independent conditional: 12, independent unconditional: 8, dependent: 87, dependent conditional: 33, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 107, independent: 20, independent conditional: 12, independent unconditional: 8, dependent: 87, dependent conditional: 33, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 180225, independent: 2887, independent conditional: 2721, independent unconditional: 165, dependent: 177338, dependent conditional: 61576, dependent unconditional: 115762, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 26565, independent: 16678, independent conditional: 698, independent unconditional: 15980, dependent: 9184, dependent conditional: 498, dependent unconditional: 8686, unknown: 703, unknown conditional: 45, unknown unconditional: 658] , Statistics on independence cache: Total cache size (in pairs): 703, Positive cache size: 616, Positive conditional cache size: 12, Positive unconditional cache size: 604, Negative cache size: 87, Negative conditional cache size: 33, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24620, Maximal queried relation: 4, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26565, independent: 17294, independent conditional: 16690, independent unconditional: 604, dependent: 9271, dependent conditional: 9171, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26565, independent: 17294, independent conditional: 710, independent unconditional: 16584, dependent: 9271, dependent conditional: 531, dependent unconditional: 8740, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26565, independent: 17294, independent conditional: 710, independent unconditional: 16584, dependent: 9271, dependent conditional: 531, dependent unconditional: 8740, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 703, independent: 616, independent conditional: 12, independent unconditional: 604, dependent: 87, dependent conditional: 33, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 703, independent: 596, independent conditional: 0, independent unconditional: 596, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 107, independent: 20, independent conditional: 12, independent unconditional: 8, dependent: 87, dependent conditional: 33, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 107, independent: 20, independent conditional: 12, independent unconditional: 8, dependent: 87, dependent conditional: 33, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 180225, independent: 2887, independent conditional: 2721, independent unconditional: 165, dependent: 177338, dependent conditional: 61576, dependent unconditional: 115762, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 26565, independent: 16678, independent conditional: 698, independent unconditional: 15980, dependent: 9184, dependent conditional: 498, dependent unconditional: 8686, unknown: 703, unknown conditional: 45, unknown unconditional: 658] , Statistics on independence cache: Total cache size (in pairs): 703, Positive cache size: 616, Positive conditional cache size: 12, Positive unconditional cache size: 604, Negative cache size: 87, Negative conditional cache size: 33, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24620 ], Independence queries for same thread: 381
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
[L711] 0 int __unbuffered_p1_EAX = 0;
[L713] 0 int __unbuffered_p2_EAX = 0;
[L715] 0 int __unbuffered_p2_EBX = 0;
[L716] 0 _Bool main$tmp_guard0;
[L717] 0 _Bool main$tmp_guard1;
[L719] 0 int x = 0;
[L721] 0 int y = 0;
[L722] 0 _Bool y$flush_delayed;
[L723] 0 int y$mem_tmp;
[L724] 0 _Bool y$r_buff0_thd0;
[L725] 0 _Bool y$r_buff0_thd1;
[L726] 0 _Bool y$r_buff0_thd2;
[L727] 0 _Bool y$r_buff0_thd3;
[L728] 0 _Bool y$r_buff1_thd0;
[L729] 0 _Bool y$r_buff1_thd1;
[L730] 0 _Bool y$r_buff1_thd2;
[L731] 0 _Bool y$r_buff1_thd3;
[L732] 0 _Bool y$read_delayed;
[L733] 0 int *y$read_delayed_var;
[L734] 0 int y$w_buff0;
[L735] 0 _Bool y$w_buff0_used;
[L736] 0 int y$w_buff1;
[L737] 0 _Bool y$w_buff1_used;
[L738] 0 _Bool weak$$choice0;
[L739] 0 _Bool weak$$choice2;
[L846] 0 pthread_t t1849;
[L847] FCALL, FORK 0 pthread_create(&t1849, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1849=-3, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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=0]
[L848] 0 pthread_t t1850;
[L849] FCALL, FORK 0 pthread_create(&t1850, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1849=-3, t1850=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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=0]
[L850] 0 pthread_t t1851;
[L851] FCALL, FORK 0 pthread_create(&t1851, ((void *)0), P2, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1849=-3, t1850=-2, t1851=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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=0]
[L743] 1 y$w_buff1 = y$w_buff0
[L744] 1 y$w_buff0 = 2
[L745] 1 y$w_buff1_used = y$w_buff0_used
[L746] 1 y$w_buff0_used = (_Bool)1
[L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L18] COND FALSE 1 !(!expression)
[L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0
[L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1
[L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2
[L751] 1 y$r_buff1_thd3 = y$r_buff0_thd3
[L752] 1 y$r_buff0_thd1 = (_Bool)1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L755] 1 x = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L772] 2 __unbuffered_p1_EAX = x
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L775] 2 y = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L778] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L779] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L780] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L781] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L782] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L787] 2 return 0;
[L792] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L793] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L794] 3 y$flush_delayed = weak$$choice2
[L795] 3 y$mem_tmp = y
[L796] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L797] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L798] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L799] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L800] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L801] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L802] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L803] 3 __unbuffered_p2_EAX = y
[L804] 3 y = y$flush_delayed ? y$mem_tmp : y
[L805] 3 y$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L808] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L809] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L810] 3 y$flush_delayed = weak$$choice2
[L811] 3 y$mem_tmp = y
[L812] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L813] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L814] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L815] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L816] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L817] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L818] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L819] 3 __unbuffered_p2_EBX = y
[L820] 3 y = y$flush_delayed ? y$mem_tmp : y
[L821] 3 y$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L824] 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)
[L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L826] 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
[L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L828] 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}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L833] 3 return 0;
[L758] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L759] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L760] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L761] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L762] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L765] 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_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849=-3, t1850=-2, t1851=-1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L855] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L855] RET 0 assume_abort_if_not(main$tmp_guard0)
[L857] 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)
[L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L859] 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
[L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L861] 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}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849=-3, t1850=-2, t1851=-1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L864] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L865] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L866] 0 y$flush_delayed = weak$$choice2
[L867] 0 y$mem_tmp = y
[L868] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L869] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L870] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L871] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L872] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L873] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L874] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L875] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1)
[L876] 0 y = y$flush_delayed ? y$mem_tmp : y
[L877] 0 y$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849=-3, t1850=-2, t1851=-1, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L879] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L18] 0 reach_error()
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
- UnprovableResult [Line: 847]: 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: 851]: 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: 849]: 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, 64 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 190.2s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 180.2s, 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: 21, 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.7s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 85 ConstructedInterpolants, 0 QuantifiedInterpolants, 461 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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: 7.0s, ConditionalCommutativityCheckTime: 7.0s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityCommutingCounterexamples: 1, ConditionalCommutativityConditionCalculations: 11, ConditionalCommutativityTraceChecks: 6, ConditionalCommutativityImperfectProofs: 0
RESULT: Ultimate proved your program to be incorrect!
[2024-10-16 13:11:20,009 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:11:20,192 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...