/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 213 -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 21:10:02,492 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-06 21:10:02,552 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-06 21:10:02,555 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-06 21:10:02,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-06 21:10:02,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-06 21:10:02,587 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-06 21:10:02,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-06 21:10:02,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-06 21:10:02,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-06 21:10:02,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-06 21:10:02,592 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-06 21:10:02,593 INFO L153 SettingsManager]: * Use SBE=true [2024-04-06 21:10:02,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-06 21:10:02,594 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-06 21:10:02,594 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-06 21:10:02,595 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-06 21:10:02,595 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-06 21:10:02,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-06 21:10:02,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-06 21:10:02,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-06 21:10:02,596 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-06 21:10:02,596 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-06 21:10:02,596 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-06 21:10:02,597 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-06 21:10:02,597 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-06 21:10:02,597 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-06 21:10:02,597 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-06 21:10:02,597 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-06 21:10:02,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-06 21:10:02,599 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-06 21:10:02,599 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-06 21:10:02,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-06 21:10:02,599 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-06 21:10:02,599 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-06 21:10:02,599 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-06 21:10:02,599 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-06 21:10:02,600 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-06 21:10:02,600 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-06 21:10:02,600 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 213 [2024-04-06 21:10:02,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-06 21:10:02,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-06 21:10:02,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-06 21:10:02,866 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-04-06 21:10:02,867 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-04-06 21:10:02,867 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 21:10:02,868 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 21:10:02,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-06 21:10:02,900 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-04-06 21:10:02,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-06 21:10:02,912 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-06 21:10:02,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-06 21:10:02,939 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 09:10:02" (1/1) ... [2024-04-06 21:10:02,948 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 09:10:02" (1/1) ... [2024-04-06 21:10:02,954 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-04-06 21:10:02,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-06 21:10:02,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-06 21:10:02,957 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-06 21:10:02,957 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-06 21:10:02,963 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 09:10:02" (1/1) ... [2024-04-06 21:10:02,963 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 09:10:02" (1/1) ... [2024-04-06 21:10:02,972 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 09:10:02" (1/1) ... [2024-04-06 21:10:02,972 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 09:10:02" (1/1) ... [2024-04-06 21:10:02,978 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 09:10:02" (1/1) ... [2024-04-06 21:10:02,981 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 09:10:02" (1/1) ... [2024-04-06 21:10:02,984 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 09:10:02" (1/1) ... [2024-04-06 21:10:02,985 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 09:10:02" (1/1) ... [2024-04-06 21:10:02,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-06 21:10:02,986 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-06 21:10:02,986 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-06 21:10:02,986 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-06 21:10:02,987 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 09:10:02" (1/1) ... [2024-04-06 21:10:02,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-06 21:10:02,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 21:10:03,097 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 21:10:03,105 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 21:10:03,138 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-04-06 21:10:03,139 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-06 21:10:03,139 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-06 21:10:03,139 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-04-06 21:10:03,139 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-06 21:10:03,139 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-06 21:10:03,139 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-04-06 21:10:03,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-06 21:10:03,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-06 21:10:03,140 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2024-04-06 21:10:03,140 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-04-06 21:10:03,140 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-04-06 21:10:03,140 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2024-04-06 21:10:03,140 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-04-06 21:10:03,140 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-04-06 21:10:03,140 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2024-04-06 21:10:03,140 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-04-06 21:10:03,141 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-04-06 21:10:03,141 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 21:10:03,181 INFO L241 CfgBuilder]: Building ICFG [2024-04-06 21:10:03,183 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-06 21:10:03,307 INFO L282 CfgBuilder]: Performing block encoding [2024-04-06 21:10:03,315 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-06 21:10:03,315 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-04-06 21:10:03,317 INFO L201 PluginConnector]: Adding new model min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:10:03 BoogieIcfgContainer [2024-04-06 21:10:03,317 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-06 21:10:03,319 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-06 21:10:03,319 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-06 21:10:03,326 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-06 21:10:03,327 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 09:10:02" (1/2) ... [2024-04-06 21:10:03,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c1a778e and model type min-max-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 09:10:03, skipping insertion in model container [2024-04-06 21:10:03,329 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 09:10:03" (2/2) ... [2024-04-06 21:10:03,330 INFO L112 eAbstractionObserver]: Analyzing ICFG min-max-2.wvr.bpl [2024-04-06 21:10:03,345 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-06 21:10:03,354 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-06 21:10:03,354 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-06 21:10:03,355 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-06 21:10:03,400 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-04-06 21:10:03,428 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-06 21:10:03,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-06 21:10:03,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 21:10:03,430 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 21:10:03,435 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 21:10:03,464 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-06 21:10:03,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 21:10:03,475 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-06 21:10:03,480 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;@68c4ea29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213 [2024-04-06 21:10:03,481 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-04-06 21:10:03,560 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 21:10:03,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 21:10:03,561 INFO L85 PathProgramCache]: Analyzing trace with hash -215255607, now seen corresponding path program 1 times [2024-04-06 21:10:03,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 21:10:03,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625323303] [2024-04-06 21:10:03,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:03,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:03,781 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 21:10:03,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 21:10:03,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625323303] [2024-04-06 21:10:03,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625323303] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 21:10:03,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 21:10:03,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-04-06 21:10:03,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965224765] [2024-04-06 21:10:03,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 21:10:03,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-06 21:10:03,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 21:10:03,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-06 21:10:03,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-04-06 21:10:03,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 21:10:03,818 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 21:10:03,820 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 21:10:03,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 21:10:05,240 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:05,242 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 21:10:05,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1754367502, now seen corresponding path program 1 times [2024-04-06 21:10:05,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:05,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 21:10:05,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:05,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:05,660 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-04-06 21:10:05,951 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:05,952 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 21:10:06,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1652800034, now seen corresponding path program 2 times [2024-04-06 21:10:06,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:06,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:06,242 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 21:10:06,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:06,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:06,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:06,441 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 21:10:06,560 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:06,561 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 21:10:06,608 INFO L85 PathProgramCache]: Analyzing trace with hash 89119342, now seen corresponding path program 3 times [2024-04-06 21:10:06,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:06,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:06,846 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-04-06 21:10:06,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:06,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:07,016 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-04-06 21:10:07,106 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:07,107 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 21:10:07,147 INFO L85 PathProgramCache]: Analyzing trace with hash -636144160, now seen corresponding path program 4 times [2024-04-06 21:10:07,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:07,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:07,212 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 21:10:07,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:07,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:07,263 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 21:10:08,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 21:10:08,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable0 [2024-04-06 21:10:08,293 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 21:10:08,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 21:10:08,294 INFO L85 PathProgramCache]: Analyzing trace with hash 647372837, now seen corresponding path program 1 times [2024-04-06 21:10:08,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 21:10:08,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384602158] [2024-04-06 21:10:08,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:08,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:08,314 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 21:10:08,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 21:10:08,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384602158] [2024-04-06 21:10:08,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384602158] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 21:10:08,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 21:10:08,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-06 21:10:08,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256799126] [2024-04-06 21:10:08,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 21:10:08,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-06 21:10:08,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 21:10:08,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-06 21:10:08,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-04-06 21:10:08,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 21:10:08,319 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 21:10:08,320 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 21:10:08,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 21:10:08,320 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 21:10:09,027 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:09,028 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 21:10:09,061 INFO L85 PathProgramCache]: Analyzing trace with hash -88519838, now seen corresponding path program 5 times [2024-04-06 21:10:09,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:09,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:09,076 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:09,358 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:09,358 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 21:10:09,400 INFO L85 PathProgramCache]: Analyzing trace with hash -636144160, now seen corresponding path program 6 times [2024-04-06 21:10:09,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:09,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:09,465 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 21:10:09,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:09,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:09,514 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 21:10:09,702 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:09,702 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 21:10:09,745 INFO L85 PathProgramCache]: Analyzing trace with hash -638962226, now seen corresponding path program 1 times [2024-04-06 21:10:09,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:09,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:09,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:10,597 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:10,597 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 21:10:10,629 INFO L85 PathProgramCache]: Analyzing trace with hash 940196477, now seen corresponding path program 1 times [2024-04-06 21:10:10,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:10,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:10,749 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-04-06 21:10:10,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:10,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:10,870 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-04-06 21:10:11,047 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:11,047 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 21:10:11,084 INFO L85 PathProgramCache]: Analyzing trace with hash -504139607, now seen corresponding path program 1 times [2024-04-06 21:10:11,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:11,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:11,102 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:11,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 21:10:11,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 21:10:11,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16 [2024-04-06 21:10:11,225 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 21:10:11,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 21:10:11,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1876334801, now seen corresponding path program 1 times [2024-04-06 21:10:11,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 21:10:11,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470447202] [2024-04-06 21:10:11,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:11,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:11,298 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 21:10:11,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 21:10:11,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470447202] [2024-04-06 21:10:11,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470447202] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 21:10:11,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 21:10:11,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-06 21:10:11,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387426269] [2024-04-06 21:10:11,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 21:10:11,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-06 21:10:11,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 21:10:11,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-06 21:10:11,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-04-06 21:10:11,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 21:10:11,300 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 21:10:11,300 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 21:10:11,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 21:10:11,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 21:10:11,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 21:10:11,945 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:11,945 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 21:10:14,021 INFO L85 PathProgramCache]: Analyzing trace with hash -636144160, now seen corresponding path program 7 times [2024-04-06 21:10:14,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:14,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:14,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:14,908 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:14,909 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 21:10:14,950 INFO L85 PathProgramCache]: Analyzing trace with hash -898141138, now seen corresponding path program 2 times [2024-04-06 21:10:14,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:14,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:14,968 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:15,086 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:15,086 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 21:10:15,131 INFO L85 PathProgramCache]: Analyzing trace with hash -918680183, now seen corresponding path program 3 times [2024-04-06 21:10:15,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:15,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:15,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:15,307 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:15,307 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 21:10:15,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1719122833, now seen corresponding path program 4 times [2024-04-06 21:10:15,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:15,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:15,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:15,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 21:10:15,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 21:10:15,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 21:10:15,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,SelfDestructingSolverStorable17 [2024-04-06 21:10:15,608 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 21:10:15,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 21:10:15,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1762182334, now seen corresponding path program 1 times [2024-04-06 21:10:15,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 21:10:15,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096406892] [2024-04-06 21:10:15,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:15,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:15,632 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 21:10:15,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 21:10:15,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096406892] [2024-04-06 21:10:15,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096406892] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 21:10:15,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 21:10:15,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-06 21:10:15,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297704344] [2024-04-06 21:10:15,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 21:10:15,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-06 21:10:15,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 21:10:15,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-06 21:10:15,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-04-06 21:10:15,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 21:10:15,634 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 21:10:15,634 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 21:10:15,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 21:10:15,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 21:10:15,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 21:10:15,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 21:10:16,140 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:16,140 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 21:10:16,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1177504761, now seen corresponding path program 8 times [2024-04-06 21:10:16,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:16,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:16,173 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:16,545 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:16,545 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 21:10:16,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1392823293, now seen corresponding path program 1 times [2024-04-06 21:10:16,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:16,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:16,674 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 21:10:16,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:16,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:16,695 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 21:10:16,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-06 21:10:16,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-04-06 21:10:17,272 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:17,272 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 21:10:19,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1799323947, now seen corresponding path program 9 times [2024-04-06 21:10:19,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:19,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:19,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:19,694 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:19,694 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 21:10:19,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1547426195, now seen corresponding path program 10 times [2024-04-06 21:10:19,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:19,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:19,798 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:19,917 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:19,917 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 21:10:19,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1347489295, now seen corresponding path program 11 times [2024-04-06 21:10:19,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:19,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:19,965 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:20,269 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:20,270 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 21:10:20,357 INFO L85 PathProgramCache]: Analyzing trace with hash -363864358, now seen corresponding path program 1 times [2024-04-06 21:10:20,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:20,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:20,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:20,636 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:20,638 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 21:10:20,822 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:20,823 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 21:10:22,912 INFO L85 PathProgramCache]: Analyzing trace with hash 876201912, now seen corresponding path program 1 times [2024-04-06 21:10:22,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:22,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:22,917 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:23,001 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:23,001 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 21:10:23,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1392455610, now seen corresponding path program 1 times [2024-04-06 21:10:23,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:23,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:23,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:23,272 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:23,273 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 21:10:23,347 INFO L85 PathProgramCache]: Analyzing trace with hash -638962226, now seen corresponding path program 2 times [2024-04-06 21:10:23,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:23,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:23,352 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:24,213 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:24,213 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 21:10:24,483 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:24,483 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 21:10:24,654 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:24,655 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 21:10:25,475 INFO L85 PathProgramCache]: Analyzing trace with hash -229041739, now seen corresponding path program 1 times [2024-04-06 21:10:25,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:25,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:25,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:25,860 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:25,860 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 21:10:25,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1597651287, now seen corresponding path program 1 times [2024-04-06 21:10:25,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:25,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:26,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:26,141 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:26,141 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 21:10:26,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1011024531, now seen corresponding path program 1 times [2024-04-06 21:10:26,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:26,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:26,269 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:26,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 21:10:26,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 21:10:26,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 21:10:26,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 21:10:26,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,SelfDestructingSolverStorable29,SelfDestructingSolverStorable32,SelfDestructingSolverStorable22,SelfDestructingSolverStorable33,SelfDestructingSolverStorable23,SelfDestructingSolverStorable34,SelfDestructingSolverStorable24,SelfDestructingSolverStorable35,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-04-06 21:10:26,527 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 21:10:26,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 21:10:26,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1050181042, now seen corresponding path program 1 times [2024-04-06 21:10:26,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 21:10:26,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860381755] [2024-04-06 21:10:26,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:26,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:26,560 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 21:10:26,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 21:10:26,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860381755] [2024-04-06 21:10:26,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860381755] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-06 21:10:26,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-06 21:10:26,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-04-06 21:10:26,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568773307] [2024-04-06 21:10:26,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-06 21:10:26,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-04-06 21:10:26,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 21:10:26,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-04-06 21:10:26,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-04-06 21:10:26,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 21:10:26,563 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 21:10:26,563 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 21:10:26,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 21:10:26,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 21:10:26,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 21:10:26,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 21:10:26,563 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 21:10:27,552 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:27,553 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 21:10:27,728 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:27,728 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 21:10:27,916 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 21:10:27,993 INFO L85 PathProgramCache]: Analyzing trace with hash 876201912, now seen corresponding path program 2 times [2024-04-06 21:10:27,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:27,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:28,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:28,177 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:28,180 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 21:10:29,141 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:29,141 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 21:10:31,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1717018328, now seen corresponding path program 5 times [2024-04-06 21:10:31,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:31,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:31,240 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:31,822 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 21:10:31,888 INFO L85 PathProgramCache]: Analyzing trace with hash -937220261, now seen corresponding path program 1 times [2024-04-06 21:10:31,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:31,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:31,895 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:32,035 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:32,036 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 21:10:32,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1573823303, now seen corresponding path program 1 times [2024-04-06 21:10:32,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:32,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:32,148 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 21:10:32,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:32,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:32,170 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 21:10:32,292 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:32,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 38 [2024-04-06 21:10:32,459 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 21:10:32,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1011024531, now seen corresponding path program 2 times [2024-04-06 21:10:32,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:32,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:32,544 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:32,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-06 21:10:32,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 21:10:32,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 21:10:32,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 21:10:32,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-06 21:10:32,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39 [2024-04-06 21:10:32,925 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 21:10:32,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-06 21:10:32,926 INFO L85 PathProgramCache]: Analyzing trace with hash 564146173, now seen corresponding path program 1 times [2024-04-06 21:10:32,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-06 21:10:32,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726943838] [2024-04-06 21:10:32,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:32,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:33,035 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 21:10:33,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-06 21:10:33,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726943838] [2024-04-06 21:10:33,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726943838] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-06 21:10:33,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869646681] [2024-04-06 21:10:33,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:33,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-06 21:10:33,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-06 21:10:33,038 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 21:10:33,039 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 21:10:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:33,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2024-04-06 21:10:33,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-06 21:10:33,186 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 21:10:33,211 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 21:10:33,211 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-06 21:10:33,560 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-04-06 21:10:33,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 1 [2024-04-06 21:10:33,561 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 21:10:33,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869646681] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-06 21:10:33,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-06 21:10:33,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-04-06 21:10:33,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304643157] [2024-04-06 21:10:33,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-06 21:10:33,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-04-06 21:10:33,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-06 21:10:33,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-04-06 21:10:33,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-04-06 21:10:33,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-06 21:10:33,564 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-06 21:10:33,564 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 21:10:33,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-06 21:10:33,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 21:10:33,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 21:10:33,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 21:10:33,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-06 21:10:33,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-06 21:10:34,261 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:34,261 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 21:10:36,932 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:36,933 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 21:10:39,554 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:39,554 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 21:10:39,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1605161836, now seen corresponding path program 1 times [2024-04-06 21:10:39,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:39,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:39,624 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:40,044 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 21:10:40,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1218664042, now seen corresponding path program 2 times [2024-04-06 21:10:40,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:40,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:40,114 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:40,259 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:40,259 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 21:10:41,190 INFO L85 PathProgramCache]: Analyzing trace with hash 296063284, now seen corresponding path program 1 times [2024-04-06 21:10:41,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:41,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:41,208 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 21:10:41,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:41,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:41,243 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 21:10:41,456 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 21:10:41,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1069066912, now seen corresponding path program 3 times [2024-04-06 21:10:41,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:41,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:41,539 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:41,664 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:41,665 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 21:10:41,953 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:41,953 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 21:10:42,102 INFO L85 PathProgramCache]: Analyzing trace with hash 766942067, now seen corresponding path program 1 times [2024-04-06 21:10:42,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:42,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:42,107 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:43,021 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:43,022 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 21:10:45,220 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:45,221 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 21:10:45,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1717018328, now seen corresponding path program 6 times [2024-04-06 21:10:45,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:45,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:45,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:45,470 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:45,470 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 21:10:47,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1335092694, now seen corresponding path program 7 times [2024-04-06 21:10:47,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:47,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:47,744 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 21:10:47,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:47,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:47,825 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 21:10:48,341 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:48,341 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 21:10:48,401 INFO L85 PathProgramCache]: Analyzing trace with hash -898940967, now seen corresponding path program 1 times [2024-04-06 21:10:48,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:48,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:48,406 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:48,860 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 21:10:48,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1011024531, now seen corresponding path program 3 times [2024-04-06 21:10:48,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:48,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:48,944 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:49,144 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:49,144 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 21:10:49,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1629980278, now seen corresponding path program 1 times [2024-04-06 21:10:49,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:49,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:49,274 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:50,321 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:50,322 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 21:10:50,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1160411164, now seen corresponding path program 1 times [2024-04-06 21:10:50,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:50,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:50,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:50,534 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:50,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 44 treesize of output 38 [2024-04-06 21:10:53,024 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:53,025 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 21:10:55,310 INFO L85 PathProgramCache]: Analyzing trace with hash -2033613776, now seen corresponding path program 1 times [2024-04-06 21:10:55,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:55,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:55,347 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 21:10:55,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:55,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:55,363 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 21:10:55,655 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:55,655 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 21:10:55,699 INFO L85 PathProgramCache]: Analyzing trace with hash -54340269, now seen corresponding path program 1 times [2024-04-06 21:10:55,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:55,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:55,704 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:10:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:10:56,165 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:56,165 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 21:10:56,275 INFO L85 PathProgramCache]: Analyzing trace with hash -16677137, now seen corresponding path program 1 times [2024-04-06 21:10:56,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:56,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:56,343 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 21:10:56,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:56,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:56,363 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 21:10:56,656 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:56,656 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 21:10:56,753 INFO L85 PathProgramCache]: Analyzing trace with hash 2042798140, now seen corresponding path program 1 times [2024-04-06 21:10:56,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:56,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:56,806 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 21:10:56,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:56,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:56,843 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 21:10:56,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-06 21:10:56,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1014, Unknown=0, NotChecked=0, Total=1122 [2024-04-06 21:10:57,581 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:57,582 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 21:10:57,853 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:57,853 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 21:10:58,079 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:58,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 39 treesize of output 35 [2024-04-06 21:10:59,052 INFO L85 PathProgramCache]: Analyzing trace with hash -288504141, now seen corresponding path program 12 times [2024-04-06 21:10:59,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:59,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:59,131 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 21:10:59,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:10:59,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:10:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:10:59,212 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 21:10:59,824 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:10:59,824 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 21:11:00,254 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:11:00,254 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 21:11:00,476 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:11:00,476 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 21:11:00,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1698759724, now seen corresponding path program 1 times [2024-04-06 21:11:00,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:11:00,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:11:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:11:00,738 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:11:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:11:01,330 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:11:01,330 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 21:11:01,516 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:11:01,516 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 21:11:01,939 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:11:01,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 38 [2024-04-06 21:11:05,178 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:11:05,178 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 21:11:06,384 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:11:06,384 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 21:11:06,526 INFO L85 PathProgramCache]: Analyzing trace with hash 774199281, now seen corresponding path program 1 times [2024-04-06 21:11:06,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:11:06,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:11:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:11:06,532 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:11:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:11:06,796 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 21:11:06,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1525311285, now seen corresponding path program 2 times [2024-04-06 21:11:06,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:11:06,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:11:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:11:06,864 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:11:06,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:11:07,040 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 21:11:07,065 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 21:11:07,089 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 21:11:07,121 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 21:11:07,172 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 21:11:07,176 INFO L85 PathProgramCache]: Analyzing trace with hash -229041739, now seen corresponding path program 2 times [2024-04-06 21:11:07,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:11:07,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:11:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:11:07,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:11:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:11:07,808 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:11:07,808 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 21:11:09,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1573823303, now seen corresponding path program 2 times [2024-04-06 21:11:09,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:11:09,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:11:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:11:09,954 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 21:11:09,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:11:09,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:11:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:11:09,975 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 21:11:10,101 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:11:10,101 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 21:11:10,543 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:11:10,543 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 21:11:10,698 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:11:10,698 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 21:11:10,945 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 21:11:12,101 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:11:12,102 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 21:11:12,391 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:11:12,391 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 21:11:12,530 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:11:12,531 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 21:11:13,452 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:11:13,453 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 21:11:13,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-06 21:11:13,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-04-06 21:11:15,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1896082985, now seen corresponding path program 2 times [2024-04-06 21:11:15,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:11:15,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:11:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:11:15,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:11:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:11:15,991 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:11:15,991 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 21:11:18,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2093578645, now seen corresponding path program 2 times [2024-04-06 21:11:18,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:11:18,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:11:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:11:18,089 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:11:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:11:18,691 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 21:11:18,901 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 21:11:19,037 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 21:11:19,686 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:11:19,686 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 21:11:22,457 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:11:22,458 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 21:11:22,675 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:11:22,675 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 21:11:23,540 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:11:23,540 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 21:11:23,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-06 21:11:23,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-04-06 21:11:25,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1383224968, now seen corresponding path program 1 times [2024-04-06 21:11:25,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:11:25,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:11:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:11:25,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:11:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:11:26,033 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:11:26,034 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 21:11:28,277 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 21:11:28,312 INFO L85 PathProgramCache]: Analyzing trace with hash 2083138704, now seen corresponding path program 1 times [2024-04-06 21:11:28,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:11:28,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:11:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:11:28,317 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-06 21:11:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-06 21:11:29,006 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:11:29,006 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 21:11:29,091 INFO L85 PathProgramCache]: Analyzing trace with hash -108691932, now seen corresponding path program 1 times [2024-04-06 21:11:29,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:11:29,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:11:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:11:29,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-06 21:11:29,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-06 21:11:29,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-06 21:11:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-06 21:11:29,128 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 21:11:29,280 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:11:29,280 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 21:11:29,458 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 21:11:29,828 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-04-06 21:11:29,828 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 21:11:31,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-04-06 21:11:32,059 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,SelfDestructingSolverStorable57,SelfDestructingSolverStorable58,SelfDestructingSolverStorable59,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60,SelfDestructingSolverStorable61,SelfDestructingSolverStorable62,SelfDestructingSolverStorable63,SelfDestructingSolverStorable64,SelfDestructingSolverStorable43,SelfDestructingSolverStorable65,SelfDestructingSolverStorable44,SelfDestructingSolverStorable66,SelfDestructingSolverStorable45,SelfDestructingSolverStorable67,SelfDestructingSolverStorable46,SelfDestructingSolverStorable68,SelfDestructingSolverStorable47,SelfDestructingSolverStorable69,SelfDestructingSolverStorable48,SelfDestructingSolverStorable49 [2024-04-06 21:11:32,060 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@4a60f7e8 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:156) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.checkInternal(MonolithicHoareTripleChecker.java:83) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:196) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.LoopLockstepOrder$WrapperAutomaton.internalSuccessors(LoopLockstepOrder.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:169) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:173) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ConditionalCommutativityCheckerVisitor.discoverState(ConditionalCommutativityCheckerVisitor.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.visitors.DeadEndOptimizingSearchVisitor.discoverState(DeadEndOptimizingSearchVisitor.java:73) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:222) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:329) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java: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 21:11:32,063 INFO L158 Benchmark]: Toolchain (without parser) took 89162.74ms. Allocated memory was 313.5MB in the beginning and 2.2GB in the end (delta: 1.8GB). Free memory was 286.8MB in the beginning and 1.3GB in the end (delta: -981.0MB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2024-04-06 21:11:32,063 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 313.5MB. Free memory is still 282.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-06 21:11:32,064 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.47ms. Allocated memory is still 313.5MB. Free memory was 286.8MB in the beginning and 285.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-06 21:11:32,064 INFO L158 Benchmark]: Boogie Preprocessor took 28.93ms. Allocated memory is still 313.5MB. Free memory was 285.2MB in the beginning and 283.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-06 21:11:32,064 INFO L158 Benchmark]: RCFGBuilder took 330.69ms. Allocated memory is still 313.5MB. Free memory was 283.9MB in the beginning and 273.0MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-04-06 21:11:32,064 INFO L158 Benchmark]: TraceAbstraction took 88744.18ms. Allocated memory was 313.5MB in the beginning and 2.2GB in the end (delta: 1.8GB). Free memory was 271.7MB in the beginning and 1.3GB in the end (delta: -996.1MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2024-04-06 21:11:32,065 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.10ms. Allocated memory is still 313.5MB. Free memory is still 282.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.47ms. Allocated memory is still 313.5MB. Free memory was 286.8MB in the beginning and 285.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.93ms. Allocated memory is still 313.5MB. Free memory was 285.2MB in the beginning and 283.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 330.69ms. Allocated memory is still 313.5MB. Free memory was 283.9MB in the beginning and 273.0MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 88744.18ms. Allocated memory was 313.5MB in the beginning and 2.2GB in the end (delta: 1.8GB). Free memory was 271.7MB in the beginning and 1.3GB in the end (delta: -996.1MB). Peak memory consumption was 1.2GB. 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@4a60f7e8 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker@4a60f7e8: 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 21:11:32,076 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 21:11:32,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...