/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 546 -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 23:21:46,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-06 23:21:46,184 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-06 23:21:46,187 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-06 23:21:46,187 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-06 23:21:46,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-06 23:21:46,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-06 23:21:46,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-06 23:21:46,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-06 23:21:46,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-06 23:21:46,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-06 23:21:46,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-06 23:21:46,209 INFO L153 SettingsManager]: * Use SBE=true [2024-04-06 23:21:46,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-06 23:21:46,209 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-06 23:21:46,209 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-06 23:21:46,209 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-06 23:21:46,210 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-06 23:21:46,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-06 23:21:46,210 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-06 23:21:46,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-06 23:21:46,211 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-06 23:21:46,211 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-06 23:21:46,211 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-06 23:21:46,211 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-06 23:21:46,211 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-06 23:21:46,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-06 23:21:46,212 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-06 23:21:46,212 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-06 23:21:46,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-06 23:21:46,212 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-06 23:21:46,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-06 23:21:46,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-06 23:21:46,213 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-06 23:21:46,213 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-06 23:21:46,213 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-06 23:21:46,213 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-06 23:21:46,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-06 23:21:46,214 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-06 23:21:46,214 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 546 [2024-04-06 23:21:46,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-06 23:21:46,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-06 23:21:46,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-06 23:21:46,466 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-04-06 23:21:46,468 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-04-06 23:21:46,469 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 23:21:46,469 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 23:21:46,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-06 23:21:46,498 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-04-06 23:21:46,499 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-06 23:21:46,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-06 23:21:46,499 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-06 23:21:46,511 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 11:21:46" (1/1) ... [2024-04-06 23:21:46,516 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 11:21:46" (1/1) ... [2024-04-06 23:21:46,520 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-04-06 23:21:46,521 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-06 23:21:46,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-06 23:21:46,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-06 23:21:46,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-06 23:21:46,528 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 11:21:46" (1/1) ... [2024-04-06 23:21:46,528 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 11:21:46" (1/1) ... [2024-04-06 23:21:46,529 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 11:21:46" (1/1) ... [2024-04-06 23:21:46,529 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 11:21:46" (1/1) ... [2024-04-06 23:21:46,531 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 11:21:46" (1/1) ... [2024-04-06 23:21:46,533 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 11:21:46" (1/1) ... [2024-04-06 23:21:46,538 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 11:21:46" (1/1) ... [2024-04-06 23:21:46,538 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 11:21:46" (1/1) ... [2024-04-06 23:21:46,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-06 23:21:46,540 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-06 23:21:46,540 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-06 23:21:46,540 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-06 23:21:46,541 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 11:21:46" (1/1) ... [2024-04-06 23:21:46,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-06 23:21:46,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 23:21:46,586 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 23:21:46,604 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 23:21:46,623 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-04-06 23:21:46,623 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-06 23:21:46,623 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-06 23:21:46,624 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-04-06 23:21:46,624 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-06 23:21:46,624 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-06 23:21:46,624 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-04-06 23:21:46,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-06 23:21:46,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-06 23:21:46,624 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2024-04-06 23:21:46,624 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-04-06 23:21:46,624 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-04-06 23:21:46,625 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2024-04-06 23:21:46,625 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-04-06 23:21:46,625 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-04-06 23:21:46,625 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2024-04-06 23:21:46,625 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-04-06 23:21:46,625 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-04-06 23:21:46,626 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 23:21:46,664 INFO L241 CfgBuilder]: Building ICFG [2024-04-06 23:21:46,667 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-06 23:21:46,776 INFO L282 CfgBuilder]: Performing block encoding [2024-04-06 23:21:46,790 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-06 23:21:46,790 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-04-06 23:21:46,791 INFO L201 PluginConnector]: Adding new model min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 11:21:46 BoogieIcfgContainer [2024-04-06 23:21:46,791 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-06 23:21:46,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-06 23:21:46,792 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-06 23:21:46,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-06 23:21:46,797 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 11:21:46" (1/2) ... [2024-04-06 23:21:46,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75493024 and model type min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 11:21:46, skipping insertion in model container [2024-04-06 23:21:46,797 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 11:21:46" (2/2) ... [2024-04-06 23:21:46,798 INFO L112 eAbstractionObserver]: Analyzing ICFG min-max-2.wvr.bpl [2024-04-06 23:21:46,804 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-06 23:21:46,810 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-06 23:21:46,811 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-06 23:21:46,811 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-06 23:21:46,855 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-04-06 23:21:46,886 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-06 23:21:46,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-06 23:21:46,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 23:21:46,888 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 23:21:46,889 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 23:21:46,918 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-06 23:21:46,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 23:21:46,928 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-06 23:21:46,933 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;@4087dc2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=546 [2024-04-06 23:21:46,933 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-04-06 23:21:47,007 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 23:21:47,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 23:21:47,011 INFO L85 PathProgramCache]: Analyzing trace with hash -215255607, now seen corresponding path program 1 times [2024-04-06 23:21:47,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 23:21:47,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204142226] [2024-04-06 23:21:47,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:21:47,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:21:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:21:47,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 23:21:47,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 23:21:47,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204142226] [2024-04-06 23:21:47,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204142226] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 23:21:47,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 23:21:47,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-04-06 23:21:47,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863788164] [2024-04-06 23:21:47,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 23:21:47,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-06 23:21:47,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 23:21:47,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-06 23:21:47,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-04-06 23:21:47,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 23:21:47,235 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 23:21:47,236 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 23:21:47,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 23:21:48,679 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:21:48,679 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 23:21:50,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1652800034, now seen corresponding path program 1 times [2024-04-06 23:21:50,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:21:50,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:21:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:21:51,152 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-04-06 23:21:51,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:21:51,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:21:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:21:51,344 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-04-06 23:21:51,449 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:21:51,450 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 23:21:53,024 INFO L85 PathProgramCache]: Analyzing trace with hash -302806396, now seen corresponding path program 2 times [2024-04-06 23:21:53,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:21:53,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:21:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:21:53,166 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-04-06 23:21:53,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:21:53,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:21:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:21:53,279 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-04-06 23:21:53,413 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:21:53,414 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 23:21:53,448 INFO L85 PathProgramCache]: Analyzing trace with hash -636144160, now seen corresponding path program 3 times [2024-04-06 23:21:53,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:21:53,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:21:53,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:21:53,533 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 23:21:53,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:21:53,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:21:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:21:53,596 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 23:21:53,681 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:21:53,682 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 23:21:53,790 INFO L85 PathProgramCache]: Analyzing trace with hash 412786516, now seen corresponding path program 4 times [2024-04-06 23:21:53,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:21:53,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:21:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:21:53,799 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:21:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:21:54,730 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:21:54,731 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 23:21:54,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1691540284, now seen corresponding path program 1 times [2024-04-06 23:21:54,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:21:54,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:21:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:21:54,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:21:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:21:54,948 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:21:54,949 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 23:21:54,986 INFO L85 PathProgramCache]: Analyzing trace with hash -91944325, now seen corresponding path program 2 times [2024-04-06 23:21:54,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:21:54,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:21:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:21:55,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 23:21:55,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:21:55,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:21:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:21:55,133 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 23:21:55,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 23:21:55,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable9,SelfDestructingSolverStorable0 [2024-04-06 23:21:55,256 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 23:21:55,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 23:21:55,257 INFO L85 PathProgramCache]: Analyzing trace with hash 647372837, now seen corresponding path program 1 times [2024-04-06 23:21:55,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 23:21:55,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800182945] [2024-04-06 23:21:55,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:21:55,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:21:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:21:55,276 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 23:21:55,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 23:21:55,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800182945] [2024-04-06 23:21:55,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800182945] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 23:21:55,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 23:21:55,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-06 23:21:55,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247370492] [2024-04-06 23:21:55,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 23:21:55,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-06 23:21:55,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 23:21:55,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-06 23:21:55,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-06 23:21:55,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 23:21:55,285 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 23:21:55,285 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 23:21:55,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 23:21:55,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 23:21:55,980 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:21:55,980 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 23:21:56,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1135432791, now seen corresponding path program 5 times [2024-04-06 23:21:56,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:21:56,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:21:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:21:56,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:21:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:21:56,144 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:21:56,145 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 23:21:56,354 INFO L85 PathProgramCache]: Analyzing trace with hash -838678039, now seen corresponding path program 6 times [2024-04-06 23:21:56,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:21:56,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:21:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:21:56,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:21:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:21:57,196 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:21:57,197 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 23:21:57,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1753200217, now seen corresponding path program 3 times [2024-04-06 23:21:57,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:21:57,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:21:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:21:57,229 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:21:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:21:57,417 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:21:57,418 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 23:21:57,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1691540284, now seen corresponding path program 4 times [2024-04-06 23:21:57,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:21:57,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:21:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:21:57,453 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:21:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:21:57,594 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:21:57,594 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 23:21:59,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1000829577, now seen corresponding path program 5 times [2024-04-06 23:21:59,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:21:59,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:21:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:21:59,860 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-04-06 23:21:59,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:21:59,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:21:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:21:59,989 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-04-06 23:22:00,071 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:00,071 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 23:22:00,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1719122833, now seen corresponding path program 6 times [2024-04-06 23:22:00,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:00,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:00,108 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:22:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:00,254 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:00,255 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 23:22:00,308 INFO L85 PathProgramCache]: Analyzing trace with hash 883960303, now seen corresponding path program 1 times [2024-04-06 23:22:00,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:00,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:00,340 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 23:22:00,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:00,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:00,358 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 23:22:00,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 23:22:00,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 23:22:00,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable20,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2024-04-06 23:22:00,476 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 23:22:00,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 23:22:00,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1876334801, now seen corresponding path program 1 times [2024-04-06 23:22:00,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 23:22:00,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208092406] [2024-04-06 23:22:00,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:00,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:00,515 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-06 23:22:00,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 23:22:00,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208092406] [2024-04-06 23:22:00,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208092406] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 23:22:00,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 23:22:00,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-06 23:22:00,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195144164] [2024-04-06 23:22:00,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 23:22:00,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-06 23:22:00,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 23:22:00,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-06 23:22:00,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-04-06 23:22:00,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 23:22:00,519 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 23:22:00,521 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 23:22:00,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 23:22:00,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 23:22:00,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 23:22:01,192 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:01,195 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 23:22:01,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1349900014, now seen corresponding path program 7 times [2024-04-06 23:22:01,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:01,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:01,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:22:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:01,890 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:01,891 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 23:22:01,959 INFO L85 PathProgramCache]: Analyzing trace with hash -638962226, now seen corresponding path program 1 times [2024-04-06 23:22:01,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:01,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:01,972 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:22:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:02,654 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:02,654 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 23:22:02,736 INFO L85 PathProgramCache]: Analyzing trace with hash -918680183, now seen corresponding path program 7 times [2024-04-06 23:22:02,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:02,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:02,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:22:02,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:03,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 23:22:03,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 23:22:03,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 23:22:03,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24 [2024-04-06 23:22:03,057 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 23:22:03,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 23:22:03,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1762182334, now seen corresponding path program 1 times [2024-04-06 23:22:03,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 23:22:03,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359113972] [2024-04-06 23:22:03,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:03,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:03,097 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 23:22:03,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 23:22:03,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359113972] [2024-04-06 23:22:03,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359113972] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 23:22:03,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 23:22:03,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-06 23:22:03,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256901366] [2024-04-06 23:22:03,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 23:22:03,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-06 23:22:03,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 23:22:03,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-06 23:22:03,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-04-06 23:22:03,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 23:22:03,099 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 23:22:03,099 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 23:22:03,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 23:22:03,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 23:22:03,101 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 23:22:03,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 23:22:03,682 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:03,683 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 23:22:03,736 INFO L85 PathProgramCache]: Analyzing trace with hash -2072685566, now seen corresponding path program 8 times [2024-04-06 23:22:03,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:03,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:03,757 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:22:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:03,873 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:03,873 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 23:22:03,918 INFO L85 PathProgramCache]: Analyzing trace with hash 55532605, now seen corresponding path program 9 times [2024-04-06 23:22:03,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:03,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:03,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:22:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:04,097 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:04,097 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 23:22:06,172 INFO L85 PathProgramCache]: Analyzing trace with hash 948455977, now seen corresponding path program 10 times [2024-04-06 23:22:06,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:06,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:06,213 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:22:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:06,518 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:06,518 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 23:22:06,598 INFO L85 PathProgramCache]: Analyzing trace with hash -638962226, now seen corresponding path program 2 times [2024-04-06 23:22:06,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:06,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:06,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:22:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:07,355 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:07,355 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 23:22:09,408 INFO L85 PathProgramCache]: Analyzing trace with hash 738275455, now seen corresponding path program 8 times [2024-04-06 23:22:09,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:09,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:09,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:22:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:09,565 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:09,565 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 23:22:09,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1144970962, now seen corresponding path program 9 times [2024-04-06 23:22:09,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:09,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:09,658 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:22:09,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:10,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 23:22:10,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 23:22:10,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 23:22:10,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 23:22:10,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-04-06 23:22:10,080 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 23:22:10,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 23:22:10,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1050181042, now seen corresponding path program 1 times [2024-04-06 23:22:10,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 23:22:10,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483995249] [2024-04-06 23:22:10,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:10,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:10,111 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 23:22:10,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 23:22:10,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483995249] [2024-04-06 23:22:10,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483995249] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 23:22:10,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 23:22:10,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-06 23:22:10,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318792578] [2024-04-06 23:22:10,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 23:22:10,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-06 23:22:10,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 23:22:10,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-06 23:22:10,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-04-06 23:22:10,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 23:22:10,113 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 23:22:10,113 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 23:22:10,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 23:22:10,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 23:22:10,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 23:22:10,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 23:22:10,114 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 23:22:10,723 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:10,723 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 23:22:10,800 INFO L85 PathProgramCache]: Analyzing trace with hash 599507052, now seen corresponding path program 11 times [2024-04-06 23:22:10,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:10,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:10,878 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-04-06 23:22:10,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:10,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:10,949 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-04-06 23:22:11,079 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:11,079 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 23:22:13,229 INFO L85 PathProgramCache]: Analyzing trace with hash 944792767, now seen corresponding path program 12 times [2024-04-06 23:22:13,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:13,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:13,250 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:22:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:13,379 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:13,379 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 23:22:13,615 INFO L85 PathProgramCache]: Analyzing trace with hash 2109097061, now seen corresponding path program 13 times [2024-04-06 23:22:13,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:13,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:13,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 23:22:13,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:13,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:13,870 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 23:22:14,191 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:14,191 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 23:22:14,331 INFO L85 PathProgramCache]: Analyzing trace with hash 421223438, now seen corresponding path program 1 times [2024-04-06 23:22:14,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:14,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:14,394 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 23:22:14,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:14,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:14,415 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 23:22:15,151 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:15,151 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 23:22:15,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1566554439, now seen corresponding path program 10 times [2024-04-06 23:22:15,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:15,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:15,341 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-04-06 23:22:15,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:15,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:15,408 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-04-06 23:22:15,534 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:15,535 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 23:22:17,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1856503002, now seen corresponding path program 11 times [2024-04-06 23:22:17,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:17,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:17,640 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:22:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:18,009 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 5 treesize of output 3 [2024-04-06 23:22:18,117 INFO L85 PathProgramCache]: Analyzing trace with hash 993127120, now seen corresponding path program 1 times [2024-04-06 23:22:18,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:18,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:18,127 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:22:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:18,246 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:18,246 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 23:22:18,319 INFO L85 PathProgramCache]: Analyzing trace with hash 342471121, now seen corresponding path program 1 times [2024-04-06 23:22:18,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:18,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:18,344 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 23:22:18,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:18,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:18,447 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 23:22:18,542 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 5 treesize of output 3 [2024-04-06 23:22:18,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1011024531, now seen corresponding path program 1 times [2024-04-06 23:22:18,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:18,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:18,616 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:22:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:18,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-06 23:22:18,754 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 15 treesize of output 11 [2024-04-06 23:22:18,915 INFO L85 PathProgramCache]: Analyzing trace with hash -414463737, now seen corresponding path program 1 times [2024-04-06 23:22:18,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:18,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:18,924 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:22:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:19,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 23:22:19,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 23:22:19,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 23:22:19,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 23:22:19,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 23:22:19,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable32,SelfDestructingSolverStorable43,SelfDestructingSolverStorable33,SelfDestructingSolverStorable44,SelfDestructingSolverStorable34,SelfDestructingSolverStorable45,SelfDestructingSolverStorable35,SelfDestructingSolverStorable46,SelfDestructingSolverStorable36,SelfDestructingSolverStorable47,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39 [2024-04-06 23:22:19,128 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 23:22:19,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 23:22:19,128 INFO L85 PathProgramCache]: Analyzing trace with hash 564146173, now seen corresponding path program 1 times [2024-04-06 23:22:19,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 23:22:19,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089080004] [2024-04-06 23:22:19,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:19,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:19,269 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 23:22:19,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 23:22:19,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089080004] [2024-04-06 23:22:19,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089080004] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 23:22:19,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522179269] [2024-04-06 23:22:19,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:19,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 23:22:19,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 23:22:19,276 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 23:22:19,279 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 23:22:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:19,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2024-04-06 23:22:19,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 23:22:19,435 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 23:22:19,464 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 23:22:19,465 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 23:22:19,707 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 23:22:19,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522179269] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-06 23:22:19,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-06 23:22:19,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-04-06 23:22:19,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830524795] [2024-04-06 23:22:19,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-06 23:22:19,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-04-06 23:22:19,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 23:22:19,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-04-06 23:22:19,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-04-06 23:22:19,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 23:22:19,709 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 23:22:19,709 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 23:22:19,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 23:22:19,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 23:22:19,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 23:22:19,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 23:22:19,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 23:22:19,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 23:22:20,455 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:20,456 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 23:22:20,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1358868451, now seen corresponding path program 14 times [2024-04-06 23:22:20,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:20,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:20,564 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:22:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:20,746 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:20,746 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 23:22:23,065 INFO L85 PathProgramCache]: Analyzing trace with hash 2109097061, now seen corresponding path program 15 times [2024-04-06 23:22:23,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:23,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:23,147 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 23:22:23,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:23,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:23,234 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 23:22:23,365 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:23,365 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 23:22:23,519 INFO L85 PathProgramCache]: Analyzing trace with hash -288504141, now seen corresponding path program 16 times [2024-04-06 23:22:23,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:23,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:23,606 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-04-06 23:22:23,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:23,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:23,696 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-04-06 23:22:24,104 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:24,106 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 23:22:24,170 INFO L85 PathProgramCache]: Analyzing trace with hash 493563440, now seen corresponding path program 1 times [2024-04-06 23:22:24,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:24,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:24,175 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:22:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:24,458 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 5 treesize of output 3 [2024-04-06 23:22:24,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1218664042, now seen corresponding path program 1 times [2024-04-06 23:22:24,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:24,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:24,566 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:22:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:24,664 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 5 treesize of output 3 [2024-04-06 23:22:24,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1117223203, now seen corresponding path program 2 times [2024-04-06 23:22:24,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:24,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:24,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:22:24,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:24,861 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:24,861 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 23:22:25,003 INFO L85 PathProgramCache]: Analyzing trace with hash 421223438, now seen corresponding path program 2 times [2024-04-06 23:22:25,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:25,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:25,035 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 23:22:25,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:25,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:25,055 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 23:22:25,230 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:25,230 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 23:22:25,308 INFO L85 PathProgramCache]: Analyzing trace with hash 177739434, now seen corresponding path program 1 times [2024-04-06 23:22:25,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:25,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:25,366 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 23:22:25,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:25,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:25,382 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 23:22:26,176 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:26,176 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 23:22:28,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1318547455, now seen corresponding path program 12 times [2024-04-06 23:22:28,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:28,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-04-06 23:22:28,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:28,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:28,515 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-04-06 23:22:28,935 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:28,935 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 23:22:28,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1525311285, now seen corresponding path program 1 times [2024-04-06 23:22:28,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:28,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:28,995 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:22:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:29,354 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 5 treesize of output 3 [2024-04-06 23:22:31,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1011024531, now seen corresponding path program 2 times [2024-04-06 23:22:31,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:31,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:31,507 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:22:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:32,484 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:32,484 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 23:22:32,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1261717576, now seen corresponding path program 1 times [2024-04-06 23:22:32,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:32,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:32,604 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-06 23:22:32,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:32,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:32,629 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-06 23:22:32,801 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:32,801 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 23:22:32,905 INFO L85 PathProgramCache]: Analyzing trace with hash 354975737, now seen corresponding path program 2 times [2024-04-06 23:22:32,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:32,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:32,955 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-04-06 23:22:32,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:32,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:33,075 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-04-06 23:22:33,822 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:33,823 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 23:22:33,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1186122646, now seen corresponding path program 1 times [2024-04-06 23:22:33,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:33,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:33,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 23:22:33,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:33,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:33,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 23:22:34,736 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:34,736 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 23:22:34,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1964778876, now seen corresponding path program 1 times [2024-04-06 23:22:34,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:34,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:34,871 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-04-06 23:22:34,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:34,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:34,929 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-04-06 23:22:35,013 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:35,014 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 23:22:35,108 INFO L85 PathProgramCache]: Analyzing trace with hash 778603114, now seen corresponding path program 2 times [2024-04-06 23:22:35,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:35,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:35,156 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-04-06 23:22:35,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:35,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:35,205 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-04-06 23:22:35,327 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:35,328 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 23:22:37,404 INFO L85 PathProgramCache]: Analyzing trace with hash -436396715, now seen corresponding path program 3 times [2024-04-06 23:22:37,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:37,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:37,600 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-04-06 23:22:37,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:37,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-04-06 23:22:37,786 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:37,786 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 23:22:37,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1179788245, now seen corresponding path program 4 times [2024-04-06 23:22:37,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:37,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:37,988 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 23:22:37,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:37,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:38,022 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 23:22:38,598 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:38,599 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 23:22:38,640 INFO L85 PathProgramCache]: Analyzing trace with hash -676871527, now seen corresponding path program 1 times [2024-04-06 23:22:38,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:38,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:38,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 23:22:38,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:38,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:38,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 23:22:38,783 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:38,784 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 23:22:38,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1603766374, now seen corresponding path program 2 times [2024-04-06 23:22:38,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:38,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:38,854 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 23:22:38,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:38,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:38,872 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 23:22:39,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 23:22:39,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 23:22:39,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 23:22:39,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 23:22:39,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 23:22:39,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-04-06 23:22:39,795 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 23:22:39,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,SelfDestructingSolverStorable50,SelfDestructingSolverStorable72,SelfDestructingSolverStorable51,SelfDestructingSolverStorable73,SelfDestructingSolverStorable52,SelfDestructingSolverStorable74,SelfDestructingSolverStorable53,SelfDestructingSolverStorable75,SelfDestructingSolverStorable54,SelfDestructingSolverStorable76,SelfDestructingSolverStorable55,SelfDestructingSolverStorable77,SelfDestructingSolverStorable56,SelfDestructingSolverStorable78,SelfDestructingSolverStorable57,SelfDestructingSolverStorable79,SelfDestructingSolverStorable58,SelfDestructingSolverStorable59,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable80,SelfDestructingSolverStorable81,SelfDestructingSolverStorable60,SelfDestructingSolverStorable82,SelfDestructingSolverStorable61,SelfDestructingSolverStorable62,SelfDestructingSolverStorable63,SelfDestructingSolverStorable64,SelfDestructingSolverStorable65,SelfDestructingSolverStorable66,SelfDestructingSolverStorable67,SelfDestructingSolverStorable68,SelfDestructingSolverStorable69,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49 [2024-04-06 23:22:39,991 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-04-06 23:22:39,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 23:22:39,991 INFO L85 PathProgramCache]: Analyzing trace with hash 858758413, now seen corresponding path program 2 times [2024-04-06 23:22:39,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 23:22:39,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123867032] [2024-04-06 23:22:39,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:39,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:40,006 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 23:22:40,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 23:22:40,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123867032] [2024-04-06 23:22:40,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123867032] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 23:22:40,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 23:22:40,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-06 23:22:40,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572843071] [2024-04-06 23:22:40,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 23:22:40,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-06 23:22:40,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 23:22:40,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-06 23:22:40,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-06 23:22:40,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 23:22:40,008 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 23:22:40,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 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 23:22:40,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 23:22:40,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 23:22:40,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 23:22:40,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 23:22:40,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 23:22:40,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-04-06 23:22:40,008 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 23:22:40,660 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:40,660 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 23:22:40,779 INFO L85 PathProgramCache]: Analyzing trace with hash 925996857, now seen corresponding path program 17 times [2024-04-06 23:22:40,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:40,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:40,786 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:22:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:41,286 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:41,287 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 23:22:41,355 INFO L85 PathProgramCache]: Analyzing trace with hash -748222071, now seen corresponding path program 2 times [2024-04-06 23:22:41,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:41,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:41,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 23:22:41,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:41,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:41,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 23:22:42,169 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:42,170 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 23:22:42,219 INFO L85 PathProgramCache]: Analyzing trace with hash -172699570, now seen corresponding path program 13 times [2024-04-06 23:22:42,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:42,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:42,244 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-06 23:22:42,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:42,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:42,268 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-06 23:22:42,676 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:42,677 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 23:22:42,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1525311285, now seen corresponding path program 2 times [2024-04-06 23:22:42,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:42,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:42,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:22:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:43,014 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 5 treesize of output 3 [2024-04-06 23:22:43,086 INFO L85 PathProgramCache]: Analyzing trace with hash 385409083, now seen corresponding path program 3 times [2024-04-06 23:22:43,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:43,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:43,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:22:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:43,210 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:43,210 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 23:22:43,311 INFO L85 PathProgramCache]: Analyzing trace with hash 342471121, now seen corresponding path program 2 times [2024-04-06 23:22:43,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:43,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:43,328 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 23:22:43,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:43,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:43,351 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 23:22:43,473 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:43,473 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 23:22:43,704 INFO L85 PathProgramCache]: Analyzing trace with hash -820228586, now seen corresponding path program 1 times [2024-04-06 23:22:43,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:43,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:43,747 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 23:22:43,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:43,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:43,761 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 23:22:43,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-06 23:22:43,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1224, Unknown=0, NotChecked=0, Total=1332 [2024-04-06 23:22:44,426 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:44,427 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 23:22:44,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1358868451, now seen corresponding path program 18 times [2024-04-06 23:22:44,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:44,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:44,497 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:22:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:44,620 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:44,621 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 23:22:44,818 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:44,818 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 23:22:46,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2109097061, now seen corresponding path program 19 times [2024-04-06 23:22:46,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:46,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:46,964 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 23:22:46,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:46,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:47,031 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 23:22:47,945 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:47,945 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 23:22:48,083 INFO L85 PathProgramCache]: Analyzing trace with hash 2061908485, now seen corresponding path program 20 times [2024-04-06 23:22:48,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:48,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:48,177 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-04-06 23:22:48,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:48,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:48,218 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-04-06 23:22:48,365 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:48,365 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 23:22:48,515 INFO L85 PathProgramCache]: Analyzing trace with hash -399488478, now seen corresponding path program 21 times [2024-04-06 23:22:48,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:48,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:48,524 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:22:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:48,669 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:48,670 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 23:22:49,073 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:49,074 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 23:22:49,145 INFO L85 PathProgramCache]: Analyzing trace with hash -748222071, now seen corresponding path program 3 times [2024-04-06 23:22:49,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:49,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:49,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 23:22:49,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:49,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:49,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 23:22:49,309 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:49,309 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 23:22:50,316 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:50,316 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 23:22:51,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-04-06 23:22:51,198 INFO L85 PathProgramCache]: Analyzing trace with hash -937220261, now seen corresponding path program 2 times [2024-04-06 23:22:51,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:51,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:51,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:22:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:22:51,898 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:51,898 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 23:22:54,748 INFO L85 PathProgramCache]: Analyzing trace with hash 971820746, now seen corresponding path program 14 times [2024-04-06 23:22:54,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:54,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:54,789 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-04-06 23:22:54,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:54,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:54,828 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-04-06 23:22:55,023 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:55,023 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 23:22:55,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1535710054, now seen corresponding path program 15 times [2024-04-06 23:22:55,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:55,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:55,192 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-04-06 23:22:55,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:22:55,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:22:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:22:55,246 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-04-06 23:22:55,480 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:55,480 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 23:22:55,823 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:55,823 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 23:22:56,865 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:56,866 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 23:22:57,082 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:57,082 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 23:22:57,244 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:22:57,244 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 23:23:00,662 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:23:00,663 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 23:23:00,699 INFO L85 PathProgramCache]: Analyzing trace with hash -54340269, now seen corresponding path program 1 times [2024-04-06 23:23:00,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:23:00,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:23:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:23:00,703 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:23:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:23:01,727 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:23:01,727 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 23:23:04,272 INFO L85 PathProgramCache]: Analyzing trace with hash 184804884, now seen corresponding path program 3 times [2024-04-06 23:23:04,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:23:04,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:23:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:23:04,322 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-04-06 23:23:04,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:23:04,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:23:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:23:04,371 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-04-06 23:23:04,718 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:23:04,718 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 23:23:05,620 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:23:05,620 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 23:23:06,553 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:23:06,553 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 23:23:08,801 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:23:08,801 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 23:23:10,861 INFO L85 PathProgramCache]: Analyzing trace with hash -983768331, now seen corresponding path program 5 times [2024-04-06 23:23:10,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:23:10,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:23:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:23:10,898 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-04-06 23:23:10,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:23:10,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:23:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:23:10,936 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-04-06 23:23:11,089 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:23:11,089 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 23:23:11,200 INFO L85 PathProgramCache]: Analyzing trace with hash 851460250, now seen corresponding path program 6 times [2024-04-06 23:23:11,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:23:11,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:23:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:23:11,208 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:23:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:23:11,579 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:23:11,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 38 [2024-04-06 23:23:11,766 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:23:11,767 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 23:23:14,131 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:23:14,131 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 23:23:14,220 INFO L85 PathProgramCache]: Analyzing trace with hash 492573982, now seen corresponding path program 1 times [2024-04-06 23:23:14,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:23:14,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:23:14,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:23:14,260 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 23:23:14,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:23:14,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:23:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:23:14,277 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 23:23:14,376 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 5 treesize of output 3 [2024-04-06 23:23:14,452 INFO L85 PathProgramCache]: Analyzing trace with hash 633382955, now seen corresponding path program 1 times [2024-04-06 23:23:14,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:23:14,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:23:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:23:14,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 23:23:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 23:23:14,661 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 23:23:14,661 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 23:23:14,706 INFO L85 PathProgramCache]: Analyzing trace with hash -676871527, now seen corresponding path program 3 times [2024-04-06 23:23:14,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:23:14,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:23:14,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:23:14,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 23:23:14,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 23:23:14,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 23:23:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 23:23:14,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 23:23:16,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,SelfDestructingSolverStorable91,SelfDestructingSolverStorable92,SelfDestructingSolverStorable93,SelfDestructingSolverStorable110,SelfDestructingSolverStorable94,SelfDestructingSolverStorable95,SelfDestructingSolverStorable96,SelfDestructingSolverStorable97,SelfDestructingSolverStorable108,SelfDestructingSolverStorable109,SelfDestructingSolverStorable98,SelfDestructingSolverStorable104,SelfDestructingSolverStorable99,SelfDestructingSolverStorable105,SelfDestructingSolverStorable106,SelfDestructingSolverStorable107,SelfDestructingSolverStorable100,SelfDestructingSolverStorable101,SelfDestructingSolverStorable102,SelfDestructingSolverStorable103,SelfDestructingSolverStorable83,SelfDestructingSolverStorable84,SelfDestructingSolverStorable85,SelfDestructingSolverStorable86,SelfDestructingSolverStorable87,SelfDestructingSolverStorable115,SelfDestructingSolverStorable88,SelfDestructingSolverStorable116,SelfDestructingSolverStorable89,SelfDestructingSolverStorable117,SelfDestructingSolverStorable118,SelfDestructingSolverStorable111,SelfDestructingSolverStorable112,SelfDestructingSolverStorable113,SelfDestructingSolverStorable114 [2024-04-06 23:23:16,092 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@265e024e 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: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.next(NestedIterator.java:94) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:183) 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:362) 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 23:23:16,095 INFO L158 Benchmark]: Toolchain (without parser) took 89597.48ms. Allocated memory was 168.8MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 136.8MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 506.6MB. Max. memory is 8.0GB. [2024-04-06 23:23:16,095 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.39ms. Allocated memory is still 168.8MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-06 23:23:16,096 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.15ms. Allocated memory is still 168.8MB. Free memory was 136.8MB in the beginning and 135.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-06 23:23:16,096 INFO L158 Benchmark]: Boogie Preprocessor took 16.76ms. Allocated memory is still 168.8MB. Free memory was 135.2MB in the beginning and 134.0MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-06 23:23:16,096 INFO L158 Benchmark]: RCFGBuilder took 251.35ms. Allocated memory is still 168.8MB. Free memory was 134.0MB in the beginning and 123.3MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-04-06 23:23:16,096 INFO L158 Benchmark]: TraceAbstraction took 89302.60ms. Allocated memory was 168.8MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 122.1MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 491.9MB. Max. memory is 8.0GB. [2024-04-06 23:23:16,097 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.39ms. Allocated memory is still 168.8MB. Free memory is still 138.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.15ms. Allocated memory is still 168.8MB. Free memory was 136.8MB in the beginning and 135.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.76ms. Allocated memory is still 168.8MB. Free memory was 135.2MB in the beginning and 134.0MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 251.35ms. Allocated memory is still 168.8MB. Free memory was 134.0MB in the beginning and 123.3MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 89302.60ms. Allocated memory was 168.8MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 122.1MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 491.9MB. 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@265e024e de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@265e024e: 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 23:23:16,111 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 23:23:16,410 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...