/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf --traceabstraction.dfs.order.used.in.por PSEUDO_LOCKSTEP --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix010.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 13:10:50,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 13:10:50,785 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistent.epf [2023-11-17 13:10:50,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-17 13:10:50,792 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-17 13:10:50,820 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 13:10:50,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-17 13:10:50,821 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-17 13:10:50,822 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 13:10:50,825 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 13:10:50,826 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 13:10:50,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 13:10:50,826 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 13:10:50,828 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 13:10:50,828 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 13:10:50,828 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 13:10:50,828 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 13:10:50,828 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 13:10:50,829 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 13:10:50,829 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 13:10:50,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 13:10:50,829 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 13:10:50,830 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 13:10:50,831 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 13:10:50,831 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 13:10:50,831 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 13:10:50,832 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 13:10:50,832 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 13:10:50,832 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 13:10:50,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 13:10:50,833 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 13:10:50,833 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 13:10:50,833 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 13:10:50,834 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 13:10:50,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 13:10:50,834 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-17 13:10:50,834 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-17 13:10:50,834 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-17 13:10:50,834 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-17 13:10:50,834 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES [2023-11-17 13:10:50,835 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/UAutomizer-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.traceabstraction: DFS Order used in POR -> PSEUDO_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 13:10:51,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 13:10:51,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 13:10:51,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 13:10:51,114 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 13:10:51,114 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 13:10:51,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010.oepc.i [2023-11-17 13:10:52,272 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 13:10:52,521 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 13:10:52,521 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010.oepc.i [2023-11-17 13:10:52,548 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7284de597/5cbcb720b6d740c59bc0f6c6907877b7/FLAG8da3d631a [2023-11-17 13:10:52,562 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7284de597/5cbcb720b6d740c59bc0f6c6907877b7 [2023-11-17 13:10:52,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 13:10:52,566 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 13:10:52,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 13:10:52,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 13:10:52,571 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 13:10:52,571 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 01:10:52" (1/1) ... [2023-11-17 13:10:52,572 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66d0495e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:10:52, skipping insertion in model container [2023-11-17 13:10:52,572 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 01:10:52" (1/1) ... [2023-11-17 13:10:52,626 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 13:10:52,768 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010.oepc.i[945,958] [2023-11-17 13:10:52,980 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 13:10:52,998 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 13:10:53,008 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010.oepc.i[945,958] [2023-11-17 13:10:53,077 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 13:10:53,116 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 13:10:53,117 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 13:10:53,123 INFO L206 MainTranslator]: Completed translation [2023-11-17 13:10:53,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:10:53 WrapperNode [2023-11-17 13:10:53,124 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 13:10:53,125 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 13:10:53,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 13:10:53,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 13:10:53,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:10:53" (1/1) ... [2023-11-17 13:10:53,147 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:10:53" (1/1) ... [2023-11-17 13:10:53,181 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2023-11-17 13:10:53,181 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 13:10:53,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 13:10:53,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 13:10:53,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 13:10:53,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:10:53" (1/1) ... [2023-11-17 13:10:53,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:10:53" (1/1) ... [2023-11-17 13:10:53,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:10:53" (1/1) ... [2023-11-17 13:10:53,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:10:53" (1/1) ... [2023-11-17 13:10:53,211 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:10:53" (1/1) ... [2023-11-17 13:10:53,213 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:10:53" (1/1) ... [2023-11-17 13:10:53,215 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:10:53" (1/1) ... [2023-11-17 13:10:53,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:10:53" (1/1) ... [2023-11-17 13:10:53,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 13:10:53,220 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 13:10:53,220 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 13:10:53,220 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 13:10:53,221 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:10:53" (1/1) ... [2023-11-17 13:10:53,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 13:10:53,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:10:53,263 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 13:10:53,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 13:10:53,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 13:10:53,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 13:10:53,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 13:10:53,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 13:10:53,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 13:10:53,300 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 13:10:53,301 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 13:10:53,301 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 13:10:53,301 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 13:10:53,302 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 13:10:53,302 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 13:10:53,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 13:10:53,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 13:10:53,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 13:10:53,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 13:10:53,305 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 13:10:53,451 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 13:10:53,454 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 13:10:53,754 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 13:10:53,965 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 13:10:53,965 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 13:10:53,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 01:10:53 BoogieIcfgContainer [2023-11-17 13:10:53,967 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 13:10:53,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 13:10:53,969 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 13:10:53,972 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 13:10:53,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 01:10:52" (1/3) ... [2023-11-17 13:10:53,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee6a3e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 01:10:53, skipping insertion in model container [2023-11-17 13:10:53,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 01:10:53" (2/3) ... [2023-11-17 13:10:53,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ee6a3e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 01:10:53, skipping insertion in model container [2023-11-17 13:10:53,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 01:10:53" (3/3) ... [2023-11-17 13:10:53,974 INFO L112 eAbstractionObserver]: Analyzing ICFG mix010.oepc.i [2023-11-17 13:10:53,981 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-17 13:10:53,989 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 13:10:53,989 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 13:10:53,989 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 13:10:54,046 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 13:10:54,092 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 13:10:54,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-17 13:10:54,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 13:10:54,099 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-17 13:10:54,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-11-17 13:10:54,139 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-17 13:10:54,151 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-17 13:10:54,157 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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;@731e24f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 13:10:54,160 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-17 13:10:54,529 INFO L420 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)] === [2023-11-17 13:10:54,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:10:54,534 INFO L85 PathProgramCache]: Analyzing trace with hash 2086411422, now seen corresponding path program 1 times [2023-11-17 13:10:54,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:10:54,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138441417] [2023-11-17 13:10:54,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:10:54,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:10:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:10:55,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 13:10:55,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:10:55,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138441417] [2023-11-17 13:10:55,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138441417] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 13:10:55,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 13:10:55,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 13:10:55,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569741100] [2023-11-17 13:10:55,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 13:10:55,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 13:10:55,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:10:55,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 13:10:55,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-17 13:10:55,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:10:55,200 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:10:55,201 INFO L496 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) [2023-11-17 13:10:55,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:10:55,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 13:10:55,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 13:10:55,405 INFO L420 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)] === [2023-11-17 13:10:55,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:10:55,406 INFO L85 PathProgramCache]: Analyzing trace with hash 2062541612, now seen corresponding path program 1 times [2023-11-17 13:10:55,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:10:55,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671659011] [2023-11-17 13:10:55,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:10:55,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:10:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:10:55,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 13:10:55,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:10:55,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671659011] [2023-11-17 13:10:55,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671659011] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 13:10:55,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 13:10:55,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-17 13:10:55,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324069067] [2023-11-17 13:10:55,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 13:10:55,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 13:10:55,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:10:55,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 13:10:55,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-17 13:10:55,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:10:55,778 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:10:55,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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) [2023-11-17 13:10:55,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 13:10:55,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:10:56,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 13:10:56,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 13:10:56,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 13:10:56,127 INFO L420 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)] === [2023-11-17 13:10:56,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:10:56,128 INFO L85 PathProgramCache]: Analyzing trace with hash 472122139, now seen corresponding path program 1 times [2023-11-17 13:10:56,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:10:56,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786344255] [2023-11-17 13:10:56,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:10:56,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:10:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:10:56,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 13:10:56,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:10:56,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786344255] [2023-11-17 13:10:56,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786344255] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 13:10:56,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 13:10:56,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 13:10:56,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029666769] [2023-11-17 13:10:56,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 13:10:56,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 13:10:56,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:10:56,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 13:10:56,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 13:10:56,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:10:56,345 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:10:56,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2023-11-17 13:10:56,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 13:10:56,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 13:10:56,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:10:56,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 13:10:56,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 13:10:56,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 13:10:56,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 13:10:56,731 INFO L420 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)] === [2023-11-17 13:10:56,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:10:56,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1411739174, now seen corresponding path program 1 times [2023-11-17 13:10:56,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:10:56,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355504373] [2023-11-17 13:10:56,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:10:56,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:10:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:10:56,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 13:10:56,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:10:57,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355504373] [2023-11-17 13:10:57,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355504373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 13:10:57,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 13:10:57,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 13:10:57,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902240509] [2023-11-17 13:10:57,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 13:10:57,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 13:10:57,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:10:57,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 13:10:57,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-17 13:10:57,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:10:57,002 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:10:57,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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) [2023-11-17 13:10:57,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 13:10:57,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 13:10:57,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-17 13:10:57,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:10:57,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 13:10:57,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 13:10:57,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 13:10:57,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:10:57,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 13:10:57,214 INFO L420 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)] === [2023-11-17 13:10:57,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:10:57,215 INFO L85 PathProgramCache]: Analyzing trace with hash 2021193034, now seen corresponding path program 2 times [2023-11-17 13:10:57,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:10:57,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616588636] [2023-11-17 13:10:57,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:10:57,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:10:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:10:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 13:10:57,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:10:57,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616588636] [2023-11-17 13:10:57,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616588636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 13:10:57,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 13:10:57,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 13:10:57,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404511603] [2023-11-17 13:10:57,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 13:10:57,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 13:10:57,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:10:57,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 13:10:57,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 13:10:57,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:10:57,508 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:10:57,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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) [2023-11-17 13:10:57,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 13:10:57,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 13:10:57,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-17 13:10:57,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:10:57,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:10:57,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 13:10:57,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 13:10:57,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 13:10:57,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:10:57,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:10:57,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 13:10:57,647 INFO L420 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)] === [2023-11-17 13:10:57,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:10:57,648 INFO L85 PathProgramCache]: Analyzing trace with hash -2036820948, now seen corresponding path program 1 times [2023-11-17 13:10:57,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:10:57,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589992914] [2023-11-17 13:10:57,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:10:57,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:10:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:10:58,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 13:10:58,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:10:58,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589992914] [2023-11-17 13:10:58,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589992914] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 13:10:58,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 13:10:58,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-17 13:10:58,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690465804] [2023-11-17 13:10:58,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 13:10:58,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 13:10:58,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:10:58,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 13:10:58,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-17 13:10:58,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:10:58,183 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:10:58,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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) [2023-11-17 13:10:58,183 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 13:10:58,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 13:10:58,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-17 13:10:58,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:10:58,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:10:58,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:10:58,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 13:10:58,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 13:10:58,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 13:10:58,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:10:58,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:10:58,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 13:10:58,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 13:10:58,421 INFO L420 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)] === [2023-11-17 13:10:58,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:10:58,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1905006858, now seen corresponding path program 2 times [2023-11-17 13:10:58,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:10:58,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117261228] [2023-11-17 13:10:58,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:10:58,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:10:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 13:10:59,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 13:10:59,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 13:10:59,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117261228] [2023-11-17 13:10:59,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117261228] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 13:10:59,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 13:10:59,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-17 13:10:59,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969950602] [2023-11-17 13:10:59,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 13:10:59,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-17 13:10:59,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 13:10:59,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-17 13:10:59,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-17 13:10:59,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:10:59,176 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-17 13:10:59,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 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) [2023-11-17 13:10:59,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-17 13:10:59,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-17 13:10:59,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-17 13:10:59,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:10:59,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:10:59,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-11-17 13:10:59,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-17 13:10:59,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 13:10:59,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 13:10:59,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 13:10:59,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:10:59,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 13:10:59,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 13:10:59,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 13:10:59,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 13:10:59,518 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 13:10:59,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 13:10:59,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1335858050, now seen corresponding path program 3 times [2023-11-17 13:10:59,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 13:10:59,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663100243] [2023-11-17 13:10:59,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 13:10:59,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 13:10:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 13:10:59,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 13:10:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 13:10:59,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 13:10:59,699 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 13:10:59,700 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-11-17 13:10:59,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-11-17 13:10:59,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-11-17 13:10:59,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-11-17 13:10:59,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 13:10:59,708 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2023-11-17 13:10:59,710 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-11-17 13:10:59,712 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 13:10:59,713 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 13:10:59,764 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 13:10:59,766 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 13:10:59,767 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 13:10:59,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 01:10:59 BasicIcfg [2023-11-17 13:10:59,787 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 13:10:59,787 INFO L158 Benchmark]: Toolchain (without parser) took 7221.13ms. Allocated memory was 289.4MB in the beginning and 429.9MB in the end (delta: 140.5MB). Free memory was 234.2MB in the beginning and 347.4MB in the end (delta: -113.2MB). Peak memory consumption was 27.8MB. Max. memory is 8.0GB. [2023-11-17 13:10:59,787 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 176.2MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 13:10:59,788 INFO L158 Benchmark]: CACSL2BoogieTranslator took 557.01ms. Allocated memory is still 289.4MB. Free memory was 234.2MB in the beginning and 210.6MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-17 13:10:59,788 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.08ms. Allocated memory is still 289.4MB. Free memory was 210.6MB in the beginning and 208.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 13:10:59,788 INFO L158 Benchmark]: Boogie Preprocessor took 37.77ms. Allocated memory is still 289.4MB. Free memory was 208.0MB in the beginning and 206.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 13:10:59,788 INFO L158 Benchmark]: RCFGBuilder took 746.51ms. Allocated memory is still 289.4MB. Free memory was 206.4MB in the beginning and 246.0MB in the end (delta: -39.5MB). Peak memory consumption was 49.6MB. Max. memory is 8.0GB. [2023-11-17 13:10:59,789 INFO L158 Benchmark]: TraceAbstraction took 5817.63ms. Allocated memory was 289.4MB in the beginning and 429.9MB in the end (delta: 140.5MB). Free memory was 245.4MB in the beginning and 347.4MB in the end (delta: -102.0MB). Peak memory consumption was 38.0MB. Max. memory is 8.0GB. [2023-11-17 13:10:59,790 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.12ms. Allocated memory is still 176.2MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 557.01ms. Allocated memory is still 289.4MB. Free memory was 234.2MB in the beginning and 210.6MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.08ms. Allocated memory is still 289.4MB. Free memory was 210.6MB in the beginning and 208.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.77ms. Allocated memory is still 289.4MB. Free memory was 208.0MB in the beginning and 206.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 746.51ms. Allocated memory is still 289.4MB. Free memory was 206.4MB in the beginning and 246.0MB in the end (delta: -39.5MB). Peak memory consumption was 49.6MB. Max. memory is 8.0GB. * TraceAbstraction took 5817.63ms. Allocated memory was 289.4MB in the beginning and 429.9MB in the end (delta: 140.5MB). Free memory was 245.4MB in the beginning and 347.4MB in the end (delta: -102.0MB). Peak memory consumption was 38.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 11221, independent: 10701, independent conditional: 9925, independent unconditional: 776, dependent: 520, dependent conditional: 476, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11116, independent: 10701, independent conditional: 9925, independent unconditional: 776, dependent: 415, dependent conditional: 371, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11116, independent: 10701, independent conditional: 9925, independent unconditional: 776, dependent: 415, dependent conditional: 371, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13677, independent: 10701, independent conditional: 909, independent unconditional: 9792, dependent: 2976, dependent conditional: 1652, dependent unconditional: 1324, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13677, independent: 10701, independent conditional: 909, independent unconditional: 9792, dependent: 2976, dependent conditional: 80, dependent unconditional: 2896, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13677, independent: 10701, independent conditional: 909, independent unconditional: 9792, dependent: 2976, dependent conditional: 80, dependent unconditional: 2896, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 866, independent: 809, independent conditional: 32, independent unconditional: 777, dependent: 57, dependent conditional: 12, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 866, independent: 768, independent conditional: 0, independent unconditional: 768, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 98, independent: 41, independent conditional: 32, independent unconditional: 9, dependent: 57, dependent conditional: 12, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 98, independent: 41, independent conditional: 32, independent unconditional: 9, dependent: 57, dependent conditional: 12, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 715, independent: 226, independent conditional: 176, independent unconditional: 51, dependent: 489, dependent conditional: 81, dependent unconditional: 408, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 13677, independent: 9892, independent conditional: 877, independent unconditional: 9015, dependent: 2919, dependent conditional: 68, dependent unconditional: 2851, unknown: 866, unknown conditional: 44, unknown unconditional: 822] , Statistics on independence cache: Total cache size (in pairs): 866, Positive cache size: 809, Positive conditional cache size: 32, Positive unconditional cache size: 777, Negative cache size: 57, Negative conditional cache size: 12, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1572, Maximal queried relation: 7, Independence queries for same thread: 105 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.6s, Number of persistent set computation: 300, Number of trivial persistent sets: 107, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 820, independent: 776, independent conditional: 0, independent unconditional: 776, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 11221, independent: 10701, independent conditional: 9925, independent unconditional: 776, dependent: 520, dependent conditional: 476, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11116, independent: 10701, independent conditional: 9925, independent unconditional: 776, dependent: 415, dependent conditional: 371, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11116, independent: 10701, independent conditional: 9925, independent unconditional: 776, dependent: 415, dependent conditional: 371, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13677, independent: 10701, independent conditional: 909, independent unconditional: 9792, dependent: 2976, dependent conditional: 1652, dependent unconditional: 1324, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13677, independent: 10701, independent conditional: 909, independent unconditional: 9792, dependent: 2976, dependent conditional: 80, dependent unconditional: 2896, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13677, independent: 10701, independent conditional: 909, independent unconditional: 9792, dependent: 2976, dependent conditional: 80, dependent unconditional: 2896, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 866, independent: 809, independent conditional: 32, independent unconditional: 777, dependent: 57, dependent conditional: 12, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 866, independent: 768, independent conditional: 0, independent unconditional: 768, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 98, independent: 41, independent conditional: 32, independent unconditional: 9, dependent: 57, dependent conditional: 12, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 98, independent: 41, independent conditional: 32, independent unconditional: 9, dependent: 57, dependent conditional: 12, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 715, independent: 226, independent conditional: 176, independent unconditional: 51, dependent: 489, dependent conditional: 81, dependent unconditional: 408, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 13677, independent: 9892, independent conditional: 877, independent unconditional: 9015, dependent: 2919, dependent conditional: 68, dependent unconditional: 2851, unknown: 866, unknown conditional: 44, unknown unconditional: 822] , Statistics on independence cache: Total cache size (in pairs): 866, Positive cache size: 809, Positive conditional cache size: 32, Positive unconditional cache size: 777, Negative cache size: 57, Negative conditional cache size: 12, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1572, Maximal queried relation: 7, Independence queries for same thread: 105 - 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_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool a$flush_delayed; [L723] 0 int a$mem_tmp; [L724] 0 _Bool a$r_buff0_thd0; [L725] 0 _Bool a$r_buff0_thd1; [L726] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd3; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$read_delayed; [L733] 0 int *a$read_delayed_var; [L734] 0 int a$w_buff0; [L735] 0 _Bool a$w_buff0_used; [L736] 0 int a$w_buff1; [L737] 0 _Bool a$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L850] 0 pthread_t t257; [L851] FCALL, FORK 0 pthread_create(&t257, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t257={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L852] 0 pthread_t t258; [L853] FCALL, FORK 0 pthread_create(&t258, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t257={5:0}, t258={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L854] 0 pthread_t t259; [L855] FCALL, FORK 0 pthread_create(&t259, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t257={5:0}, t258={6:0}, t259={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 a$w_buff1 = a$w_buff0 [L752] 1 a$w_buff0 = 1 [L753] 1 a$w_buff1_used = a$w_buff0_used [L754] 1 a$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L756] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L757] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L758] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L759] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0: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=0, z=0] [L763] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0: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=0, z=0] [L780] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0: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=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0: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=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0: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=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0: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=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0: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=1, z=1] [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0: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=1, z=1] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 a$flush_delayed = weak$$choice2 [L815] 3 a$mem_tmp = a [L816] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L817] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L818] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L819] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L820] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L822] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EBX = a [L824] 3 a = a$flush_delayed ? a$mem_tmp : a [L825] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L828] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L829] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L830] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L831] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L832] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t257={5:0}, t258={6:0}, t259={3:0}, weak$$choice2=0, x=1, y=1, z=1] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L862] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L863] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L864] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L865] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t257={5:0}, t258={6:0}, t259={3:0}, weak$$choice2=0, x=1, y=1, z=1] [L868] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t257={5:0}, t258={6:0}, t259={3:0}, weak$$choice2=0, x=1, y=1, z=1] [L870] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 855]: 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: 853]: 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, 70 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 2.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: 49, 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, 2.6s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 943 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 13:10:59,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2023-11-17 13:11:00,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...