/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 RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 213 --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/min-max-2.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-07 03:24:21,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-07 03:24:21,382 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-07 03:24:21,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-07 03:24:21,386 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-07 03:24:21,409 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-07 03:24:21,410 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-07 03:24:21,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-07 03:24:21,411 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-07 03:24:21,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-07 03:24:21,414 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-07 03:24:21,414 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-07 03:24:21,415 INFO L153 SettingsManager]: * Use SBE=true [2024-04-07 03:24:21,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-07 03:24:21,416 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-07 03:24:21,416 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-07 03:24:21,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-07 03:24:21,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-07 03:24:21,417 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-07 03:24:21,417 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-07 03:24:21,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-07 03:24:21,417 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-07 03:24:21,417 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-07 03:24:21,418 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-07 03:24:21,418 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-07 03:24:21,418 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-07 03:24:21,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-07 03:24:21,418 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-07 03:24:21,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-07 03:24:21,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-07 03:24:21,442 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-07 03:24:21,442 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-07 03:24:21,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-07 03:24:21,442 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-07 03:24:21,442 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-07 03:24:21,442 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-07 03:24:21,443 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-07 03:24:21,443 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-07 03:24:21,443 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-07 03:24:21,443 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 -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 213 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-04-07 03:24:21,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-07 03:24:21,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-07 03:24:21,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-07 03:24:21,735 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-04-07 03:24:21,738 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-04-07 03:24:21,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/min-max-2.wvr.bpl [2024-04-07 03:24:21,739 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/min-max-2.wvr.bpl' [2024-04-07 03:24:21,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-07 03:24:21,785 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-04-07 03:24:21,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-07 03:24:21,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-07 03:24:21,789 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-07 03:24:21,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 03:24:21" (1/1) ... [2024-04-07 03:24:21,818 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 03:24:21" (1/1) ... [2024-04-07 03:24:21,833 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-04-07 03:24:21,834 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-07 03:24:21,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-07 03:24:21,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-07 03:24:21,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-07 03:24:21,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 03:24:21" (1/1) ... [2024-04-07 03:24:21,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 03:24:21" (1/1) ... [2024-04-07 03:24:21,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 03:24:21" (1/1) ... [2024-04-07 03:24:21,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 03:24:21" (1/1) ... [2024-04-07 03:24:21,851 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 03:24:21" (1/1) ... [2024-04-07 03:24:21,853 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 03:24:21" (1/1) ... [2024-04-07 03:24:21,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 03:24:21" (1/1) ... [2024-04-07 03:24:21,856 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 03:24:21" (1/1) ... [2024-04-07 03:24:21,861 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-07 03:24:21,862 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-07 03:24:21,862 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-07 03:24:21,862 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-07 03:24:21,863 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 03:24:21" (1/1) ... [2024-04-07 03:24:21,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-07 03:24:21,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-07 03:24:21,930 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-04-07 03:24:21,935 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-04-07 03:24:21,971 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-04-07 03:24:21,972 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-07 03:24:21,972 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-07 03:24:21,972 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-04-07 03:24:21,972 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-07 03:24:21,972 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-07 03:24:21,972 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-04-07 03:24:21,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-07 03:24:21,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-07 03:24:21,973 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2024-04-07 03:24:21,973 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-04-07 03:24:21,973 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-04-07 03:24:21,973 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2024-04-07 03:24:21,973 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-04-07 03:24:21,974 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-04-07 03:24:21,974 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2024-04-07 03:24:21,974 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-04-07 03:24:21,974 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-04-07 03:24:21,975 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-07 03:24:22,027 INFO L241 CfgBuilder]: Building ICFG [2024-04-07 03:24:22,029 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-07 03:24:22,171 INFO L282 CfgBuilder]: Performing block encoding [2024-04-07 03:24:22,180 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-07 03:24:22,180 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-04-07 03:24:22,182 INFO L201 PluginConnector]: Adding new model min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 03:24:22 BoogieIcfgContainer [2024-04-07 03:24:22,182 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-07 03:24:22,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-07 03:24:22,185 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-07 03:24:22,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-07 03:24:22,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.04 03:24:21" (1/2) ... [2024-04-07 03:24:22,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a2dd1d2 and model type min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 03:24:22, skipping insertion in model container [2024-04-07 03:24:22,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 03:24:22" (2/2) ... [2024-04-07 03:24:22,190 INFO L112 eAbstractionObserver]: Analyzing ICFG min-max-2.wvr.bpl [2024-04-07 03:24:22,198 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-07 03:24:22,207 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-07 03:24:22,207 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-07 03:24:22,207 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-07 03:24:22,255 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-04-07 03:24:22,291 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-07 03:24:22,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-07 03:24:22,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-07 03:24:22,294 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-04-07 03:24:22,316 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-04-07 03:24:22,361 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-07 03:24:22,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-07 03:24:22,373 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-07 03:24:22,378 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;@4ff78c97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213 [2024-04-07 03:24:22,379 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-04-07 03:24:22,502 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-04-07 03:24:22,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-07 03:24:22,504 INFO L85 PathProgramCache]: Analyzing trace with hash -215255607, now seen corresponding path program 1 times [2024-04-07 03:24:22,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-07 03:24:22,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749474595] [2024-04-07 03:24:22,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:22,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 03:24:22,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 03:24:22,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-07 03:24:22,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749474595] [2024-04-07 03:24:22,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749474595] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-07 03:24:22,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-07 03:24:22,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-04-07 03:24:22,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645949836] [2024-04-07 03:24:22,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-07 03:24:22,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-07 03:24:22,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-07 03:24:22,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-07 03:24:22,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-04-07 03:24:22,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-07 03:24:22,738 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-07 03:24:22,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-04-07 03:24:22,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-07 03:24:23,773 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 03:24:23,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 52 [2024-04-07 03:24:23,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1754367502, now seen corresponding path program 1 times [2024-04-07 03:24:23,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:23,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 03:24:24,124 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-07 03:24:24,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:24,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 03:24:24,304 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-07 03:24:24,467 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 03:24:24,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2024-04-07 03:24:24,507 INFO L85 PathProgramCache]: Analyzing trace with hash 89119342, now seen corresponding path program 2 times [2024-04-07 03:24:24,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:24,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 03:24:24,737 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-04-07 03:24:24,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:24,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 03:24:24,956 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-04-07 03:24:25,585 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 03:24:25,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-04-07 03:24:25,622 INFO L85 PathProgramCache]: Analyzing trace with hash -898141138, now seen corresponding path program 1 times [2024-04-07 03:24:25,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:25,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:25,655 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 03:24:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:25,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-07 03:24:25,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable5,SelfDestructingSolverStorable0 [2024-04-07 03:24:25,811 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-04-07 03:24:25,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-07 03:24:25,811 INFO L85 PathProgramCache]: Analyzing trace with hash 647372837, now seen corresponding path program 1 times [2024-04-07 03:24:25,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-07 03:24:25,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273483657] [2024-04-07 03:24:25,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:25,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 03:24:25,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-07 03:24:25,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-07 03:24:25,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273483657] [2024-04-07 03:24:25,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273483657] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-07 03:24:25,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-07 03:24:25,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-07 03:24:25,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124677083] [2024-04-07 03:24:25,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-07 03:24:25,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-07 03:24:25,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-07 03:24:25,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-07 03:24:25,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-07 03:24:25,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-07 03:24:25,837 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-07 03:24:25,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-07 03:24:25,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-07 03:24:25,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-07 03:24:26,550 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 03:24:26,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2024-04-07 03:24:26,591 INFO L85 PathProgramCache]: Analyzing trace with hash -638962226, now seen corresponding path program 1 times [2024-04-07 03:24:26,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:26,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:26,597 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 03:24:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:27,276 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 03:24:27,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 52 [2024-04-07 03:24:27,336 INFO L85 PathProgramCache]: Analyzing trace with hash 883960303, now seen corresponding path program 1 times [2024-04-07 03:24:27,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:27,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 03:24:27,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 03:24:27,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:27,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 03:24:27,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 03:24:27,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-07 03:24:27,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 03:24:27,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable9 [2024-04-07 03:24:27,490 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-04-07 03:24:27,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-07 03:24:27,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1876334801, now seen corresponding path program 1 times [2024-04-07 03:24:27,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-07 03:24:27,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421002354] [2024-04-07 03:24:27,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:27,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 03:24:27,515 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-07 03:24:27,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-07 03:24:27,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421002354] [2024-04-07 03:24:27,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421002354] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-07 03:24:27,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-07 03:24:27,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-07 03:24:27,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071023806] [2024-04-07 03:24:27,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-07 03:24:27,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-07 03:24:27,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-07 03:24:27,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-07 03:24:27,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-04-07 03:24:27,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-07 03:24:27,517 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-07 03:24:27,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 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-04-07 03:24:27,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-07 03:24:27,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 03:24:27,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-07 03:24:27,903 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 03:24:27,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-04-07 03:24:27,939 INFO L85 PathProgramCache]: Analyzing trace with hash -838678039, now seen corresponding path program 3 times [2024-04-07 03:24:27,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:27,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:27,958 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 03:24:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:28,082 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 03:24:28,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2024-04-07 03:24:28,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1349900014, now seen corresponding path program 4 times [2024-04-07 03:24:28,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:28,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:28,174 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 03:24:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:28,758 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 03:24:28,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 38 [2024-04-07 03:24:30,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1444693203, now seen corresponding path program 2 times [2024-04-07 03:24:30,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:30,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:30,842 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 03:24:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:31,062 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 03:24:31,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2024-04-07 03:24:31,115 INFO L85 PathProgramCache]: Analyzing trace with hash -504139607, now seen corresponding path program 1 times [2024-04-07 03:24:31,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:31,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:31,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 03:24:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:31,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-07 03:24:31,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 03:24:31,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 03:24:31,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14 [2024-04-07 03:24:31,186 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-04-07 03:24:31,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-07 03:24:31,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1762182334, now seen corresponding path program 1 times [2024-04-07 03:24:31,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-07 03:24:31,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238054668] [2024-04-07 03:24:31,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:31,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 03:24:31,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 03:24:31,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-07 03:24:31,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238054668] [2024-04-07 03:24:31,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238054668] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-07 03:24:31,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-07 03:24:31,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-07 03:24:31,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291673837] [2024-04-07 03:24:31,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-07 03:24:31,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-07 03:24:31,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-07 03:24:31,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-07 03:24:31,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-04-07 03:24:31,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-07 03:24:31,251 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-07 03:24:31,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 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-04-07 03:24:31,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-07 03:24:31,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 03:24:31,251 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 03:24:31,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-07 03:24:31,577 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 03:24:31,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 52 [2024-04-07 03:24:31,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1219730405, now seen corresponding path program 5 times [2024-04-07 03:24:31,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:31,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:31,746 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 03:24:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:32,312 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 03:24:32,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2024-04-07 03:24:32,378 INFO L85 PathProgramCache]: Analyzing trace with hash 334886958, now seen corresponding path program 3 times [2024-04-07 03:24:32,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:32,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:32,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 03:24:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:32,619 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 03:24:32,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-04-07 03:24:32,704 INFO L85 PathProgramCache]: Analyzing trace with hash 385409083, now seen corresponding path program 1 times [2024-04-07 03:24:32,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:32,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:32,708 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 03:24:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:32,821 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 03:24:32,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 52 [2024-04-07 03:24:32,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1277357186, now seen corresponding path program 1 times [2024-04-07 03:24:32,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:32,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 03:24:32,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 03:24:32,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:32,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 03:24:32,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 03:24:32,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-07 03:24:32,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-04-07 03:24:33,331 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 03:24:33,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-04-07 03:24:33,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1347489295, now seen corresponding path program 6 times [2024-04-07 03:24:33,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:33,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:33,404 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 03:24:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:34,762 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 03:24:34,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2024-04-07 03:24:34,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1239458033, now seen corresponding path program 4 times [2024-04-07 03:24:34,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:34,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:34,931 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 03:24:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:35,209 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 03:24:35,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 38 [2024-04-07 03:24:35,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-07 03:24:35,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 03:24:35,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 03:24:35,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 03:24:35,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-04-07 03:24:35,540 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-04-07 03:24:35,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-07 03:24:35,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1050181042, now seen corresponding path program 1 times [2024-04-07 03:24:35,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-07 03:24:35,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754120336] [2024-04-07 03:24:35,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:35,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 03:24:35,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 03:24:35,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-07 03:24:35,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754120336] [2024-04-07 03:24:35,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754120336] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-07 03:24:35,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-07 03:24:35,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-07 03:24:35,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821620128] [2024-04-07 03:24:35,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-07 03:24:35,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-07 03:24:35,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-07 03:24:35,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-07 03:24:35,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-04-07 03:24:35,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-07 03:24:35,571 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-07 03:24:35,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 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-04-07 03:24:35,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-07 03:24:35,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 03:24:35,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 03:24:35,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 03:24:35,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-07 03:24:35,927 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 03:24:35,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-04-07 03:24:38,031 INFO L85 PathProgramCache]: Analyzing trace with hash 944792767, now seen corresponding path program 7 times [2024-04-07 03:24:38,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:38,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:38,054 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 03:24:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:38,519 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 03:24:38,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 52 [2024-04-07 03:24:38,738 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 03:24:38,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 38 [2024-04-07 03:24:38,970 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 03:24:38,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-04-07 03:24:39,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-04-07 03:24:39,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1392455610, now seen corresponding path program 1 times [2024-04-07 03:24:39,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:39,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:39,200 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 03:24:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:40,252 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 03:24:40,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-04-07 03:24:42,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1494683343, now seen corresponding path program 5 times [2024-04-07 03:24:42,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:42,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:42,361 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 03:24:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:42,510 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 03:24:42,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-04-07 03:24:42,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1710783579, now seen corresponding path program 6 times [2024-04-07 03:24:42,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:42,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:42,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 03:24:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:42,769 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 03:24:42,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2024-04-07 03:24:42,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1535710054, now seen corresponding path program 7 times [2024-04-07 03:24:42,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:42,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 03:24:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-04-07 03:24:42,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:42,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 03:24:43,048 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-04-07 03:24:43,293 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 03:24:43,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-04-07 03:24:43,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1597651287, now seen corresponding path program 1 times [2024-04-07 03:24:43,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:43,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 03:24:43,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 03:24:43,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:43,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 03:24:43,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 03:24:43,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-04-07 03:24:43,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1011024531, now seen corresponding path program 2 times [2024-04-07 03:24:43,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:43,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:43,686 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-07 03:24:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-07 03:24:43,848 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 03:24:43,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2024-04-07 03:24:43,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1527870500, now seen corresponding path program 2 times [2024-04-07 03:24:43,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:43,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 03:24:43,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 03:24:43,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:43,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 03:24:43,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 03:24:44,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-07 03:24:44,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 03:24:44,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 03:24:44,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 03:24:44,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-07 03:24:44,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable23,SelfDestructingSolverStorable34,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-04-07 03:24:44,142 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-04-07 03:24:44,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-07 03:24:44,142 INFO L85 PathProgramCache]: Analyzing trace with hash 564146173, now seen corresponding path program 1 times [2024-04-07 03:24:44,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-07 03:24:44,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660416787] [2024-04-07 03:24:44,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:44,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 03:24:44,252 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 03:24:44,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-07 03:24:44,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660416787] [2024-04-07 03:24:44,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660416787] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-07 03:24:44,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410894382] [2024-04-07 03:24:44,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:44,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-07 03:24:44,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-07 03:24:44,255 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-07 03:24:44,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-04-07 03:24:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 03:24:44,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2024-04-07 03:24:44,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-07 03:24:44,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-04-07 03:24:44,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 03:24:44,509 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-07 03:24:44,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-07 03:24:44,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410894382] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-07 03:24:44,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-07 03:24:44,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-04-07 03:24:44,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089611301] [2024-04-07 03:24:44,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-07 03:24:44,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-04-07 03:24:44,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-07 03:24:44,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-04-07 03:24:44,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-04-07 03:24:44,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-07 03:24:44,652 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-07 03:24:44,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.0) internal successors, (75), 15 states have internal predecessors, (75), 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-04-07 03:24:44,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-07 03:24:44,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 03:24:44,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 03:24:44,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 03:24:44,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-07 03:24:44,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-07 03:24:45,637 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 03:24:45,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2024-04-07 03:24:48,594 INFO L85 PathProgramCache]: Analyzing trace with hash -203794603, now seen corresponding path program 8 times [2024-04-07 03:24:48,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:48,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 03:24:48,726 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-04-07 03:24:48,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-07 03:24:48,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-07 03:24:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-07 03:24:48,815 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-04-07 03:24:48,946 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-07 03:24:48,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2024-04-07 03:24:55,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-04-07 03:24:55,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37 [2024-04-07 03:24:55,922 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@a912016 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:156) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.checkInternal(MonolithicHoareTripleChecker.java:83) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:196) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:169) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:173) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.visitors.DeadEndOptimizingSearchVisitor.discoverState(DeadEndOptimizingSearchVisitor.java:73) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:222) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:329) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-04-07 03:24:55,928 INFO L158 Benchmark]: Toolchain (without parser) took 34142.91ms. Allocated memory was 361.8MB in the beginning and 1.7GB in the end (delta: 1.3GB). Free memory was 333.2MB in the beginning and 1.4GB in the end (delta: -1.0GB). Peak memory consumption was 862.9MB. Max. memory is 8.0GB. [2024-04-07 03:24:55,929 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 361.8MB. Free memory is still 327.9MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-07 03:24:55,938 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.29ms. Allocated memory is still 361.8MB. Free memory was 333.2MB in the beginning and 332.4MB in the end (delta: 775.9kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-07 03:24:55,939 INFO L158 Benchmark]: Boogie Preprocessor took 25.41ms. Allocated memory is still 361.8MB. Free memory was 332.4MB in the beginning and 331.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-07 03:24:55,939 INFO L158 Benchmark]: RCFGBuilder took 320.31ms. Allocated memory is still 361.8MB. Free memory was 331.1MB in the beginning and 320.1MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-04-07 03:24:55,940 INFO L158 Benchmark]: TraceAbstraction took 33742.99ms. Allocated memory was 361.8MB in the beginning and 1.7GB in the end (delta: 1.3GB). Free memory was 319.0MB in the beginning and 1.4GB in the end (delta: -1.1GB). Peak memory consumption was 850.3MB. Max. memory is 8.0GB. [2024-04-07 03:24:55,947 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.11ms. Allocated memory is still 361.8MB. Free memory is still 327.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.29ms. Allocated memory is still 361.8MB. Free memory was 333.2MB in the beginning and 332.4MB in the end (delta: 775.9kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.41ms. Allocated memory is still 361.8MB. Free memory was 332.4MB in the beginning and 331.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 320.31ms. Allocated memory is still 361.8MB. Free memory was 331.1MB in the beginning and 320.1MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 33742.99ms. Allocated memory was 361.8MB in the beginning and 1.7GB in the end (delta: 1.3GB). Free memory was 319.0MB in the beginning and 1.4GB in the end (delta: -1.1GB). Peak memory consumption was 850.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@a912016 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@a912016: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-04-07 03:24:55,975 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-04-07 03:24:56,206 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...