/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 -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking IA --traceabstraction.criterion.for.conditional.commutativity.checking FORWARD -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-05 05:31:17,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-05 05:31:17,465 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-05 05:31:17,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-05 05:31:17,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-05 05:31:17,505 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-05 05:31:17,505 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-05 05:31:17,505 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-05 05:31:17,506 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-05 05:31:17,509 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-05 05:31:17,509 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-05 05:31:17,509 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-05 05:31:17,510 INFO L153 SettingsManager]: * Use SBE=true [2024-05-05 05:31:17,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-05 05:31:17,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-05 05:31:17,511 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-05 05:31:17,511 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-05 05:31:17,512 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-05 05:31:17,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-05 05:31:17,512 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-05 05:31:17,512 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-05 05:31:17,512 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-05 05:31:17,513 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-05 05:31:17,513 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-05 05:31:17,513 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-05 05:31:17,514 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-05 05:31:17,514 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-05 05:31:17,514 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-05 05:31:17,514 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-05 05:31:17,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-05 05:31:17,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-05 05:31:17,515 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-05 05:31:17,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-05 05:31:17,516 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-05 05:31:17,516 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-05 05:31:17,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-05 05:31:17,516 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-05 05:31:17,516 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-05 05:31:17,516 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-05 05:31:17,516 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: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> IA Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> FORWARD [2024-05-05 05:31:17,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-05 05:31:17,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-05 05:31:17,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-05 05:31:17,745 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-05 05:31:17,745 INFO L274 PluginConnector]: CDTParser initialized [2024-05-05 05:31:17,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i [2024-05-05 05:31:18,862 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-05 05:31:19,071 INFO L384 CDTParser]: Found 1 translation units. [2024-05-05 05:31:19,072 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i [2024-05-05 05:31:19,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d14011be5/6af2a15f4b8f4b1ea44c7322ea65d9a4/FLAGe18fd9e47 [2024-05-05 05:31:19,107 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/d14011be5/6af2a15f4b8f4b1ea44c7322ea65d9a4 [2024-05-05 05:31:19,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-05 05:31:19,112 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-05 05:31:19,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-05 05:31:19,114 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-05 05:31:19,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-05 05:31:19,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 05:31:19" (1/1) ... [2024-05-05 05:31:19,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@467bd0fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 05:31:19, skipping insertion in model container [2024-05-05 05:31:19,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.05 05:31:19" (1/1) ... [2024-05-05 05:31:19,196 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-05 05:31:19,344 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-05-05 05:31:19,512 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-05 05:31:19,526 INFO L202 MainTranslator]: Completed pre-run [2024-05-05 05:31:19,535 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-05-05 05:31:19,565 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-05 05:31:19,587 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-05 05:31:19,587 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-05 05:31:19,593 INFO L206 MainTranslator]: Completed translation [2024-05-05 05:31:19,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 05:31:19 WrapperNode [2024-05-05 05:31:19,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-05 05:31:19,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-05 05:31:19,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-05 05:31:19,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-05 05:31:19,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 05:31:19" (1/1) ... [2024-05-05 05:31:19,620 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 05:31:19" (1/1) ... [2024-05-05 05:31:19,636 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2024-05-05 05:31:19,637 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-05 05:31:19,637 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-05 05:31:19,637 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-05 05:31:19,637 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-05 05:31:19,644 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 05:31:19" (1/1) ... [2024-05-05 05:31:19,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 05:31:19" (1/1) ... [2024-05-05 05:31:19,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 05:31:19" (1/1) ... [2024-05-05 05:31:19,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 05:31:19" (1/1) ... [2024-05-05 05:31:19,652 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 05:31:19" (1/1) ... [2024-05-05 05:31:19,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 05:31:19" (1/1) ... [2024-05-05 05:31:19,654 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 05:31:19" (1/1) ... [2024-05-05 05:31:19,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 05:31:19" (1/1) ... [2024-05-05 05:31:19,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-05 05:31:19,658 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-05 05:31:19,659 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-05 05:31:19,659 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-05 05:31:19,659 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 05:31:19" (1/1) ... [2024-05-05 05:31:19,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-05 05:31:19,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 05:31:19,698 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-05 05:31:19,700 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-05 05:31:19,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-05 05:31:19,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-05 05:31:19,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-05 05:31:19,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-05 05:31:19,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-05 05:31:19,735 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-05 05:31:19,735 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-05 05:31:19,735 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-05 05:31:19,735 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-05 05:31:19,735 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-05 05:31:19,737 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-05 05:31:19,737 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-05-05 05:31:19,737 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-05-05 05:31:19,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-05 05:31:19,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-05 05:31:19,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-05 05:31:19,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-05 05:31:19,739 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-05 05:31:19,889 INFO L241 CfgBuilder]: Building ICFG [2024-05-05 05:31:19,891 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-05 05:31:20,184 INFO L282 CfgBuilder]: Performing block encoding [2024-05-05 05:31:20,282 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-05 05:31:20,282 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-05 05:31:20,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 05:31:20 BoogieIcfgContainer [2024-05-05 05:31:20,284 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-05 05:31:20,286 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-05 05:31:20,286 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-05 05:31:20,288 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-05 05:31:20,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.05 05:31:19" (1/3) ... [2024-05-05 05:31:20,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75506563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 05:31:20, skipping insertion in model container [2024-05-05 05:31:20,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.05 05:31:19" (2/3) ... [2024-05-05 05:31:20,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75506563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.05 05:31:20, skipping insertion in model container [2024-05-05 05:31:20,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.05 05:31:20" (3/3) ... [2024-05-05 05:31:20,291 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053_power.oepc_pso.oepc_rmo.oepc.i [2024-05-05 05:31:20,297 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-05 05:31:20,305 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-05 05:31:20,305 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-05-05 05:31:20,305 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-05 05:31:20,350 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-05 05:31:20,387 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-05 05:31:20,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-05 05:31:20,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-05 05:31:20,390 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-05 05:31:20,400 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-05 05:31:20,413 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-05 05:31:20,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 05:31:20,421 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-05 05:31:20,426 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;@7a23a973, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=FORWARD, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-05 05:31:20,426 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-05 05:31:20,470 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-05 05:31:20,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 05:31:20,472 INFO L85 PathProgramCache]: Analyzing trace with hash -353887217, now seen corresponding path program 1 times [2024-05-05 05:31:20,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 05:31:20,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244411084] [2024-05-05 05:31:20,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:31:20,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:31:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:31:20,783 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-05 05:31:20,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 05:31:20,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244411084] [2024-05-05 05:31:20,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244411084] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 05:31:20,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 05:31:20,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-05 05:31:20,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112703966] [2024-05-05 05:31:20,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 05:31:20,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-05 05:31:20,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 05:31:20,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-05 05:31:20,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-05 05:31:20,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:31:20,832 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 05:31:20,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 50.5) internal successors, (101), 2 states have internal predecessors, (101), 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-05 05:31:20,833 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:31:20,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:31:20,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-05 05:31:20,884 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-05 05:31:20,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 05:31:20,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1115660418, now seen corresponding path program 1 times [2024-05-05 05:31:20,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 05:31:20,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321795259] [2024-05-05 05:31:20,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:31:20,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:31:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:31:22,174 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-05 05:31:22,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 05:31:22,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321795259] [2024-05-05 05:31:22,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321795259] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 05:31:22,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 05:31:22,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-05 05:31:22,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225841657] [2024-05-05 05:31:22,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 05:31:22,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-05 05:31:22,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 05:31:22,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-05 05:31:22,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-05-05 05:31:22,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:31:22,196 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 05:31:22,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.285714285714286) internal successors, (93), 8 states have internal predecessors, (93), 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-05 05:31:22,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:31:22,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:31:22,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:31:22,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-05 05:31:22,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-05 05:31:22,272 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-05 05:31:22,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 05:31:22,273 INFO L85 PathProgramCache]: Analyzing trace with hash -660217561, now seen corresponding path program 1 times [2024-05-05 05:31:22,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 05:31:22,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475656886] [2024-05-05 05:31:22,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:31:22,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:31:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:31:22,686 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-05 05:31:22,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 05:31:22,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475656886] [2024-05-05 05:31:22,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475656886] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 05:31:22,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 05:31:22,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-05 05:31:22,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224963506] [2024-05-05 05:31:22,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 05:31:22,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-05 05:31:22,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 05:31:22,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-05 05:31:22,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-05 05:31:22,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:31:22,704 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 05:31:22,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 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-05 05:31:22,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:31:22,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-05 05:31:22,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:31:22,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:31:22,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-05 05:31:22,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-05 05:31:22,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-05 05:31:22,898 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-05 05:31:22,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 05:31:22,898 INFO L85 PathProgramCache]: Analyzing trace with hash -4583985, now seen corresponding path program 1 times [2024-05-05 05:31:22,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 05:31:22,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250024938] [2024-05-05 05:31:22,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:31:22,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:31:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:31:23,240 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-05 05:31:23,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 05:31:23,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250024938] [2024-05-05 05:31:23,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250024938] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 05:31:23,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 05:31:23,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-05 05:31:23,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196284454] [2024-05-05 05:31:23,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 05:31:23,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-05 05:31:23,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 05:31:23,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1981707744, now seen corresponding path program 1 times [2024-05-05 05:31:23,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:31:23,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:31:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:31:23,422 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:31:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:31:23,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-05 05:31:23,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-05 05:31:23,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:31:23,503 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 05:31:23,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 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-05 05:31:23,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:31:23,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-05 05:31:23,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-05 05:31:23,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:31:26,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:31:26,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-05 05:31:26,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-05 05:31:26,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-05 05:31:26,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3 [2024-05-05 05:31:26,295 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-05 05:31:26,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 05:31:26,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1517510069, now seen corresponding path program 2 times [2024-05-05 05:31:26,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 05:31:26,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130228992] [2024-05-05 05:31:26,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:31:26,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:31:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:31:26,517 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-05 05:31:26,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 05:31:26,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130228992] [2024-05-05 05:31:26,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130228992] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 05:31:26,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 05:31:26,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-05 05:31:26,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537537497] [2024-05-05 05:31:26,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 05:31:26,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-05 05:31:26,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 05:31:30,723 INFO L85 PathProgramCache]: Analyzing trace with hash -120650488, now seen corresponding path program 1 times [2024-05-05 05:31:30,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:31:30,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:31:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:31:30,746 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:31:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:31:30,851 INFO L85 PathProgramCache]: Analyzing trace with hash 554802563, now seen corresponding path program 1 times [2024-05-05 05:31:30,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:31:30,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:31:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:31:30,941 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-05 05:31:30,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:31:30,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:31:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:31:31,011 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-05 05:31:31,085 INFO L85 PathProgramCache]: Analyzing trace with hash -588567814, now seen corresponding path program 2 times [2024-05-05 05:31:31,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:31:31,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:31:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:31:31,115 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:31:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:31:31,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-05 05:31:31,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-05-05 05:31:31,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:31:31,148 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 05:31:31,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 20.555555555555557) internal successors, (185), 10 states have internal predecessors, (185), 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-05 05:31:31,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:31:31,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-05 05:31:31,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-05 05:31:31,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-05 05:31:31,149 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:31:33,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:31:33,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-05 05:31:33,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-05 05:31:33,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-05 05:31:33,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-05 05:31:33,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable9 [2024-05-05 05:31:33,031 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-05 05:31:33,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 05:31:33,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1420316357, now seen corresponding path program 3 times [2024-05-05 05:31:33,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 05:31:33,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305928893] [2024-05-05 05:31:33,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:31:33,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:31:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:31:33,269 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-05 05:31:33,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 05:31:33,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305928893] [2024-05-05 05:31:33,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305928893] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 05:31:33,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 05:31:33,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-05 05:31:33,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469450355] [2024-05-05 05:31:33,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 05:31:33,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-05 05:31:33,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 05:31:34,204 INFO L85 PathProgramCache]: Analyzing trace with hash -602334746, now seen corresponding path program 1 times [2024-05-05 05:31:34,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:31:34,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:31:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:31:34,411 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-05 05:31:34,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:31:34,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:31:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:31:34,489 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-05 05:31:40,685 INFO L85 PathProgramCache]: Analyzing trace with hash 976906407, now seen corresponding path program 1 times [2024-05-05 05:31:40,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:31:40,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:31:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:31:40,738 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:31:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:31:47,635 INFO L85 PathProgramCache]: Analyzing trace with hash 219327938, now seen corresponding path program 1 times [2024-05-05 05:31:47,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:31:47,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:31:47,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:31:47,665 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:31:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:31:53,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1790768120, now seen corresponding path program 1 times [2024-05-05 05:31:53,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:31:53,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:31:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:31:53,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:31:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:31:57,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1790768120, now seen corresponding path program 2 times [2024-05-05 05:31:57,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:31:57,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:31:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:31:57,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:31:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:32:04,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1790768120, now seen corresponding path program 3 times [2024-05-05 05:32:04,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:32:04,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:32:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:32:04,451 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-05 05:32:04,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:32:04,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:32:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:32:04,560 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-05 05:32:10,949 INFO L85 PathProgramCache]: Analyzing trace with hash 320763523, now seen corresponding path program 1 times [2024-05-05 05:32:10,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:32:10,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:32:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:32:10,964 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:32:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:32:11,042 INFO L85 PathProgramCache]: Analyzing trace with hash 320763523, now seen corresponding path program 2 times [2024-05-05 05:32:11,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:32:11,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:32:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:32:11,111 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-05 05:32:11,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:32:11,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:32:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:32:11,151 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-05 05:32:18,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1353735017, now seen corresponding path program 1 times [2024-05-05 05:32:18,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:32:18,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:32:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:32:18,658 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:32:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:32:25,066 INFO L85 PathProgramCache]: Analyzing trace with hash -983887036, now seen corresponding path program 1 times [2024-05-05 05:32:25,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:32:25,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:32:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:32:25,091 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:32:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:32:31,205 INFO L85 PathProgramCache]: Analyzing trace with hash -435726646, now seen corresponding path program 1 times [2024-05-05 05:32:31,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:32:31,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:32:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:32:31,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:32:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:32:34,206 INFO L85 PathProgramCache]: Analyzing trace with hash -622623730, now seen corresponding path program 1 times [2024-05-05 05:32:34,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:32:34,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:32:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:32:34,222 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:32:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:32:34,306 INFO L85 PathProgramCache]: Analyzing trace with hash -2121466037, now seen corresponding path program 1 times [2024-05-05 05:32:34,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:32:34,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:32:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:32:34,369 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-05 05:32:34,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:32:34,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:32:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:32:34,422 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-05 05:32:34,491 INFO L85 PathProgramCache]: Analyzing trace with hash -371786700, now seen corresponding path program 3 times [2024-05-05 05:32:34,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:32:34,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:32:34,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:32:34,515 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:32:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:32:34,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-05-05 05:32:34,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2024-05-05 05:32:34,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:32:34,557 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 05:32:34,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 24.0) internal successors, (312), 16 states have internal predecessors, (312), 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-05 05:32:34,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:32:34,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-05 05:32:34,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-05 05:32:34,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-05 05:32:34,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-05 05:32:34,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:32:38,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:32:38,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-05 05:32:38,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-05 05:32:38,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-05 05:32:38,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-05 05:32:38,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-05 05:32:38,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable10,SelfDestructingSolverStorable21,SelfDestructingSolverStorable11,SelfDestructingSolverStorable22,SelfDestructingSolverStorable12,SelfDestructingSolverStorable23,SelfDestructingSolverStorable13,SelfDestructingSolverStorable24,SelfDestructingSolverStorable14,SelfDestructingSolverStorable25,SelfDestructingSolverStorable15,SelfDestructingSolverStorable26,SelfDestructingSolverStorable16,SelfDestructingSolverStorable27,SelfDestructingSolverStorable17,SelfDestructingSolverStorable28 [2024-05-05 05:32:38,187 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-05 05:32:38,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 05:32:38,188 INFO L85 PathProgramCache]: Analyzing trace with hash -298407973, now seen corresponding path program 4 times [2024-05-05 05:32:38,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 05:32:38,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601811790] [2024-05-05 05:32:38,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:32:38,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:32:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:32:38,372 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-05 05:32:38,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 05:32:38,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601811790] [2024-05-05 05:32:38,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601811790] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 05:32:38,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 05:32:38,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-05 05:32:38,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552193678] [2024-05-05 05:32:38,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 05:32:38,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-05 05:32:38,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 05:32:41,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1244420203, now seen corresponding path program 1 times [2024-05-05 05:32:41,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:32:41,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:32:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:32:41,939 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:32:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:32:42,020 INFO L85 PathProgramCache]: Analyzing trace with hash -77678976, now seen corresponding path program 1 times [2024-05-05 05:32:42,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:32:42,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:32:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:32:42,085 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-05 05:32:42,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:32:42,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:32:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:32:42,126 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-05 05:32:45,030 INFO L85 PathProgramCache]: Analyzing trace with hash -229231506, now seen corresponding path program 1 times [2024-05-05 05:32:45,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:32:45,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:32:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:32:45,062 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:32:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:32:45,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1483758308, now seen corresponding path program 1 times [2024-05-05 05:32:45,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:32:45,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:32:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:32:45,209 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-05 05:32:45,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:32:45,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:32:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:32:45,262 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-05 05:32:45,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1577215596, now seen corresponding path program 4 times [2024-05-05 05:32:45,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:32:45,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:32:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:32:45,471 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:32:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:32:45,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-05 05:32:45,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-05-05 05:32:45,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:32:45,495 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 05:32:45,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 18.6) internal successors, (186), 11 states have internal predecessors, (186), 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-05 05:32:45,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:32:45,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-05 05:32:45,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-05 05:32:45,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-05 05:32:45,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-05 05:32:45,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-05 05:32:45,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:32:48,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:32:48,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-05 05:32:48,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-05 05:32:48,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-05 05:32:48,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-05 05:32:48,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-05-05 05:32:48,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-05 05:32:48,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36 [2024-05-05 05:32:48,340 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-05 05:32:48,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 05:32:48,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1343742917, now seen corresponding path program 5 times [2024-05-05 05:32:48,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 05:32:48,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031829721] [2024-05-05 05:32:48,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:32:48,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:32:48,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:32:48,501 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-05 05:32:48,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-05 05:32:48,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031829721] [2024-05-05 05:32:48,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031829721] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-05 05:32:48,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-05 05:32:48,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-05 05:32:48,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036378163] [2024-05-05 05:32:48,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-05 05:32:48,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-05 05:32:48,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-05 05:32:49,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1830495453, now seen corresponding path program 1 times [2024-05-05 05:32:49,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:32:49,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:32:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:32:49,534 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-05 05:32:49,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:32:49,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:32:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:32:49,579 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-05 05:32:57,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1830473380, now seen corresponding path program 1 times [2024-05-05 05:32:57,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:32:57,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:32:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:32:57,029 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:32:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:33:05,689 INFO L85 PathProgramCache]: Analyzing trace with hash 910100325, now seen corresponding path program 1 times [2024-05-05 05:33:05,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:33:05,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:33:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:33:05,698 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:33:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:33:12,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1851660603, now seen corresponding path program 1 times [2024-05-05 05:33:12,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:33:12,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:33:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:33:12,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:33:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:33:15,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1851660603, now seen corresponding path program 2 times [2024-05-05 05:33:15,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:33:15,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:33:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:33:15,393 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:33:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:33:21,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1851660603, now seen corresponding path program 3 times [2024-05-05 05:33:21,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:33:21,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:33:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:33:21,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:33:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:33:28,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1566903450, now seen corresponding path program 1 times [2024-05-05 05:33:28,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:33:28,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:33:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:33:28,054 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:33:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:33:28,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1566903450, now seen corresponding path program 2 times [2024-05-05 05:33:28,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:33:28,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:33:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:33:28,171 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-05 05:33:28,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:33:28,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:33:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:33:28,203 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-05 05:33:35,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1329366298, now seen corresponding path program 1 times [2024-05-05 05:33:35,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:33:35,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:33:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:33:35,507 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:33:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:33:43,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1739318119, now seen corresponding path program 1 times [2024-05-05 05:33:43,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:33:43,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:33:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:33:43,134 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:33:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:33:50,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1915712761, now seen corresponding path program 1 times [2024-05-05 05:33:50,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:33:50,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:33:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:33:50,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:33:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:33:57,882 INFO L85 PathProgramCache]: Analyzing trace with hash 742446953, now seen corresponding path program 1 times [2024-05-05 05:33:57,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:33:57,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:33:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:33:57,892 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:33:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:34:00,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1541019464, now seen corresponding path program 1 times [2024-05-05 05:34:00,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:34:00,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:34:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:34:00,870 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:34:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:34:08,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1541019464, now seen corresponding path program 2 times [2024-05-05 05:34:08,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:34:08,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:34:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:34:08,769 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:34:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:34:15,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1541019464, now seen corresponding path program 3 times [2024-05-05 05:34:15,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:34:15,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:34:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:34:15,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:34:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:34:15,438 INFO L85 PathProgramCache]: Analyzing trace with hash 526963530, now seen corresponding path program 1 times [2024-05-05 05:34:15,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:34:15,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:34:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:34:15,501 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-05 05:34:15,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:34:15,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:34:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:34:15,541 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-05 05:34:24,205 INFO L85 PathProgramCache]: Analyzing trace with hash 526963530, now seen corresponding path program 2 times [2024-05-05 05:34:24,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:34:24,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:34:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:34:24,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:34:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:34:30,910 INFO L85 PathProgramCache]: Analyzing trace with hash -843999351, now seen corresponding path program 1 times [2024-05-05 05:34:30,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:34:30,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:34:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:34:30,921 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:34:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:34:38,439 INFO L85 PathProgramCache]: Analyzing trace with hash -394175701, now seen corresponding path program 1 times [2024-05-05 05:34:38,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:34:38,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:34:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:34:38,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:34:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:34:45,927 INFO L85 PathProgramCache]: Analyzing trace with hash 665455562, now seen corresponding path program 2 times [2024-05-05 05:34:45,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:34:45,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:34:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:34:45,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:34:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:34:49,414 INFO L85 PathProgramCache]: Analyzing trace with hash -845713650, now seen corresponding path program 2 times [2024-05-05 05:34:49,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:34:49,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:34:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:34:49,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:34:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:34:49,508 INFO L85 PathProgramCache]: Analyzing trace with hash -447318965, now seen corresponding path program 2 times [2024-05-05 05:34:49,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:34:49,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:34:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:34:49,572 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-05 05:34:49,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:34:49,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:34:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-05 05:34:49,619 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-05 05:34:49,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1310854860, now seen corresponding path program 5 times [2024-05-05 05:34:49,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:34:49,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:34:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:34:49,704 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:34:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:34:49,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-05-05 05:34:49,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-05-05 05:34:49,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:34:49,723 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-05 05:34:49,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 23.76923076923077) internal successors, (309), 15 states have internal predecessors, (309), 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-05 05:34:49,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:34:49,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-05 05:34:49,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-05 05:34:49,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-05 05:34:49,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-05 05:34:49,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-05-05 05:34:49,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-05-05 05:34:49,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:34:55,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-05 05:34:55,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-05 05:34:55,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-05 05:34:55,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-05 05:34:55,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-05 05:34:55,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-05-05 05:34:55,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-05-05 05:34:55,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-05 05:34:55,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,SelfDestructingSolverStorable54,SelfDestructingSolverStorable55,SelfDestructingSolverStorable56,SelfDestructingSolverStorable57,SelfDestructingSolverStorable58,SelfDestructingSolverStorable37,SelfDestructingSolverStorable59,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39,SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,SelfDestructingSolverStorable40,SelfDestructingSolverStorable62,SelfDestructingSolverStorable41,SelfDestructingSolverStorable63,SelfDestructingSolverStorable42,SelfDestructingSolverStorable64,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49 [2024-05-05 05:34:55,882 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-05-05 05:34:55,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-05 05:34:55,883 INFO L85 PathProgramCache]: Analyzing trace with hash -489811135, now seen corresponding path program 6 times [2024-05-05 05:34:55,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-05 05:34:55,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459836454] [2024-05-05 05:34:55,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-05 05:34:55,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-05 05:34:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:34:55,936 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-05 05:34:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-05 05:34:55,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-05 05:34:55,967 INFO L363 BasicCegarLoop]: Counterexample is feasible [2024-05-05 05:34:55,968 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-05-05 05:34:55,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-05-05 05:34:55,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-05-05 05:34:55,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-05-05 05:34:55,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-05-05 05:34:55,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-05-05 05:34:55,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-05-05 05:34:55,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-05-05 05:34:55,979 INFO L448 BasicCegarLoop]: Path program histogram: [6, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-05 05:34:55,984 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-05 05:34:55,984 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-05 05:34:56,065 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2024-05-05 05:34:56,066 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2024-05-05 05:34:56,066 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2024-05-05 05:34:56,067 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2024-05-05 05:34:56,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.05 05:34:56 BasicIcfg [2024-05-05 05:34:56,094 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-05 05:34:56,095 INFO L158 Benchmark]: Toolchain (without parser) took 216982.81ms. Allocated memory was 190.8MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 119.0MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 377.5MB. Max. memory is 8.0GB. [2024-05-05 05:34:56,095 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 190.8MB. Free memory is still 154.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-05 05:34:56,095 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.56ms. Allocated memory was 190.8MB in the beginning and 231.7MB in the end (delta: 40.9MB). Free memory was 118.8MB in the beginning and 180.3MB in the end (delta: -61.5MB). Peak memory consumption was 5.4MB. Max. memory is 8.0GB. [2024-05-05 05:34:56,095 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.26ms. Allocated memory is still 231.7MB. Free memory was 180.3MB in the beginning and 178.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-05 05:34:56,095 INFO L158 Benchmark]: Boogie Preprocessor took 20.82ms. Allocated memory is still 231.7MB. Free memory was 177.7MB in the beginning and 176.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-05 05:34:56,095 INFO L158 Benchmark]: RCFGBuilder took 625.45ms. Allocated memory is still 231.7MB. Free memory was 176.1MB in the beginning and 133.7MB in the end (delta: 42.5MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2024-05-05 05:34:56,096 INFO L158 Benchmark]: TraceAbstraction took 215808.64ms. Allocated memory was 231.7MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 132.1MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 349.0MB. Max. memory is 8.0GB. [2024-05-05 05:34:56,096 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.11ms. Allocated memory is still 190.8MB. Free memory is still 154.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 479.56ms. Allocated memory was 190.8MB in the beginning and 231.7MB in the end (delta: 40.9MB). Free memory was 118.8MB in the beginning and 180.3MB in the end (delta: -61.5MB). Peak memory consumption was 5.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.26ms. Allocated memory is still 231.7MB. Free memory was 180.3MB in the beginning and 178.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.82ms. Allocated memory is still 231.7MB. Free memory was 177.7MB in the beginning and 176.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 625.45ms. Allocated memory is still 231.7MB. Free memory was 176.1MB in the beginning and 133.7MB in the end (delta: 42.5MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * TraceAbstraction took 215808.64ms. Allocated memory was 231.7MB in the beginning and 4.5GB in the end (delta: 4.3GB). Free memory was 132.1MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 349.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1725249, independent: 1676855, independent conditional: 1676282, independent unconditional: 573, dependent: 48394, dependent conditional: 48390, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1695819, independent: 1676855, independent conditional: 1676282, independent unconditional: 573, dependent: 18964, dependent conditional: 18960, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1695819, independent: 1676855, independent conditional: 1676282, independent unconditional: 573, dependent: 18964, dependent conditional: 18960, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1695819, independent: 1676855, independent conditional: 1676282, independent unconditional: 573, dependent: 18964, dependent conditional: 18960, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1891745, independent: 1676855, independent conditional: 45905, independent unconditional: 1630950, dependent: 214890, dependent conditional: 131629, dependent unconditional: 83261, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1891745, independent: 1676855, independent conditional: 45498, independent unconditional: 1631357, dependent: 214890, dependent conditional: 34524, dependent unconditional: 180366, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1891745, independent: 1676855, independent conditional: 45498, independent unconditional: 1631357, dependent: 214890, dependent conditional: 34524, dependent unconditional: 180366, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1609, independent: 1463, independent conditional: 293, independent unconditional: 1170, dependent: 146, dependent conditional: 115, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1609, independent: 1163, independent conditional: 0, independent unconditional: 1163, dependent: 446, dependent conditional: 0, dependent unconditional: 446, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 446, independent: 300, independent conditional: 291, independent unconditional: 9, dependent: 146, dependent conditional: 115, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 446, independent: 300, independent conditional: 291, independent unconditional: 9, dependent: 146, dependent conditional: 115, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2128, independent: 858, independent conditional: 849, independent unconditional: 9, dependent: 1270, dependent conditional: 1062, dependent unconditional: 208, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1891745, independent: 1675392, independent conditional: 45205, independent unconditional: 1630187, dependent: 214744, dependent conditional: 34409, dependent unconditional: 180335, unknown: 1609, unknown conditional: 408, unknown unconditional: 1201] , Statistics on independence cache: Total cache size (in pairs): 1609, Positive cache size: 1463, Positive conditional cache size: 293, Positive unconditional cache size: 1170, Negative cache size: 146, Negative conditional cache size: 115, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 97512, Maximal queried relation: 7, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1891745, independent: 1676855, independent conditional: 45905, independent unconditional: 1630950, dependent: 214890, dependent conditional: 131629, dependent unconditional: 83261, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1891745, independent: 1676855, independent conditional: 45498, independent unconditional: 1631357, dependent: 214890, dependent conditional: 34524, dependent unconditional: 180366, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1891745, independent: 1676855, independent conditional: 45498, independent unconditional: 1631357, dependent: 214890, dependent conditional: 34524, dependent unconditional: 180366, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1609, independent: 1463, independent conditional: 293, independent unconditional: 1170, dependent: 146, dependent conditional: 115, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1609, independent: 1163, independent conditional: 0, independent unconditional: 1163, dependent: 446, dependent conditional: 0, dependent unconditional: 446, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 446, independent: 300, independent conditional: 291, independent unconditional: 9, dependent: 146, dependent conditional: 115, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 446, independent: 300, independent conditional: 291, independent unconditional: 9, dependent: 146, dependent conditional: 115, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2128, independent: 858, independent conditional: 849, independent unconditional: 9, dependent: 1270, dependent conditional: 1062, dependent unconditional: 208, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1891745, independent: 1675392, independent conditional: 45205, independent unconditional: 1630187, dependent: 214744, dependent conditional: 34409, dependent unconditional: 180335, unknown: 1609, unknown conditional: 408, unknown unconditional: 1201] , Statistics on independence cache: Total cache size (in pairs): 1609, Positive cache size: 1463, Positive conditional cache size: 293, Positive unconditional cache size: 1170, Negative cache size: 146, Negative conditional cache size: 115, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 97512 ], Independence queries for same thread: 29430 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0] [L717] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a=0] [L718] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a=0] [L719] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a=0] [L720] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a=0] [L721] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L722] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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] [L723] 0 _Bool a$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a=0] [L724] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a=0] [L725] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a=0] [L726] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a=0] [L727] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a=0] [L728] 0 _Bool a$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a=0] [L729] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a=0] [L730] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a=0] [L731] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a=0] [L732] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a=0] [L733] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L734] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L735] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L736] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L738] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L740] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L742] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L743] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L744] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L859] 0 pthread_t t1409; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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, t1409={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L860] FCALL, FORK 0 pthread_create(&t1409, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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, t1409={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1410; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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, t1409={5:0}, t1410={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L862] FCALL, FORK 0 pthread_create(&t1410, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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, t1409={5:0}, t1410={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1411; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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, t1409={5:0}, t1410={6:0}, t1411={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L864] FCALL, FORK 0 pthread_create(&t1411, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1409={5:0}, t1410={6:0}, t1411={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1412; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1409={5:0}, t1410={6:0}, t1411={7:0}, t1412={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] FCALL, FORK 0 pthread_create(&t1412, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1409={5:0}, t1410={6:0}, t1411={7:0}, t1412={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L784] 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) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 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 [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 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_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L793] 2 return 0; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L798] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L801] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L804] 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) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 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 [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 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=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L813] 3 return 0; VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L818] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 a$flush_delayed = weak$$choice2 [L824] 4 a$mem_tmp = a [L825] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L826] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L827] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L828] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L829] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L831] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = a [L833] 4 a = a$flush_delayed ? a$mem_tmp : a [L834] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] [L837] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] [L846] 4 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] [L764] 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) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 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 [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 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}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=1, main$tmp_guard1=0, t1409={5:0}, t1410={6:0}, t1411={7:0}, t1412={3:0}, weak$$choice2=1, x=2, y=2, z=1] [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] 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) [L873] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] 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 [L875] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] 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}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=1, main$tmp_guard1=0, t1409={5:0}, t1410={6:0}, t1411={7:0}, t1412={3:0}, weak$$choice2=1, x=2, y=2, z=1] [L879] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=1, main$tmp_guard1=0, t1409={5:0}, t1410={6:0}, t1411={7:0}, t1412={3:0}, weak$$choice2=1, x=2, y=2, z=1] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 866]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 167 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 215.6s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 6, EmptinessCheckTime: 17.7s, 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: 125, 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.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 924 NumberOfCodeBlocks, 924 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 811 ConstructedInterpolants, 0 QuantifiedInterpolants, 2906 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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, ConditionalCommutativityCheckTime: 194.4s, ConditionalCommutativityIAIntegrations: 11, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 48, ConditionalCommutativityTraceChecks: 46, ConditionalCommutativityImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2024-05-05 05:34:56,129 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-05 05:34:56,349 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...