/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-a4a1cd3-m [2024-05-30 18:13:02,711 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 18:13:02,783 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-30 18:13:02,787 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 18:13:02,790 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 18:13:02,825 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 18:13:02,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 18:13:02,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 18:13:02,827 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 18:13:02,827 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 18:13:02,827 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 18:13:02,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 18:13:02,828 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 18:13:02,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 18:13:02,829 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 18:13:02,829 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 18:13:02,829 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 18:13:02,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 18:13:02,830 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 18:13:02,830 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 18:13:02,831 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 18:13:02,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 18:13:02,837 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 18:13:02,837 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 18:13:02,840 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 18:13:02,841 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 18:13:02,841 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 18:13:02,841 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 18:13:02,841 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 18:13:02,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 18:13:02,843 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 18:13:02,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 18:13:02,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 18:13:02,844 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 18:13:02,844 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-30 18:13:02,844 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-30 18:13:02,844 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 18:13:02,844 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 18:13:02,844 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 18:13:02,845 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2024-05-30 18:13:03,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 18:13:03,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 18:13:03,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 18:13:03,144 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 18:13:03,144 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 18:13:03,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i [2024-05-30 18:13:04,296 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 18:13:04,561 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 18:13:04,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i [2024-05-30 18:13:04,579 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4ed291239/8b6df026701247feb3b9200c821fa1ba/FLAGe5a3ae302 [2024-05-30 18:13:04,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4ed291239/8b6df026701247feb3b9200c821fa1ba [2024-05-30 18:13:04,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 18:13:04,600 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 18:13:04,605 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 18:13:04,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 18:13:04,611 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 18:13:04,612 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 06:13:04" (1/1) ... [2024-05-30 18:13:04,613 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39ac4e51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:13:04, skipping insertion in model container [2024-05-30 18:13:04,613 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 06:13:04" (1/1) ... [2024-05-30 18:13:04,661 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 18:13:04,808 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-05-30 18:13:05,022 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 18:13:05,057 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 18:13:05,068 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-05-30 18:13:05,102 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 18:13:05,145 INFO L206 MainTranslator]: Completed translation [2024-05-30 18:13:05,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:13:05 WrapperNode [2024-05-30 18:13:05,146 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 18:13:05,147 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 18:13:05,147 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 18:13:05,147 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 18:13:05,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:13:05" (1/1) ... [2024-05-30 18:13:05,172 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:13:05" (1/1) ... [2024-05-30 18:13:05,195 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2024-05-30 18:13:05,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 18:13:05,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 18:13:05,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 18:13:05,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 18:13:05,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:13:05" (1/1) ... [2024-05-30 18:13:05,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:13:05" (1/1) ... [2024-05-30 18:13:05,213 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:13:05" (1/1) ... [2024-05-30 18:13:05,213 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:13:05" (1/1) ... [2024-05-30 18:13:05,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:13:05" (1/1) ... [2024-05-30 18:13:05,239 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:13:05" (1/1) ... [2024-05-30 18:13:05,241 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:13:05" (1/1) ... [2024-05-30 18:13:05,242 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:13:05" (1/1) ... [2024-05-30 18:13:05,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 18:13:05,246 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 18:13:05,246 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 18:13:05,246 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 18:13:05,258 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:13:05" (1/1) ... [2024-05-30 18:13:05,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 18:13:05,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 18:13:05,294 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-30 18:13:05,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-30 18:13:05,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 18:13:05,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-30 18:13:05,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 18:13:05,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 18:13:05,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 18:13:05,334 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-30 18:13:05,334 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-30 18:13:05,334 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-30 18:13:05,334 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-30 18:13:05,334 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-30 18:13:05,334 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-30 18:13:05,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 18:13:05,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-30 18:13:05,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 18:13:05,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 18:13:05,336 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-30 18:13:05,454 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 18:13:05,456 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 18:13:05,717 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 18:13:05,847 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 18:13:05,848 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-30 18:13:05,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 06:13:05 BoogieIcfgContainer [2024-05-30 18:13:05,848 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 18:13:05,857 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 18:13:05,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 18:13:05,861 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 18:13:05,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 06:13:04" (1/3) ... [2024-05-30 18:13:05,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17df3ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 06:13:05, skipping insertion in model container [2024-05-30 18:13:05,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:13:05" (2/3) ... [2024-05-30 18:13:05,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17df3ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 06:13:05, skipping insertion in model container [2024-05-30 18:13:05,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 06:13:05" (3/3) ... [2024-05-30 18:13:05,863 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_power.oepc_pso.oepc_rmo.oepc.i [2024-05-30 18:13:05,871 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 18:13:05,881 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 18:13:05,881 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-30 18:13:05,881 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 18:13:05,940 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-30 18:13:05,998 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 18:13:06,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 18:13:06,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 18:13:06,003 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 18:13:06,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-30 18:13:06,048 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 18:13:06,054 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == P0Err0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 18:13:06,062 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;@603b00f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 18:13:06,063 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 18:13:06,068 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2024-05-30 18:13:06,072 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 18:13:06,078 INFO L445 BasicCegarLoop]: Path program histogram: [] [2024-05-30 18:13:06,082 INFO L308 ceAbstractionStarter]: Result for error location P0Err0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/6) [2024-05-30 18:13:06,097 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 18:13:06,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 18:13:06,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 18:13:06,129 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 18:13:06,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-05-30 18:13:06,133 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 18:13:06,133 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 18:13:06,134 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;@603b00f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 18:13:06,134 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 18:13:06,183 INFO L78 Accepts]: Start accepts. Automaton has currently 145 states, but on-demand construction may add more states Word has length 71 [2024-05-30 18:13:06,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:13:06,184 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:13:06,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:13:06,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1098976717, now seen corresponding path program 1 times [2024-05-30 18:13:06,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:13:06,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544763968] [2024-05-30 18:13:06,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:13:06,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:13:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:13:06,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 18:13:06,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:13:06,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544763968] [2024-05-30 18:13:06,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544763968] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 18:13:06,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 18:13:06,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 18:13:06,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948871059] [2024-05-30 18:13:06,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 18:13:06,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 18:13:06,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:13:06,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 18:13:06,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 18:13:06,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:13:06,549 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:13:06,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 18:13:06,550 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:13:06,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:13:06,995 INFO L78 Accepts]: Start accepts. Automaton has currently 860 states, but on-demand construction may add more states Word has length 70 [2024-05-30 18:13:06,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:13:06,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 18:13:06,997 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:13:06,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:13:06,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1513069274, now seen corresponding path program 1 times [2024-05-30 18:13:06,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:13:06,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479911723] [2024-05-30 18:13:06,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:13:06,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:13:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:13:07,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 18:13:07,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:13:07,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479911723] [2024-05-30 18:13:07,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479911723] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 18:13:07,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 18:13:07,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-30 18:13:07,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953546856] [2024-05-30 18:13:07,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 18:13:07,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-30 18:13:07,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:13:07,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-30 18:13:07,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-30 18:13:07,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:13:07,702 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:13:07,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 18:13:07,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:13:07,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:13:08,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:13:08,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 18:13:08,435 INFO L78 Accepts]: Start accepts. Automaton has currently 4753 states, but on-demand construction may add more states Word has length 83 [2024-05-30 18:13:08,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:13:08,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-30 18:13:08,436 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:13:08,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:13:08,437 INFO L85 PathProgramCache]: Analyzing trace with hash -623669630, now seen corresponding path program 1 times [2024-05-30 18:13:08,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:13:08,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595144427] [2024-05-30 18:13:08,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:13:08,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:13:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:13:08,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 18:13:08,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:13:08,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595144427] [2024-05-30 18:13:08,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595144427] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 18:13:08,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 18:13:08,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-30 18:13:08,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004031480] [2024-05-30 18:13:08,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 18:13:08,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-30 18:13:08,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:13:08,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-30 18:13:08,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-05-30 18:13:08,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:13:08,875 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:13:08,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 18:13:08,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:13:08,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 18:13:08,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:13:09,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:13:09,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 18:13:09,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 18:13:09,248 INFO L78 Accepts]: Start accepts. Automaton has currently 4367 states, but on-demand construction may add more states Word has length 88 [2024-05-30 18:13:09,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:13:09,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-30 18:13:09,250 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:13:09,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:13:09,251 INFO L85 PathProgramCache]: Analyzing trace with hash 322371248, now seen corresponding path program 1 times [2024-05-30 18:13:09,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:13:09,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066716124] [2024-05-30 18:13:09,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:13:09,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:13:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:13:09,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 18:13:09,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:13:09,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066716124] [2024-05-30 18:13:09,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066716124] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 18:13:09,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 18:13:09,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-30 18:13:09,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89491859] [2024-05-30 18:13:09,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 18:13:09,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-30 18:13:09,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:13:09,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-30 18:13:09,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-30 18:13:09,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:13:09,623 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:13:09,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 18:13:09,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:13:09,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 18:13:09,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 18:13:09,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:13:10,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:13:10,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 18:13:10,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 18:13:10,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 18:13:10,089 INFO L78 Accepts]: Start accepts. Automaton has currently 4506 states, but on-demand construction may add more states Word has length 88 [2024-05-30 18:13:10,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:13:10,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-30 18:13:10,091 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:13:10,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:13:10,092 INFO L85 PathProgramCache]: Analyzing trace with hash 503521200, now seen corresponding path program 2 times [2024-05-30 18:13:10,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:13:10,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328620747] [2024-05-30 18:13:10,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:13:10,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:13:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:13:10,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 18:13:10,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:13:10,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328620747] [2024-05-30 18:13:10,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328620747] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 18:13:10,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 18:13:10,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-30 18:13:10,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450807247] [2024-05-30 18:13:10,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 18:13:10,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-30 18:13:10,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:13:10,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-30 18:13:10,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-30 18:13:10,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:13:10,459 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:13:10,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 18:13:10,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:13:10,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 18:13:10,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 18:13:10,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 18:13:10,459 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:13:10,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:13:10,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 18:13:10,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 18:13:10,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 18:13:10,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-30 18:13:10,893 INFO L78 Accepts]: Start accepts. Automaton has currently 4357 states, but on-demand construction may add more states Word has length 91 [2024-05-30 18:13:10,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:13:10,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-30 18:13:10,894 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:13:10,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:13:10,896 INFO L85 PathProgramCache]: Analyzing trace with hash 52630048, now seen corresponding path program 1 times [2024-05-30 18:13:10,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:13:10,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259290587] [2024-05-30 18:13:10,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:13:10,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:13:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:13:12,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 18:13:12,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:13:12,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259290587] [2024-05-30 18:13:12,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259290587] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 18:13:12,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 18:13:12,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-05-30 18:13:12,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215553044] [2024-05-30 18:13:12,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 18:13:12,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-30 18:13:12,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:13:12,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-30 18:13:12,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-05-30 18:13:12,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:13:12,107 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:13:12,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.583333333333333) internal successors, (91), 12 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 18:13:12,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:13:12,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 18:13:12,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-30 18:13:12,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 18:13:12,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-30 18:13:12,108 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:13:12,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:13:12,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 18:13:12,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-30 18:13:12,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 18:13:12,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-30 18:13:12,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-30 18:13:12,993 INFO L78 Accepts]: Start accepts. Automaton has currently 6214 states, but on-demand construction may add more states Word has length 91 [2024-05-30 18:13:12,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:13:12,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-30 18:13:12,994 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:13:12,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:13:12,994 INFO L85 PathProgramCache]: Analyzing trace with hash -955248096, now seen corresponding path program 2 times [2024-05-30 18:13:12,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:13:12,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579133366] [2024-05-30 18:13:12,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:13:12,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:13:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 18:13:13,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 18:13:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 18:13:13,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 18:13:13,099 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 18:13:13,099 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 18:13:13,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-30 18:13:13,101 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2024-05-30 18:13:13,101 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was UNSAFE (2/6) [2024-05-30 18:13:13,103 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-30 18:13:13,103 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-30 18:13:13,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.05 06:13:13 BasicIcfg [2024-05-30 18:13:13,218 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-30 18:13:13,218 INFO L158 Benchmark]: Toolchain (without parser) took 8618.35ms. Allocated memory was 156.2MB in the beginning and 521.1MB in the end (delta: 364.9MB). Free memory was 82.8MB in the beginning and 415.8MB in the end (delta: -333.1MB). Peak memory consumption was 33.5MB. Max. memory is 8.0GB. [2024-05-30 18:13:13,219 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 156.2MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 18:13:13,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 541.62ms. Allocated memory was 156.2MB in the beginning and 274.7MB in the end (delta: 118.5MB). Free memory was 82.6MB in the beginning and 239.0MB in the end (delta: -156.4MB). Peak memory consumption was 27.9MB. Max. memory is 8.0GB. [2024-05-30 18:13:13,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.78ms. Allocated memory is still 274.7MB. Free memory was 239.0MB in the beginning and 236.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 18:13:13,219 INFO L158 Benchmark]: Boogie Preprocessor took 48.67ms. Allocated memory is still 274.7MB. Free memory was 236.5MB in the beginning and 234.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 18:13:13,220 INFO L158 Benchmark]: RCFGBuilder took 602.88ms. Allocated memory is still 274.7MB. Free memory was 234.9MB in the beginning and 197.1MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2024-05-30 18:13:13,220 INFO L158 Benchmark]: TraceAbstraction took 7360.74ms. Allocated memory was 274.7MB in the beginning and 521.1MB in the end (delta: 246.4MB). Free memory was 196.1MB in the beginning and 415.8MB in the end (delta: -219.8MB). Peak memory consumption was 26.7MB. Max. memory is 8.0GB. [2024-05-30 18:13:13,222 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 156.2MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 541.62ms. Allocated memory was 156.2MB in the beginning and 274.7MB in the end (delta: 118.5MB). Free memory was 82.6MB in the beginning and 239.0MB in the end (delta: -156.4MB). Peak memory consumption was 27.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.78ms. Allocated memory is still 274.7MB. Free memory was 239.0MB in the beginning and 236.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.67ms. Allocated memory is still 274.7MB. Free memory was 236.5MB in the beginning and 234.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 602.88ms. Allocated memory is still 274.7MB. Free memory was 234.9MB in the beginning and 197.1MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 7360.74ms. Allocated memory was 274.7MB in the beginning and 521.1MB in the end (delta: 246.4MB). Free memory was 196.1MB in the beginning and 415.8MB in the end (delta: -219.8MB). Peak memory consumption was 26.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Visitor Statistics States: 0, Transitions: 0, Traversal time: 16598326.1s - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 103665, independent: 100598, independent conditional: 100598, independent unconditional: 0, dependent: 3067, dependent conditional: 3067, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 103158, independent: 100598, independent conditional: 100598, independent unconditional: 0, dependent: 2560, dependent conditional: 2560, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 103158, independent: 100598, independent conditional: 100598, independent unconditional: 0, dependent: 2560, dependent conditional: 2560, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 113657, independent: 100598, independent conditional: 755, independent unconditional: 99843, dependent: 13059, dependent conditional: 9744, dependent unconditional: 3315, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 113657, independent: 100598, independent conditional: 755, independent unconditional: 99843, dependent: 13059, dependent conditional: 726, dependent unconditional: 12333, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 113657, independent: 100598, independent conditional: 755, independent unconditional: 99843, dependent: 13059, dependent conditional: 726, dependent unconditional: 12333, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 690, independent: 647, independent conditional: 26, independent unconditional: 621, dependent: 43, dependent conditional: 18, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 690, independent: 617, independent conditional: 0, independent unconditional: 617, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 73, independent: 30, independent conditional: 26, independent unconditional: 4, dependent: 43, dependent conditional: 18, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 73, independent: 30, independent conditional: 26, independent unconditional: 4, dependent: 43, dependent conditional: 18, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 587, independent: 247, independent conditional: 213, independent unconditional: 34, dependent: 340, dependent conditional: 133, dependent unconditional: 207, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 113657, independent: 99951, independent conditional: 729, independent unconditional: 99222, dependent: 13016, dependent conditional: 708, dependent unconditional: 12308, unknown: 690, unknown conditional: 44, unknown unconditional: 646] , Statistics on independence cache: Total cache size (in pairs): 690, Positive cache size: 647, Positive conditional cache size: 26, Positive unconditional cache size: 621, Negative cache size: 43, Negative conditional cache size: 18, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9018, Maximal queried relation: 6, Independence queries for same thread: 507 - StatisticsResult: Visitor Statistics States: 72, Transitions: 71, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 991, Transitions: 1310, Traversal time: 0.4s - StatisticsResult: Visitor Statistics States: 5999, Transitions: 7998, Traversal time: 0.7s - StatisticsResult: Visitor Statistics States: 5514, Transitions: 7293, Traversal time: 0.4s - StatisticsResult: Visitor Statistics States: 5664, Transitions: 7443, Traversal time: 0.5s - StatisticsResult: Visitor Statistics States: 5520, Transitions: 7299, Traversal time: 0.4s - StatisticsResult: Visitor Statistics States: 6506, Transitions: 7275, Traversal time: 0.9s - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - 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; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L715] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L716] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a=0] [L717] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a=0] [L718] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a=0] [L719] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=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=0] [L720] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=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=0] [L721] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=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=0] [L722] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=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=0] [L723] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=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=0] [L724] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=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=0] [L725] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=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=0] [L726] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=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=0] [L727] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=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=0] [L728] 0 int a$w_buff0; VAL [__unbuffered_cnt=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=0] [L729] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=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=0] [L730] 0 int a$w_buff1; VAL [__unbuffered_cnt=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=0] [L731] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=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] [L732] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=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] [L733] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=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] [L735] 0 int x = 0; VAL [__unbuffered_cnt=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, x=0] [L737] 0 int y = 0; VAL [__unbuffered_cnt=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, x=0, y=0] [L739] 0 int z = 0; VAL [__unbuffered_cnt=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, x=0, y=0, z=0] [L740] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=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, weak$$choice0=0, x=0, y=0, z=0] [L741] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=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, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L841] 0 pthread_t t1193; VAL [__unbuffered_cnt=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, t1193={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L842] FCALL, FORK 0 pthread_create(&t1193, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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, t1193={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L843] 0 pthread_t t1194; VAL [__unbuffered_cnt=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, t1193={5:0}, t1194={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t1194, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, t1193={5:0}, t1194={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1195; VAL [__unbuffered_cnt=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, t1193={5:0}, t1194={6:0}, t1195={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t1195, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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, t1193={5:0}, t1194={6:0}, t1195={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L745] 1 a$w_buff1 = a$w_buff0 [L746] 1 a$w_buff0 = 1 [L747] 1 a$w_buff1_used = a$w_buff0_used [L748] 1 a$w_buff0_used = (_Bool)1 [L749] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L749] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L750] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L751] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L752] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L753] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L754] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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=0, y=0, z=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=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] [L774] 2 x = 2 VAL [__unbuffered_cnt=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L777] 2 y = 1 VAL [__unbuffered_cnt=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L780] 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) [L781] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L782] 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 [L783] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L784] 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=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L789] 2 return 0; VAL [\result={0:0}, __unbuffered_cnt=1, __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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L794] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __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=2, y=2, z=0] [L797] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __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=2, y=2, z=1] [L800] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __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=2, y=2, z=1] [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 a$flush_delayed = weak$$choice2 [L806] 3 a$mem_tmp = a [L807] 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) [L808] 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)) [L809] 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)) [L810] 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)) [L811] 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)) [L812] 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)) [L813] 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)) [L814] 3 __unbuffered_p2_EBX = a [L815] 3 a = a$flush_delayed ? a$mem_tmp : a [L816] 3 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __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=2, y=2, z=1] [L760] 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) [L761] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L762] 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 [L763] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L764] 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 [\result={0:0}, __unbuffered_cnt=1, __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=2, y=2, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=2, __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=2, y=2, z=1] [L769] 1 return 0; VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __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=2, y=2, z=1] [L819] 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) [L820] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L821] 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 [L822] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L823] 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 [\result={0:0}, __unbuffered_cnt=2, __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=2, y=2, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=3, __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=2, y=2, z=1] [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __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, t1193={5:0}, t1194={6:0}, t1195={3:0}, weak$$choice2=0, x=2, y=2, z=1] [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=3, __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}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=1] [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 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) [L853] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L854] 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 [L855] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L856] 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 [\result={0:0}, __unbuffered_cnt=3, __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, t1193={5:0}, t1194={6:0}, t1195={3:0}, weak$$choice2=0, x=2, y=2, z=1] [L859] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=3, __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, t1193={5:0}, t1194={6:0}, t1195={3:0}, weak$$choice2=0, x=2, y=2, z=1] [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __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=2, y=2, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __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=2, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data for error location: P0Err0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 7 procedures, 143 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 7 procedures, 143 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 3.4s, 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: 62, 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.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 582 NumberOfCodeBlocks, 582 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 485 ConstructedInterpolants, 0 QuantifiedInterpolants, 2507 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-05-30 18:13:13,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2024-05-30 18:13:13,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-30 18:13:13,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...