/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 DFS --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe026_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-06 20:24:27,466 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-06 20:24:27,539 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-06 20:24:27,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-06 20:24:27,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-06 20:24:27,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-06 20:24:27,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-06 20:24:27,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-06 20:24:27,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-06 20:24:27,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-06 20:24:27,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-06 20:24:27,576 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-06 20:24:27,577 INFO L153 SettingsManager]: * Use SBE=true [2024-05-06 20:24:27,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-06 20:24:27,577 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-06 20:24:27,578 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-06 20:24:27,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-06 20:24:27,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-06 20:24:27,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-06 20:24:27,579 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-06 20:24:27,579 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-06 20:24:27,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-06 20:24:27,584 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-06 20:24:27,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-06 20:24:27,584 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-06 20:24:27,585 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-06 20:24:27,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-06 20:24:27,585 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-06 20:24:27,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-06 20:24:27,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 20:24:27,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-06 20:24:27,586 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-06 20:24:27,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-06 20:24:27,587 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-06 20:24:27,587 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-06 20:24:27,588 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-06 20:24:27,588 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-06 20:24:27,588 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-06 20:24:27,588 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-06 20:24:27,589 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 -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-06 20:24:27,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-06 20:24:27,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-06 20:24:27,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-06 20:24:27,902 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-06 20:24:27,902 INFO L274 PluginConnector]: CDTParser initialized [2024-05-06 20:24:27,903 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/safe026_tso.i [2024-05-06 20:24:29,125 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-06 20:24:29,359 INFO L384 CDTParser]: Found 1 translation units. [2024-05-06 20:24:29,360 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe026_tso.i [2024-05-06 20:24:29,374 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8d4fb4801/adeb722a104d4baea5a27eb49f67c243/FLAG85cfd8c79 [2024-05-06 20:24:29,387 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8d4fb4801/adeb722a104d4baea5a27eb49f67c243 [2024-05-06 20:24:29,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-06 20:24:29,390 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-06 20:24:29,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-06 20:24:29,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-06 20:24:29,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-06 20:24:29,397 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 08:24:29" (1/1) ... [2024-05-06 20:24:29,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@624ef163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:24:29, skipping insertion in model container [2024-05-06 20:24:29,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 08:24:29" (1/1) ... [2024-05-06 20:24:29,446 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-06 20:24:29,601 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/safe026_tso.i[945,958] [2024-05-06 20:24:29,787 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 20:24:29,799 INFO L202 MainTranslator]: Completed pre-run [2024-05-06 20:24:29,815 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/safe026_tso.i[945,958] [2024-05-06 20:24:29,863 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-06 20:24:29,898 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 20:24:29,898 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-05-06 20:24:29,905 INFO L206 MainTranslator]: Completed translation [2024-05-06 20:24:29,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:24:29 WrapperNode [2024-05-06 20:24:29,906 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-06 20:24:29,907 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-06 20:24:29,907 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-06 20:24:29,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-06 20:24:29,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:24:29" (1/1) ... [2024-05-06 20:24:29,945 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:24:29" (1/1) ... [2024-05-06 20:24:29,968 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2024-05-06 20:24:29,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-06 20:24:29,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-06 20:24:29,970 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-06 20:24:29,970 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-06 20:24:29,978 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:24:29" (1/1) ... [2024-05-06 20:24:29,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:24:29" (1/1) ... [2024-05-06 20:24:29,989 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:24:29" (1/1) ... [2024-05-06 20:24:29,990 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:24:29" (1/1) ... [2024-05-06 20:24:29,999 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:24:29" (1/1) ... [2024-05-06 20:24:30,005 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:24:29" (1/1) ... [2024-05-06 20:24:30,007 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:24:29" (1/1) ... [2024-05-06 20:24:30,008 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:24:29" (1/1) ... [2024-05-06 20:24:30,010 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-06 20:24:30,010 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-06 20:24:30,010 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-06 20:24:30,010 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-06 20:24:30,011 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:24:29" (1/1) ... [2024-05-06 20:24:30,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-06 20:24:30,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 20:24:30,049 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-06 20:24:30,075 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-06 20:24:30,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-06 20:24:30,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-06 20:24:30,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-06 20:24:30,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-06 20:24:30,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-06 20:24:30,101 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-06 20:24:30,101 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-06 20:24:30,101 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-06 20:24:30,102 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-06 20:24:30,102 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-06 20:24:30,103 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-06 20:24:30,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-06 20:24:30,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-06 20:24:30,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-06 20:24:30,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-06 20:24:30,105 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-06 20:24:30,231 INFO L241 CfgBuilder]: Building ICFG [2024-05-06 20:24:30,233 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-06 20:24:30,413 INFO L282 CfgBuilder]: Performing block encoding [2024-05-06 20:24:30,423 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-06 20:24:30,424 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-06 20:24:30,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 08:24:30 BoogieIcfgContainer [2024-05-06 20:24:30,425 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-06 20:24:30,445 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-06 20:24:30,445 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-06 20:24:30,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-06 20:24:30,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 08:24:29" (1/3) ... [2024-05-06 20:24:30,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@210a1d2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 08:24:30, skipping insertion in model container [2024-05-06 20:24:30,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 08:24:29" (2/3) ... [2024-05-06 20:24:30,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@210a1d2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 08:24:30, skipping insertion in model container [2024-05-06 20:24:30,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 08:24:30" (3/3) ... [2024-05-06 20:24:30,487 INFO L112 eAbstractionObserver]: Analyzing ICFG safe026_tso.i [2024-05-06 20:24:30,496 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-06 20:24:30,506 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-06 20:24:30,506 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-06 20:24:30,506 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-06 20:24:30,583 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-06 20:24:30,619 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-06 20:24:30,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-06 20:24:30,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-06 20:24:30,621 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-06 20:24:30,623 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-06 20:24:30,655 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-06 20:24:30,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 20:24:30,668 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-06 20:24:30,675 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;@604cdf20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-06 20:24:30,675 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-05-06 20:24:30,748 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 20:24:30,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 20:24:30,752 INFO L85 PathProgramCache]: Analyzing trace with hash 503028225, now seen corresponding path program 1 times [2024-05-06 20:24:30,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 20:24:30,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671122000] [2024-05-06 20:24:30,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:30,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 20:24:31,055 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-06 20:24:31,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 20:24:31,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671122000] [2024-05-06 20:24:31,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671122000] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 20:24:31,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 20:24:31,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-06 20:24:31,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322166571] [2024-05-06 20:24:31,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 20:24:31,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-06 20:24:31,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 20:24:31,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-06 20:24:31,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-06 20:24:31,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:24:31,086 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 20:24:31,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 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-06 20:24:31,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:24:31,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:24:31,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-06 20:24:31,116 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 20:24:31,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 20:24:31,116 INFO L85 PathProgramCache]: Analyzing trace with hash 7970047, now seen corresponding path program 1 times [2024-05-06 20:24:31,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 20:24:31,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497123116] [2024-05-06 20:24:31,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:31,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 20:24:31,520 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-06 20:24:31,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 20:24:31,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497123116] [2024-05-06 20:24:31,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497123116] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 20:24:31,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 20:24:31,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-06 20:24:31,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947772489] [2024-05-06 20:24:31,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 20:24:31,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-06 20:24:31,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 20:24:31,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-06 20:24:31,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-06 20:24:31,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:24:31,524 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 20:24:31,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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-06 20:24:31,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:24:31,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:24:31,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1832159947, now seen corresponding path program 1 times [2024-05-06 20:24:31,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:31,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:31,903 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:24:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:31,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:24:31,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-06 20:24:31,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1 [2024-05-06 20:24:31,998 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 20:24:31,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 20:24:31,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1210154505, now seen corresponding path program 1 times [2024-05-06 20:24:31,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 20:24:32,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41123873] [2024-05-06 20:24:32,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:32,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 20:24:32,324 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-06 20:24:32,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 20:24:32,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41123873] [2024-05-06 20:24:32,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41123873] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 20:24:32,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 20:24:32,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-06 20:24:32,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293529489] [2024-05-06 20:24:32,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 20:24:32,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-06 20:24:32,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 20:24:32,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-06 20:24:32,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-06 20:24:32,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:24:32,327 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 20:24:32,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-06 20:24:32,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:24:32,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-06 20:24:32,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:24:32,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1832159947, now seen corresponding path program 2 times [2024-05-06 20:24:32,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:32,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:32,557 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:24:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:32,795 INFO L85 PathProgramCache]: Analyzing trace with hash 814084020, now seen corresponding path program 1 times [2024-05-06 20:24:32,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:32,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:32,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:32,819 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:24:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:32,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1406885302, now seen corresponding path program 1 times [2024-05-06 20:24:32,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:32,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:32,998 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:24:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:33,465 INFO L85 PathProgramCache]: Analyzing trace with hash 767256150, now seen corresponding path program 1 times [2024-05-06 20:24:33,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:33,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:33,483 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:24:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:33,581 INFO L85 PathProgramCache]: Analyzing trace with hash -390891793, now seen corresponding path program 1 times [2024-05-06 20:24:33,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:33,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:33,602 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:24:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:33,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1788505986, now seen corresponding path program 1 times [2024-05-06 20:24:33,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:33,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:33,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:24:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:33,763 INFO L85 PathProgramCache]: Analyzing trace with hash 611883080, now seen corresponding path program 1 times [2024-05-06 20:24:33,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:33,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:33,781 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:24:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:33,841 INFO L85 PathProgramCache]: Analyzing trace with hash 158285533, now seen corresponding path program 1 times [2024-05-06 20:24:33,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:33,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:33,854 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:24:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:33,905 INFO L85 PathProgramCache]: Analyzing trace with hash -2073103926, now seen corresponding path program 1 times [2024-05-06 20:24:33,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:33,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:33,914 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:24:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:34,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2006536941, now seen corresponding path program 1 times [2024-05-06 20:24:34,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:34,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:34,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:24:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:34,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1034558287, now seen corresponding path program 1 times [2024-05-06 20:24:34,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:34,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:34,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:24:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:34,221 INFO L85 PathProgramCache]: Analyzing trace with hash 596096911, now seen corresponding path program 1 times [2024-05-06 20:24:34,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:34,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:34,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:24:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:34,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1543249922, now seen corresponding path program 1 times [2024-05-06 20:24:34,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:34,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:34,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:24:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:34,378 INFO L85 PathProgramCache]: Analyzing trace with hash -504404381, now seen corresponding path program 1 times [2024-05-06 20:24:34,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:34,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:34,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:24:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:34,461 INFO L85 PathProgramCache]: Analyzing trace with hash -986101943, now seen corresponding path program 1 times [2024-05-06 20:24:34,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:34,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:34,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:24:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:34,525 INFO L85 PathProgramCache]: Analyzing trace with hash 106738920, now seen corresponding path program 1 times [2024-05-06 20:24:34,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:34,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:34,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:24:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:34,589 INFO L85 PathProgramCache]: Analyzing trace with hash -2074764409, now seen corresponding path program 1 times [2024-05-06 20:24:34,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:34,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:34,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:24:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:34,751 INFO L85 PathProgramCache]: Analyzing trace with hash -27762075, now seen corresponding path program 3 times [2024-05-06 20:24:34,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:34,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:34,762 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:24:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:34,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:24:34,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-05-06 20:24:34,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-06 20:24:34,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,SelfDestructingSolverStorable4,SelfDestructingSolverStorable18,SelfDestructingSolverStorable3,SelfDestructingSolverStorable19,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable21,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-05-06 20:24:34,780 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 20:24:34,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 20:24:34,781 INFO L85 PathProgramCache]: Analyzing trace with hash 531906351, now seen corresponding path program 2 times [2024-05-06 20:24:34,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 20:24:34,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131337176] [2024-05-06 20:24:34,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:34,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 20:24:34,927 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-06 20:24:34,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 20:24:34,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131337176] [2024-05-06 20:24:34,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131337176] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 20:24:34,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 20:24:34,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 20:24:34,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872559836] [2024-05-06 20:24:34,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 20:24:34,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 20:24:34,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 20:24:34,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 20:24:34,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-06 20:24:34,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:24:34,930 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 20:24:34,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-06 20:24:34,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:24:34,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-05-06 20:24:34,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-06 20:24:34,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:24:35,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1832159947, now seen corresponding path program 4 times [2024-05-06 20:24:35,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:35,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:35,023 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:24:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:35,132 INFO L85 PathProgramCache]: Analyzing trace with hash 814084020, now seen corresponding path program 2 times [2024-05-06 20:24:35,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:35,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:35,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:24:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:35,272 INFO L85 PathProgramCache]: Analyzing trace with hash 767256150, now seen corresponding path program 2 times [2024-05-06 20:24:35,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:35,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:35,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:24:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:35,349 INFO L85 PathProgramCache]: Analyzing trace with hash -390891793, now seen corresponding path program 2 times [2024-05-06 20:24:35,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:35,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:35,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:24:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:35,479 INFO L85 PathProgramCache]: Analyzing trace with hash 596096911, now seen corresponding path program 2 times [2024-05-06 20:24:35,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:35,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:35,488 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:24:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:35,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1543249922, now seen corresponding path program 2 times [2024-05-06 20:24:35,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:35,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:35,570 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:24:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:35,626 INFO L85 PathProgramCache]: Analyzing trace with hash -504404381, now seen corresponding path program 2 times [2024-05-06 20:24:35,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:35,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:35,637 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:24:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:35,731 INFO L85 PathProgramCache]: Analyzing trace with hash -986101943, now seen corresponding path program 2 times [2024-05-06 20:24:35,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:35,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:35,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:24:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:37,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1699623521, now seen corresponding path program 1 times [2024-05-06 20:24:37,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:37,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:37,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-06 20:24:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-06 20:24:37,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:24:37,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-06 20:24:37,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-06 20:24:37,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 20:24:37,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-06 20:24:37,248 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 20:24:37,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 20:24:37,249 INFO L85 PathProgramCache]: Analyzing trace with hash -408969335, now seen corresponding path program 3 times [2024-05-06 20:24:37,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 20:24:37,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957134602] [2024-05-06 20:24:37,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:37,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 20:24:37,406 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-06 20:24:37,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 20:24:37,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957134602] [2024-05-06 20:24:37,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957134602] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 20:24:37,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 20:24:37,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 20:24:37,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860342413] [2024-05-06 20:24:37,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 20:24:37,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 20:24:37,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 20:24:37,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 20:24:37,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-06 20:24:37,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:24:37,413 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 20:24:37,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-06 20:24:37,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:24:37,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-06 20:24:37,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-06 20:24:37,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 20:24:37,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:24:38,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:24:38,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-06 20:24:38,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-06 20:24:38,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 20:24:38,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 20:24:38,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-06 20:24:38,599 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-05-06 20:24:38,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-06 20:24:38,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1284740279, now seen corresponding path program 4 times [2024-05-06 20:24:38,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-06 20:24:38,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078773251] [2024-05-06 20:24:38,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-06 20:24:38,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-06 20:24:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-06 20:24:38,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-06 20:24:38,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-06 20:24:38,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078773251] [2024-05-06 20:24:38,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078773251] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-06 20:24:38,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-06 20:24:38,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-06 20:24:38,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785269735] [2024-05-06 20:24:38,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-06 20:24:38,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-06 20:24:38,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-06 20:24:38,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-06 20:24:38,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-06 20:24:38,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:24:38,786 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-06 20:24:38,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-06 20:24:38,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:24:38,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-06 20:24:38,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-06 20:24:38,786 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 20:24:38,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-06 20:24:38,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:24:40,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-06 20:24:40,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-06 20:24:40,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-06 20:24:40,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 20:24:40,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 20:24:40,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-06 20:24:40,161 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-05-06 20:24:40,161 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-05-06 20:24:40,161 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-05-06 20:24:40,161 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-05-06 20:24:40,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-06 20:24:40,165 INFO L448 BasicCegarLoop]: Path program histogram: [4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-06 20:24:40,168 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-06 20:24:40,168 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-06 20:24:40,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 08:24:40 BasicIcfg [2024-05-06 20:24:40,171 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-06 20:24:40,172 INFO L158 Benchmark]: Toolchain (without parser) took 10781.42ms. Allocated memory was 311.4MB in the beginning and 502.3MB in the end (delta: 190.8MB). Free memory was 240.2MB in the beginning and 250.4MB in the end (delta: -10.2MB). Peak memory consumption was 181.0MB. Max. memory is 8.0GB. [2024-05-06 20:24:40,172 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 311.4MB. Free memory is still 279.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-06 20:24:40,172 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.57ms. Allocated memory is still 311.4MB. Free memory was 239.9MB in the beginning and 219.4MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2024-05-06 20:24:40,172 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.97ms. Allocated memory is still 311.4MB. Free memory was 219.4MB in the beginning and 217.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-06 20:24:40,172 INFO L158 Benchmark]: Boogie Preprocessor took 40.05ms. Allocated memory is still 311.4MB. Free memory was 217.3MB in the beginning and 215.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-06 20:24:40,173 INFO L158 Benchmark]: RCFGBuilder took 415.07ms. Allocated memory is still 311.4MB. Free memory was 215.8MB in the beginning and 201.3MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-05-06 20:24:40,173 INFO L158 Benchmark]: TraceAbstraction took 9726.31ms. Allocated memory was 311.4MB in the beginning and 502.3MB in the end (delta: 190.8MB). Free memory was 278.6MB in the beginning and 250.4MB in the end (delta: 28.2MB). Peak memory consumption was 218.8MB. Max. memory is 8.0GB. [2024-05-06 20:24:40,174 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 311.4MB. Free memory is still 279.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 514.57ms. Allocated memory is still 311.4MB. Free memory was 239.9MB in the beginning and 219.4MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.97ms. Allocated memory is still 311.4MB. Free memory was 219.4MB in the beginning and 217.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.05ms. Allocated memory is still 311.4MB. Free memory was 217.3MB in the beginning and 215.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 415.07ms. Allocated memory is still 311.4MB. Free memory was 215.8MB in the beginning and 201.3MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 9726.31ms. Allocated memory was 311.4MB in the beginning and 502.3MB in the end (delta: 190.8MB). Free memory was 278.6MB in the beginning and 250.4MB in the end (delta: 28.2MB). Peak memory consumption was 218.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 164300, independent: 162193, independent conditional: 161996, independent unconditional: 197, dependent: 2107, dependent conditional: 2107, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 164165, independent: 162193, independent conditional: 161996, independent unconditional: 197, dependent: 1972, dependent conditional: 1972, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 164165, independent: 162193, independent conditional: 161996, independent unconditional: 197, dependent: 1972, dependent conditional: 1972, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 164165, independent: 162193, independent conditional: 161996, independent unconditional: 197, dependent: 1972, dependent conditional: 1972, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 169370, independent: 162193, independent conditional: 77469, independent unconditional: 84724, dependent: 7177, dependent conditional: 5205, dependent unconditional: 1972, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 169370, independent: 162193, independent conditional: 34026, independent unconditional: 128167, dependent: 7177, dependent conditional: 1591, dependent unconditional: 5586, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 169370, independent: 162193, independent conditional: 34026, independent unconditional: 128167, dependent: 7177, dependent conditional: 1591, dependent unconditional: 5586, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 998, independent: 973, independent conditional: 164, independent unconditional: 809, dependent: 25, dependent conditional: 13, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 998, independent: 956, independent conditional: 0, independent unconditional: 956, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 42, independent: 17, independent conditional: 13, independent unconditional: 4, dependent: 25, dependent conditional: 13, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 17, independent conditional: 13, independent unconditional: 4, dependent: 25, dependent conditional: 13, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 97, independent: 26, independent conditional: 23, independent unconditional: 3, dependent: 71, dependent conditional: 55, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 169370, independent: 161220, independent conditional: 33862, independent unconditional: 127358, dependent: 7152, dependent conditional: 1578, dependent unconditional: 5574, unknown: 998, unknown conditional: 177, unknown unconditional: 821] , Statistics on independence cache: Total cache size (in pairs): 998, Positive cache size: 973, Positive conditional cache size: 164, Positive unconditional cache size: 809, Negative cache size: 25, Negative conditional cache size: 13, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 47057, Maximal queried relation: 5, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 169370, independent: 162193, independent conditional: 77469, independent unconditional: 84724, dependent: 7177, dependent conditional: 5205, dependent unconditional: 1972, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 169370, independent: 162193, independent conditional: 34026, independent unconditional: 128167, dependent: 7177, dependent conditional: 1591, dependent unconditional: 5586, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 169370, independent: 162193, independent conditional: 34026, independent unconditional: 128167, dependent: 7177, dependent conditional: 1591, dependent unconditional: 5586, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 998, independent: 973, independent conditional: 164, independent unconditional: 809, dependent: 25, dependent conditional: 13, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 998, independent: 956, independent conditional: 0, independent unconditional: 956, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 42, independent: 17, independent conditional: 13, independent unconditional: 4, dependent: 25, dependent conditional: 13, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 17, independent conditional: 13, independent unconditional: 4, dependent: 25, dependent conditional: 13, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 97, independent: 26, independent conditional: 23, independent unconditional: 3, dependent: 71, dependent conditional: 55, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 169370, independent: 161220, independent conditional: 33862, independent unconditional: 127358, dependent: 7152, dependent conditional: 1578, dependent unconditional: 5574, unknown: 998, unknown conditional: 177, unknown unconditional: 821] , Statistics on independence cache: Total cache size (in pairs): 998, Positive cache size: 973, Positive conditional cache size: 164, Positive unconditional cache size: 809, Negative cache size: 25, Negative conditional cache size: 13, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 47057 ], Independence queries for same thread: 135 - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 115 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 7.9s, 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: 45, 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.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 399 NumberOfCodeBlocks, 399 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 393 ConstructedInterpolants, 0 QuantifiedInterpolants, 1079 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 4.5s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 63, ConditionalCommutativityTraceChecks: 28, ConditionalCommutativityImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-06 20:24:40,195 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-06 20:24:40,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...