/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 BOTH --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --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-06 17:54:04,753 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-06 17:54:04,786 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-06 17:54:04,789 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-06 17:54:04,789 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-06 17:54:04,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-06 17:54:04,810 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-06 17:54:04,810 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-06 17:54:04,810 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-06 17:54:04,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-06 17:54:04,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-06 17:54:04,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-06 17:54:04,811 INFO L153 SettingsManager]: * Use SBE=true [2024-04-06 17:54:04,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-06 17:54:04,812 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-06 17:54:04,812 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-06 17:54:04,812 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-06 17:54:04,813 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-06 17:54:04,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-06 17:54:04,813 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-06 17:54:04,813 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-06 17:54:04,814 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-06 17:54:04,814 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-06 17:54:04,814 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-06 17:54:04,814 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-06 17:54:04,814 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-06 17:54:04,815 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-06 17:54:04,815 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-06 17:54:04,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-06 17:54:04,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-06 17:54:04,815 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-06 17:54:04,816 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-06 17:54:04,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-06 17:54:04,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-06 17:54:04,816 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-06 17:54:04,816 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-06 17:54:04,817 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-06 17:54:04,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-06 17:54:04,817 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-06 17:54:04,817 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 -> BOTH Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT 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-06 17:54:05,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-06 17:54:05,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-06 17:54:05,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-06 17:54:05,081 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-04-06 17:54:05,082 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-04-06 17:54:05,083 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-06 17:54:05,083 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-06 17:54:05,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-06 17:54:05,141 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-04-06 17:54:05,143 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-06 17:54:05,143 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-06 17:54:05,143 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-06 17:54:05,155 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 06.04 05:54:05" (1/1) ... [2024-04-06 17:54:05,164 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 06.04 05:54:05" (1/1) ... [2024-04-06 17:54:05,171 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-04-06 17:54:05,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-06 17:54:05,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-06 17:54:05,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-06 17:54:05,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-06 17:54:05,179 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 06.04 05:54:05" (1/1) ... [2024-04-06 17:54:05,180 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 06.04 05:54:05" (1/1) ... [2024-04-06 17:54:05,197 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 06.04 05:54:05" (1/1) ... [2024-04-06 17:54:05,198 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 06.04 05:54:05" (1/1) ... [2024-04-06 17:54:05,204 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 06.04 05:54:05" (1/1) ... [2024-04-06 17:54:05,206 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 06.04 05:54:05" (1/1) ... [2024-04-06 17:54:05,206 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 06.04 05:54:05" (1/1) ... [2024-04-06 17:54:05,207 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 06.04 05:54:05" (1/1) ... [2024-04-06 17:54:05,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-06 17:54:05,208 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-06 17:54:05,208 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-06 17:54:05,208 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-06 17:54:05,212 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 05:54:05" (1/1) ... [2024-04-06 17:54:05,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-06 17:54:05,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 17:54:05,251 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-06 17:54:05,281 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-06 17:54:05,323 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-04-06 17:54:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-06 17:54:05,324 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-06 17:54:05,324 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-04-06 17:54:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-06 17:54:05,325 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-06 17:54:05,325 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-04-06 17:54:05,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-06 17:54:05,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-06 17:54:05,325 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2024-04-06 17:54:05,325 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-04-06 17:54:05,325 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-04-06 17:54:05,326 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2024-04-06 17:54:05,326 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-04-06 17:54:05,326 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-04-06 17:54:05,326 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2024-04-06 17:54:05,326 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-04-06 17:54:05,327 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-04-06 17:54:05,330 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-06 17:54:05,370 INFO L241 CfgBuilder]: Building ICFG [2024-04-06 17:54:05,372 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-06 17:54:05,525 INFO L282 CfgBuilder]: Performing block encoding [2024-04-06 17:54:05,533 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-06 17:54:05,533 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-04-06 17:54:05,534 INFO L201 PluginConnector]: Adding new model min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 05:54:05 BoogieIcfgContainer [2024-04-06 17:54:05,534 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-06 17:54:05,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-06 17:54:05,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-06 17:54:05,542 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-06 17:54:05,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 06.04 05:54:05" (1/2) ... [2024-04-06 17:54:05,543 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bec7d97 and model type min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 05:54:05, skipping insertion in model container [2024-04-06 17:54:05,544 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 06.04 05:54:05" (2/2) ... [2024-04-06 17:54:05,545 INFO L112 eAbstractionObserver]: Analyzing ICFG min-max-2.wvr.bpl [2024-04-06 17:54:05,560 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-06 17:54:05,568 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-06 17:54:05,568 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-06 17:54:05,568 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-06 17:54:05,639 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-04-06 17:54:05,676 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-06 17:54:05,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-06 17:54:05,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 17:54:05,679 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-06 17:54:05,705 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-06 17:54:05,744 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-06 17:54:05,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 17:54:05,755 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-06 17:54:05,764 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;@1bc74404, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123 [2024-04-06 17:54:05,765 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-04-06 17:54:05,888 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-06 17:54:05,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 17:54:05,889 INFO L85 PathProgramCache]: Analyzing trace with hash -215255607, now seen corresponding path program 1 times [2024-04-06 17:54:05,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 17:54:05,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679804335] [2024-04-06 17:54:05,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:05,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 17:54:06,076 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-06 17:54:06,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 17:54:06,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679804335] [2024-04-06 17:54:06,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679804335] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 17:54:06,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 17:54:06,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-04-06 17:54:06,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850234499] [2024-04-06 17:54:06,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 17:54:06,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-06 17:54:06,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 17:54:06,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-06 17:54:06,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-04-06 17:54:06,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 17:54:06,153 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 17:54:06,154 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-06 17:54:06,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 17:54:07,118 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 17:54:07,119 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-06 17:54:07,161 INFO L85 PathProgramCache]: Analyzing trace with hash -88519838, now seen corresponding path program 1 times [2024-04-06 17:54:07,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:07,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:07,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 17:54:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:07,345 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 17:54:07,345 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-06 17:54:07,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1754367502, now seen corresponding path program 2 times [2024-04-06 17:54:07,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:07,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 17:54:07,550 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-06 17:54:07,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:07,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 17:54:07,643 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-06 17:54:07,764 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 17:54:07,764 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-06 17:54:07,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1349900014, now seen corresponding path program 3 times [2024-04-06 17:54:07,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:07,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 17:54:08,007 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-06 17:54:08,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:08,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 17:54:08,147 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-04-06 17:54:08,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 17:54:08,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable5,SelfDestructingSolverStorable0 [2024-04-06 17:54:08,700 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-06 17:54:08,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 17:54:08,700 INFO L85 PathProgramCache]: Analyzing trace with hash 647372837, now seen corresponding path program 1 times [2024-04-06 17:54:08,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 17:54:08,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625443885] [2024-04-06 17:54:08,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:08,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 17:54:08,721 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-06 17:54:08,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 17:54:08,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625443885] [2024-04-06 17:54:08,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625443885] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 17:54:08,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 17:54:08,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-06 17:54:08,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677581700] [2024-04-06 17:54:08,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 17:54:08,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-06 17:54:08,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 17:54:08,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-06 17:54:08,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-06 17:54:08,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 17:54:08,730 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 17:54:08,730 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-06 17:54:08,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 17:54:08,730 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 17:54:09,197 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 17:54:09,198 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-06 17:54:09,246 INFO L85 PathProgramCache]: Analyzing trace with hash 177739434, now seen corresponding path program 1 times [2024-04-06 17:54:09,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:09,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 17:54:09,274 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-06 17:54:09,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:09,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 17:54:09,292 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-06 17:54:09,408 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 17:54:09,408 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-06 17:54:09,444 INFO L85 PathProgramCache]: Analyzing trace with hash -638962226, now seen corresponding path program 1 times [2024-04-06 17:54:09,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:09,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:09,450 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 17:54:09,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:10,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 17:54:10,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 17:54:10,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable9 [2024-04-06 17:54:10,026 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-06 17:54:10,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 17:54:10,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1876334801, now seen corresponding path program 1 times [2024-04-06 17:54:10,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 17:54:10,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024250027] [2024-04-06 17:54:10,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:10,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 17:54:10,055 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-06 17:54:10,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 17:54:10,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024250027] [2024-04-06 17:54:10,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024250027] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 17:54:10,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 17:54:10,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-06 17:54:10,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065869482] [2024-04-06 17:54:10,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 17:54:10,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-06 17:54:10,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 17:54:10,233 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 7 treesize of output 5 [2024-04-06 17:54:10,266 INFO L85 PathProgramCache]: Analyzing trace with hash -2133675398, now seen corresponding path program 1 times [2024-04-06 17:54:10,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:10,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:10,269 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 17:54:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:10,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-06 17:54:10,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-04-06 17:54:10,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 17:54:10,337 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 17:54:10,337 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-06 17:54:10,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 17:54:10,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 17:54:10,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 17:54:10,695 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 17:54:10,695 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-06 17:54:12,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1754367502, now seen corresponding path program 4 times [2024-04-06 17:54:12,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:12,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:12,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 17:54:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:12,864 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 17:54:12,864 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-06 17:54:14,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1135432791, now seen corresponding path program 5 times [2024-04-06 17:54:14,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:14,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:14,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 17:54:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:15,093 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 17:54:15,093 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-06 17:54:15,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1349900014, now seen corresponding path program 6 times [2024-04-06 17:54:15,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:15,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:15,184 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 17:54:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:15,350 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 17:54:15,350 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-06 17:54:15,408 INFO L85 PathProgramCache]: Analyzing trace with hash 177739434, now seen corresponding path program 2 times [2024-04-06 17:54:15,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:15,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 17:54:15,426 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-06 17:54:15,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:15,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 17:54:15,443 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-06 17:54:15,529 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 17:54:15,529 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-06 17:54:15,608 INFO L85 PathProgramCache]: Analyzing trace with hash -638962226, now seen corresponding path program 2 times [2024-04-06 17:54:15,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:15,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:15,615 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 17:54:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:16,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 17:54:16,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 17:54:16,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 17:54:16,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-04-06 17:54:16,152 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-06 17:54:16,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 17:54:16,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1762182334, now seen corresponding path program 1 times [2024-04-06 17:54:16,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 17:54:16,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955458972] [2024-04-06 17:54:16,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:16,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 17:54:16,177 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-06 17:54:16,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 17:54:16,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955458972] [2024-04-06 17:54:16,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955458972] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 17:54:16,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 17:54:16,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-06 17:54:16,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110258858] [2024-04-06 17:54:16,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 17:54:16,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-06 17:54:16,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 17:54:16,346 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 7 treesize of output 5 [2024-04-06 17:54:16,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1192299311, now seen corresponding path program 1 times [2024-04-06 17:54:16,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:16,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:16,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 17:54:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:16,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-06 17:54:16,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-04-06 17:54:16,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 17:54:16,381 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 17:54:16,381 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-06 17:54:16,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 17:54:16,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 17:54:16,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 17:54:16,381 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 17:54:16,719 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 17:54:16,719 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-06 17:54:18,774 INFO L85 PathProgramCache]: Analyzing trace with hash 843063091, now seen corresponding path program 7 times [2024-04-06 17:54:18,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:18,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:18,797 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 17:54:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:18,901 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 17:54:18,902 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-06 17:54:18,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1799323947, now seen corresponding path program 8 times [2024-04-06 17:54:18,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:18,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:19,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 17:54:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:19,181 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 17:54:19,182 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-06 17:54:19,237 INFO L85 PathProgramCache]: Analyzing trace with hash 948455977, now seen corresponding path program 9 times [2024-04-06 17:54:19,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:19,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:19,285 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 17:54:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:19,451 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 17:54:19,451 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-06 17:54:19,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1347489295, now seen corresponding path program 10 times [2024-04-06 17:54:19,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:19,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:19,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 17:54:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:19,701 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 17:54:19,701 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-06 17:54:19,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1069066912, now seen corresponding path program 1 times [2024-04-06 17:54:19,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:19,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:19,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 17:54:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:19,869 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 17:54:19,869 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-06 17:54:19,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1392823293, now seen corresponding path program 1 times [2024-04-06 17:54:19,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:19,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 17:54:19,970 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-06 17:54:19,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:19,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 17:54:19,985 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-06 17:54:19,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-06 17:54:19,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-04-06 17:54:20,562 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 17:54:20,563 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-06 17:54:20,633 INFO L85 PathProgramCache]: Analyzing trace with hash -353261903, now seen corresponding path program 1 times [2024-04-06 17:54:20,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:20,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:20,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 17:54:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:20,729 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 17:54:20,729 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-06 17:54:21,177 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 17:54:21,178 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-06 17:54:21,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1218664042, now seen corresponding path program 1 times [2024-04-06 17:54:21,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:21,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:21,235 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 17:54:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:21,336 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 17:54:21,336 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-06 17:54:21,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1069066912, now seen corresponding path program 2 times [2024-04-06 17:54:21,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:21,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:21,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 17:54:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:21,641 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 17:54:21,642 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-06 17:54:21,753 INFO L85 PathProgramCache]: Analyzing trace with hash 421223438, now seen corresponding path program 1 times [2024-04-06 17:54:21,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:21,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 17:54:21,806 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-06 17:54:21,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:21,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 17:54:21,832 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-06 17:54:21,939 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 17:54:21,939 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-06 17:54:22,077 INFO L85 PathProgramCache]: Analyzing trace with hash 876201912, now seen corresponding path program 3 times [2024-04-06 17:54:22,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:22,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:22,081 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 17:54:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:22,163 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 17:54:22,163 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-06 17:54:22,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1392455610, now seen corresponding path program 2 times [2024-04-06 17:54:22,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:22,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:22,239 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 17:54:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:22,485 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 17:54:22,486 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-06 17:54:22,658 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 17:54:22,658 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-06 17:54:22,737 INFO L85 PathProgramCache]: Analyzing trace with hash -638962226, now seen corresponding path program 3 times [2024-04-06 17:54:22,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:22,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:22,742 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 17:54:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:22,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-06 17:54:22,831 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-04-06 17:54:23,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 17:54:23,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 17:54:23,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 17:54:23,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 17:54:23,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable20,SelfDestructingSolverStorable31,SelfDestructingSolverStorable18,SelfDestructingSolverStorable29,SelfDestructingSolverStorable19,SelfDestructingSolverStorable21,SelfDestructingSolverStorable32,SelfDestructingSolverStorable22,SelfDestructingSolverStorable33,SelfDestructingSolverStorable23,SelfDestructingSolverStorable34,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-04-06 17:54:23,633 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-06 17:54:23,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 17:54:23,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1050181042, now seen corresponding path program 1 times [2024-04-06 17:54:23,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 17:54:23,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342710234] [2024-04-06 17:54:23,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:23,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 17:54:23,659 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-06 17:54:23,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 17:54:23,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342710234] [2024-04-06 17:54:23,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342710234] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 17:54:23,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 17:54:23,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-06 17:54:23,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93055573] [2024-04-06 17:54:23,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 17:54:23,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-06 17:54:23,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 17:54:23,840 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 13 treesize of output 9 [2024-04-06 17:54:23,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1192299311, now seen corresponding path program 2 times [2024-04-06 17:54:23,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:23,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:23,890 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 17:54:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 17:54:23,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-06 17:54:23,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-04-06 17:54:23,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 17:54:23,911 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 17:54:23,911 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-06 17:54:23,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 17:54:23,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 17:54:23,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 17:54:23,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 17:54:23,911 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 17:54:24,397 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 17:54:24,397 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-06 17:54:24,471 INFO L85 PathProgramCache]: Analyzing trace with hash 2109097061, now seen corresponding path program 11 times [2024-04-06 17:54:24,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:24,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 17:54:24,650 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-04-06 17:54:24,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:24,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 17:54:24,765 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-04-06 17:54:24,953 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 17:54:24,954 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-06 17:54:27,045 INFO L85 PathProgramCache]: Analyzing trace with hash -353261903, now seen corresponding path program 2 times [2024-04-06 17:54:27,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:27,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 17:54:27,085 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-06 17:54:27,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:27,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 17:54:27,109 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-06 17:54:27,374 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 17:54:27,375 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-06 17:54:28,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 17:54:28,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 17:54:28,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 17:54:28,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 17:54:28,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 17:54:28,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39 [2024-04-06 17:54:28,426 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-06 17:54:28,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 17:54:28,426 INFO L85 PathProgramCache]: Analyzing trace with hash 564146173, now seen corresponding path program 1 times [2024-04-06 17:54:28,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 17:54:28,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822127914] [2024-04-06 17:54:28,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:28,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 17:54:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 17:54:28,546 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-06 17:54:28,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 17:54:28,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822127914] [2024-04-06 17:54:28,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822127914] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 17:54:28,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698388407] [2024-04-06 17:54:28,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 17:54:28,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 17:54:28,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 17:54:28,561 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-06 17:54:28,561 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-06 17:54:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 17:54:28,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2024-04-06 17:54:28,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 17:54:28,758 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-06 17:54:28,785 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-06 17:54:28,785 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 17:54:29,009 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-06 17:54:29,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698388407] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-06 17:54:29,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-06 17:54:29,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-04-06 17:54:29,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054100187] [2024-04-06 17:54:29,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-06 17:54:29,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-04-06 17:54:29,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 17:54:29,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-04-06 17:54:29,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-04-06 17:54:29,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 17:54:29,021 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 17:54:29,021 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-06 17:54:29,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 17:54:29,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 17:54:29,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 17:54:29,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 17:54:29,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 17:54:29,021 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 17:54:33,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-04-06 17:54:34,102 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,SelfDestructingSolverStorable41 [2024-04-06 17:54:34,103 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@798c36f1 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-06 17:54:34,106 INFO L158 Benchmark]: Toolchain (without parser) took 28964.72ms. Allocated memory was 282.1MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 257.4MB in the beginning and 806.9MB in the end (delta: -549.6MB). Peak memory consumption was 765.5MB. Max. memory is 8.0GB. [2024-04-06 17:54:34,106 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 282.1MB. Free memory is still 251.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-06 17:54:34,107 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.44ms. Allocated memory is still 282.1MB. Free memory was 257.3MB in the beginning and 255.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-06 17:54:34,107 INFO L158 Benchmark]: Boogie Preprocessor took 34.32ms. Allocated memory is still 282.1MB. Free memory was 255.7MB in the beginning and 254.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-06 17:54:34,107 INFO L158 Benchmark]: RCFGBuilder took 325.79ms. Allocated memory is still 282.1MB. Free memory was 254.5MB in the beginning and 243.1MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-04-06 17:54:34,107 INFO L158 Benchmark]: TraceAbstraction took 28570.02ms. Allocated memory was 282.1MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 241.8MB in the beginning and 806.9MB in the end (delta: -565.2MB). Peak memory consumption was 750.8MB. Max. memory is 8.0GB. [2024-04-06 17:54:34,108 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.10ms. Allocated memory is still 282.1MB. Free memory is still 251.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.44ms. Allocated memory is still 282.1MB. Free memory was 257.3MB in the beginning and 255.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.32ms. Allocated memory is still 282.1MB. Free memory was 255.7MB in the beginning and 254.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 325.79ms. Allocated memory is still 282.1MB. Free memory was 254.5MB in the beginning and 243.1MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 28570.02ms. Allocated memory was 282.1MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 241.8MB in the beginning and 806.9MB in the end (delta: -565.2MB). Peak memory consumption was 750.8MB. 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@798c36f1 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@798c36f1: 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-06 17:54:34,125 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-06 17:54:34,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...