/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking BOTH --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/prod-cons3.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m [2024-05-04 16:24:23,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-04 16:24:23,121 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-04 16:24:23,125 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-04 16:24:23,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-04 16:24:23,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-04 16:24:23,148 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-04 16:24:23,148 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-04 16:24:23,149 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-04 16:24:23,152 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-04 16:24:23,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-04 16:24:23,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-04 16:24:23,152 INFO L153 SettingsManager]: * Use SBE=true [2024-05-04 16:24:23,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-04 16:24:23,154 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-04 16:24:23,154 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-04 16:24:23,154 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-04 16:24:23,154 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-04 16:24:23,154 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-04 16:24:23,155 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-04 16:24:23,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-04 16:24:23,155 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-04 16:24:23,156 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-04 16:24:23,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-04 16:24:23,156 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-04 16:24:23,157 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-04 16:24:23,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-04 16:24:23,157 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-04 16:24:23,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-04 16:24:23,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-04 16:24:23,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-04 16:24:23,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-04 16:24:23,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-04 16:24:23,159 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-04 16:24:23,159 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-04 16:24:23,159 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-04 16:24:23,159 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-04 16:24:23,159 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-04 16:24:23,159 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-04 16:24:23,159 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> BOTH Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-05-04 16:24:23,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-04 16:24:23,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-04 16:24:23,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-04 16:24:23,390 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-05-04 16:24:23,391 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-05-04 16:24:23,392 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/prod-cons3.wvr.bpl [2024-05-04 16:24:23,392 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/prod-cons3.wvr.bpl' [2024-05-04 16:24:23,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-04 16:24:23,431 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-05-04 16:24:23,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-04 16:24:23,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-04 16:24:23,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-04 16:24:23,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 04:24:23" (1/1) ... [2024-05-04 16:24:23,476 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 04:24:23" (1/1) ... [2024-05-04 16:24:23,481 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-05-04 16:24:23,482 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-04 16:24:23,483 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-04 16:24:23,483 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-04 16:24:23,483 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-04 16:24:23,489 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 04:24:23" (1/1) ... [2024-05-04 16:24:23,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 04:24:23" (1/1) ... [2024-05-04 16:24:23,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 04:24:23" (1/1) ... [2024-05-04 16:24:23,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 04:24:23" (1/1) ... [2024-05-04 16:24:23,498 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 04:24:23" (1/1) ... [2024-05-04 16:24:23,500 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 04:24:23" (1/1) ... [2024-05-04 16:24:23,501 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 04:24:23" (1/1) ... [2024-05-04 16:24:23,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 04:24:23" (1/1) ... [2024-05-04 16:24:23,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-04 16:24:23,507 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-04 16:24:23,507 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-04 16:24:23,507 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-04 16:24:23,508 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 04:24:23" (1/1) ... [2024-05-04 16:24:23,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-04 16:24:23,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 16:24:23,558 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-04 16:24:23,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-04 16:24:23,606 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-05-04 16:24:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-04 16:24:23,606 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-04 16:24:23,606 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-05-04 16:24:23,606 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-04 16:24:23,606 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-04 16:24:23,607 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-05-04 16:24:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-04 16:24:23,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-04 16:24:23,607 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2024-05-04 16:24:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-04 16:24:23,607 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-04 16:24:23,607 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2024-05-04 16:24:23,607 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-05-04 16:24:23,608 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-05-04 16:24:23,608 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-04 16:24:23,661 INFO L241 CfgBuilder]: Building ICFG [2024-05-04 16:24:23,662 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-04 16:24:23,803 INFO L282 CfgBuilder]: Performing block encoding [2024-05-04 16:24:23,824 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-04 16:24:23,824 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-04 16:24:23,825 INFO L201 PluginConnector]: Adding new model prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 04:24:23 BoogieIcfgContainer [2024-05-04 16:24:23,826 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-04 16:24:23,829 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-04 16:24:23,829 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-04 16:24:23,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-04 16:24:23,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.05 04:24:23" (1/2) ... [2024-05-04 16:24:23,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f890e39 and model type prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 04:24:23, skipping insertion in model container [2024-05-04 16:24:23,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 04:24:23" (2/2) ... [2024-05-04 16:24:23,842 INFO L112 eAbstractionObserver]: Analyzing ICFG prod-cons3.wvr.bpl [2024-05-04 16:24:23,848 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-04 16:24:23,856 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-04 16:24:23,857 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-04 16:24:23,857 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-04 16:24:23,899 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-05-04 16:24:23,933 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-04 16:24:23,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-04 16:24:23,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 16:24:23,944 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-04 16:24:23,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-04 16:24:23,975 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-04 16:24:23,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 16:24:23,988 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-04 16:24:23,995 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;@383d7749, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=BOTH, mConComCheckerCriterion=SLEEP_SET, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-05-04 16:24:23,995 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-05-04 16:24:24,084 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-04 16:24:24,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 16:24:24,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1357080485, now seen corresponding path program 1 times [2024-05-04 16:24:24,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 16:24:24,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816793643] [2024-05-04 16:24:24,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:24,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:24,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:24,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 16:24:24,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816793643] [2024-05-04 16:24:24,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816793643] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 16:24:24,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-04 16:24:24,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-04 16:24:24,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999064612] [2024-05-04 16:24:24,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 16:24:24,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-04 16:24:24,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 16:24:24,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-04 16:24:24,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-04 16:24:24,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 16:24:24,341 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 16:24:24,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-04 16:24:24,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 16:24:24,611 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 8 treesize of output 6 [2024-05-04 16:24:24,671 INFO L85 PathProgramCache]: Analyzing trace with hash 679443726, now seen corresponding path program 1 times [2024-05-04 16:24:24,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:24,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:24,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:24,776 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-04 16:24:24,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:24,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:24,858 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-05-04 16:24:24,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-04 16:24:24,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-04 16:24:25,043 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 8 treesize of output 6 [2024-05-04 16:24:25,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1964882435, now seen corresponding path program 1 times [2024-05-04 16:24:25,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:25,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:25,194 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-04 16:24:25,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:25,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:25,282 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-04 16:24:25,373 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 8 treesize of output 6 [2024-05-04 16:24:25,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1989003458, now seen corresponding path program 2 times [2024-05-04 16:24:25,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:25,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:25,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-04 16:24:25,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:25,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:25,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-04 16:24:25,577 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 8 treesize of output 6 [2024-05-04 16:24:25,608 INFO L85 PathProgramCache]: Analyzing trace with hash 521223542, now seen corresponding path program 1 times [2024-05-04 16:24:25,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:25,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:25,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-04 16:24:25,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:25,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:25,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-05-04 16:24:25,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-04 16:24:25,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-04 16:24:25,896 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 8 treesize of output 6 [2024-05-04 16:24:25,935 INFO L85 PathProgramCache]: Analyzing trace with hash -603263642, now seen corresponding path program 3 times [2024-05-04 16:24:25,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:25,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:25,987 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-04 16:24:25,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:25,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:26,058 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-04 16:24:26,126 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 8 treesize of output 6 [2024-05-04 16:24:26,154 INFO L85 PathProgramCache]: Analyzing trace with hash 258788709, now seen corresponding path program 4 times [2024-05-04 16:24:26,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:26,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:26,179 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-05-04 16:24:26,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:26,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-05-04 16:24:26,269 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 8 treesize of output 6 [2024-05-04 16:24:26,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1989003458, now seen corresponding path program 5 times [2024-05-04 16:24:26,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:26,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:26,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-04 16:24:26,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:26,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:26,328 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-04 16:24:26,443 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 8 treesize of output 6 [2024-05-04 16:24:26,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1864794279, now seen corresponding path program 2 times [2024-05-04 16:24:26,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:26,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:26,491 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-04 16:24:26,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:26,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:26,511 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-04 16:24:26,586 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 6 treesize of output 4 [2024-05-04 16:24:26,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1507242054, now seen corresponding path program 1 times [2024-05-04 16:24:26,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:26,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:26,646 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-05-04 16:24:26,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:26,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:26,672 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-05-04 16:24:26,749 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 6 treesize of output 4 [2024-05-04 16:24:26,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1890118777, now seen corresponding path program 2 times [2024-05-04 16:24:26,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:26,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 16:24:26,784 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 16:24:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 16:24:26,890 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 6 treesize of output 4 [2024-05-04 16:24:26,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1452216748, now seen corresponding path program 3 times [2024-05-04 16:24:26,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:26,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 16:24:26,940 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 16:24:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 16:24:27,034 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 6 treesize of output 4 [2024-05-04 16:24:27,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1930196179, now seen corresponding path program 4 times [2024-05-04 16:24:27,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:27,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 16:24:27,071 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 16:24:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 16:24:27,144 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 6 treesize of output 4 [2024-05-04 16:24:27,185 INFO L85 PathProgramCache]: Analyzing trace with hash 275306246, now seen corresponding path program 5 times [2024-05-04 16:24:27,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:27,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:27,203 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-05-04 16:24:27,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:27,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:27,221 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-05-04 16:24:27,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-04 16:24:27,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-04 16:24:27,377 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 6 treesize of output 4 [2024-05-04 16:24:27,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1634953609, now seen corresponding path program 6 times [2024-05-04 16:24:27,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:27,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 16:24:27,392 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 16:24:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 16:24:27,484 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 6 treesize of output 4 [2024-05-04 16:24:27,507 INFO L85 PathProgramCache]: Analyzing trace with hash -295183137, now seen corresponding path program 7 times [2024-05-04 16:24:27,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:27,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:27,621 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-05-04 16:24:27,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:27,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:27,694 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-05-04 16:24:27,752 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 6 treesize of output 4 [2024-05-04 16:24:27,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1890118777, now seen corresponding path program 8 times [2024-05-04 16:24:27,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:27,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 16:24:27,800 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 16:24:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 16:24:28,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1909074985, now seen corresponding path program 1 times [2024-05-04 16:24:28,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:28,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:28,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:28,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:28,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:28,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:28,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-04 16:24:28,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-05-04 16:24:29,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1709541123, now seen corresponding path program 1 times [2024-05-04 16:24:29,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:29,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 16:24:29,318 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 16:24:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 16:24:29,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-04 16:24:29,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable4,SelfDestructingSolverStorable18,SelfDestructingSolverStorable3,SelfDestructingSolverStorable19,SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17,SelfDestructingSolverStorable20,SelfDestructingSolverStorable0,SelfDestructingSolverStorable29,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2024-05-04 16:24:29,479 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-04 16:24:29,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 16:24:29,480 INFO L85 PathProgramCache]: Analyzing trace with hash 4235235, now seen corresponding path program 1 times [2024-05-04 16:24:29,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 16:24:29,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60200410] [2024-05-04 16:24:29,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:29,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:29,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:29,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 16:24:29,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60200410] [2024-05-04 16:24:29,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60200410] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-04 16:24:29,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442155041] [2024-05-04 16:24:29,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:29,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 16:24:29,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 16:24:29,661 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-05-04 16:24:29,698 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-05-04 16:24:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:29,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 15 conjunts are in the unsatisfiable core [2024-05-04 16:24:29,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-04 16:24:29,883 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-05-04 16:24:29,948 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-05-04 16:24:29,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:29,997 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-04 16:24:30,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-04 16:24:30,042 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 19 treesize of output 23 [2024-05-04 16:24:30,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-04 16:24:30,096 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 20 treesize of output 24 [2024-05-04 16:24:30,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:30,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442155041] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-04 16:24:30,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-04 16:24:30,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 29 [2024-05-04 16:24:30,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456777562] [2024-05-04 16:24:30,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-04 16:24:30,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-05-04 16:24:30,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 16:24:30,268 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 6 treesize of output 4 [2024-05-04 16:24:30,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1037510152, now seen corresponding path program 1 times [2024-05-04 16:24:30,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:30,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 16:24:30,311 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 16:24:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 16:24:30,364 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 6 treesize of output 4 [2024-05-04 16:24:30,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1037510152, now seen corresponding path program 2 times [2024-05-04 16:24:30,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:30,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:30,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:30,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:30,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:30,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:30,501 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 6 treesize of output 4 [2024-05-04 16:24:30,509 INFO L85 PathProgramCache]: Analyzing trace with hash -2098043541, now seen corresponding path program 1 times [2024-05-04 16:24:30,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:30,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 16:24:30,512 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 16:24:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 16:24:30,606 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 6 treesize of output 4 [2024-05-04 16:24:30,613 INFO L85 PathProgramCache]: Analyzing trace with hash -2098043541, now seen corresponding path program 2 times [2024-05-04 16:24:30,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:30,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:30,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:30,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:30,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:30,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:30,711 INFO L85 PathProgramCache]: Analyzing trace with hash -614840230, now seen corresponding path program 1 times [2024-05-04 16:24:30,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:30,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 16:24:30,713 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 16:24:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 16:24:30,823 INFO L85 PathProgramCache]: Analyzing trace with hash -614840230, now seen corresponding path program 2 times [2024-05-04 16:24:30,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:30,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:30,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:30,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:30,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:30,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:30,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-05-04 16:24:30,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=733, Unknown=0, NotChecked=0, Total=870 [2024-05-04 16:24:30,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 16:24:30,896 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 16:24:30,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.8620689655172415) internal successors, (83), 29 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-04 16:24:30,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-04 16:24:30,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 16:24:32,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1501911083, now seen corresponding path program 1 times [2024-05-04 16:24:32,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:32,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:32,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-04 16:24:32,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:32,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-04 16:24:32,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-04 16:24:32,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-05-04 16:24:33,336 INFO L85 PathProgramCache]: Analyzing trace with hash -528620705, now seen corresponding path program 2 times [2024-05-04 16:24:33,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:33,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:33,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:33,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:33,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:33,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:33,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1505758927, now seen corresponding path program 3 times [2024-05-04 16:24:33,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:33,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:33,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:33,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:33,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:33,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:33,751 INFO L85 PathProgramCache]: Analyzing trace with hash 260042568, now seen corresponding path program 4 times [2024-05-04 16:24:33,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:33,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:33,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:33,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:33,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:33,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:33,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-04 16:24:33,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-04 16:24:33,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-04 16:24:34,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40,SelfDestructingSolverStorable41,SelfDestructingSolverStorable31,SelfDestructingSolverStorable42,SelfDestructingSolverStorable32,SelfDestructingSolverStorable43,SelfDestructingSolverStorable33,SelfDestructingSolverStorable44,SelfDestructingSolverStorable34,SelfDestructingSolverStorable45,SelfDestructingSolverStorable35,SelfDestructingSolverStorable46,SelfDestructingSolverStorable36,SelfDestructingSolverStorable47,SelfDestructingSolverStorable37,SelfDestructingSolverStorable48,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39 [2024-05-04 16:24:34,006 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-04 16:24:34,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 16:24:34,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1503257789, now seen corresponding path program 2 times [2024-05-04 16:24:34,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 16:24:34,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298551717] [2024-05-04 16:24:34,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:34,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:34,029 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:34,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 16:24:34,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298551717] [2024-05-04 16:24:34,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298551717] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-04 16:24:34,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505100270] [2024-05-04 16:24:34,031 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-04 16:24:34,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 16:24:34,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 16:24:34,033 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-04 16:24:34,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-04 16:24:34,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-04 16:24:34,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-04 16:24:34,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-04 16:24:34,068 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-04 16:24:34,090 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-04 16:24:34,090 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-04 16:24:34,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505100270] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-04 16:24:34,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-04 16:24:34,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-05-04 16:24:34,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924608674] [2024-05-04 16:24:34,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-04 16:24:34,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-04 16:24:34,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 16:24:34,139 INFO L85 PathProgramCache]: Analyzing trace with hash 52551607, now seen corresponding path program 1 times [2024-05-04 16:24:34,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:34,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:34,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:34,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:34,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:34,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:34,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1629099913, now seen corresponding path program 1 times [2024-05-04 16:24:34,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:34,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:34,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:34,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:34,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:34,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:34,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1037510152, now seen corresponding path program 3 times [2024-05-04 16:24:34,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:34,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:34,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:34,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:34,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:34,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:34,349 INFO L85 PathProgramCache]: Analyzing trace with hash -2098043541, now seen corresponding path program 3 times [2024-05-04 16:24:34,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:34,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:34,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:34,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:34,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:34,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:34,419 INFO L85 PathProgramCache]: Analyzing trace with hash -614840230, now seen corresponding path program 3 times [2024-05-04 16:24:34,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:34,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:34,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:34,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:34,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:34,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:34,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1880177844, now seen corresponding path program 1 times [2024-05-04 16:24:34,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:34,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:34,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:34,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:34,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:34,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1844029083, now seen corresponding path program 1 times [2024-05-04 16:24:34,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:34,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:34,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:34,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:34,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:34,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:34,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1330326830, now seen corresponding path program 1 times [2024-05-04 16:24:34,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:34,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:34,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-04 16:24:34,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:34,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:34,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-04 16:24:34,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1709541123, now seen corresponding path program 2 times [2024-05-04 16:24:34,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:34,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:34,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-04 16:24:34,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:34,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:34,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-04 16:24:34,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1709541123, now seen corresponding path program 3 times [2024-05-04 16:24:34,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:34,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 16:24:34,849 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-04 16:24:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-04 16:24:34,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1456167153, now seen corresponding path program 1 times [2024-05-04 16:24:34,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:34,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:35,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:35,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:35,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:35,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:35,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1456167153, now seen corresponding path program 2 times [2024-05-04 16:24:35,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:35,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:35,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:35,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:35,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:35,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:35,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2103458606, now seen corresponding path program 1 times [2024-05-04 16:24:35,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:35,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:35,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:35,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:35,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:35,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:35,460 INFO L85 PathProgramCache]: Analyzing trace with hash 2103458606, now seen corresponding path program 2 times [2024-05-04 16:24:35,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:35,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:35,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:35,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:35,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:35,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:35,608 INFO L85 PathProgramCache]: Analyzing trace with hash 782707441, now seen corresponding path program 1 times [2024-05-04 16:24:35,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:35,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:35,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:35,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:35,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:35,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:35,745 INFO L85 PathProgramCache]: Analyzing trace with hash 782707441, now seen corresponding path program 2 times [2024-05-04 16:24:35,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:35,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:35,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:35,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:35,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:35,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:35,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:35,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1505872986, now seen corresponding path program 5 times [2024-05-04 16:24:35,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:35,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:35,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:35,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:35,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:36,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:36,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1505872986, now seen corresponding path program 6 times [2024-05-04 16:24:36,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:36,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:36,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:36,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:36,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:36,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:36,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-04 16:24:36,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-05-04 16:24:36,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 16:24:36,184 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 16:24:36,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-04 16:24:36,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-04 16:24:36,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-04 16:24:36,184 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 16:24:37,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-04 16:24:37,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-04 16:24:37,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-04 16:24:37,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-05-04 16:24:37,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,SelfDestructingSolverStorable71,SelfDestructingSolverStorable50,SelfDestructingSolverStorable72,SelfDestructingSolverStorable51,SelfDestructingSolverStorable73,SelfDestructingSolverStorable52,SelfDestructingSolverStorable74,SelfDestructingSolverStorable53,SelfDestructingSolverStorable75,SelfDestructingSolverStorable54,SelfDestructingSolverStorable76,SelfDestructingSolverStorable55,SelfDestructingSolverStorable77,SelfDestructingSolverStorable56,SelfDestructingSolverStorable78,SelfDestructingSolverStorable57,SelfDestructingSolverStorable79,SelfDestructingSolverStorable58,SelfDestructingSolverStorable59,SelfDestructingSolverStorable80,SelfDestructingSolverStorable81,SelfDestructingSolverStorable60,SelfDestructingSolverStorable82,SelfDestructingSolverStorable61,SelfDestructingSolverStorable83,SelfDestructingSolverStorable62,SelfDestructingSolverStorable84,SelfDestructingSolverStorable63,SelfDestructingSolverStorable64,SelfDestructingSolverStorable65,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66,SelfDestructingSolverStorable67,SelfDestructingSolverStorable68,SelfDestructingSolverStorable69,SelfDestructingSolverStorable49 [2024-05-04 16:24:37,308 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-04 16:24:37,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 16:24:37,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1899569813, now seen corresponding path program 3 times [2024-05-04 16:24:37,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 16:24:37,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980197059] [2024-05-04 16:24:37,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:24:37,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:24:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:24:37,699 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-04 16:24:37,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 16:24:37,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980197059] [2024-05-04 16:24:37,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980197059] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-04 16:24:37,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424773989] [2024-05-04 16:24:37,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-04 16:24:37,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 16:24:37,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 16:24:37,716 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-04 16:24:37,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-04 16:24:37,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-05-04 16:24:37,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-04 16:24:37,751 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 31 conjunts are in the unsatisfiable core [2024-05-04 16:24:37,752 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-04 16:24:38,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-04 16:24:38,218 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 33 treesize of output 17 [2024-05-04 16:24:38,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-05-04 16:24:38,337 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 16:24:38,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-05-04 16:24:38,400 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:38,400 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-04 16:24:38,803 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 16:24:38,803 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 16:24:38,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-04 16:24:38,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 55 [2024-05-04 16:24:39,196 INFO L349 Elim1Store]: treesize reduction 10, result has 77.8 percent of original size [2024-05-04 16:24:39,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 75 [2024-05-04 16:24:39,634 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:24:39,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424773989] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-04 16:24:39,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-04 16:24:39,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 49 [2024-05-04 16:24:39,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764832343] [2024-05-04 16:24:39,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-04 16:24:39,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-05-04 16:24:39,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 16:24:39,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-05-04 16:24:39,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=2017, Unknown=0, NotChecked=0, Total=2352 [2024-05-04 16:24:39,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 16:24:39,646 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 16:24:39,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.061224489795918) internal successors, (101), 49 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-04 16:24:39,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-04 16:24:39,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-04 16:24:39,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-04 16:24:39,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 16:25:13,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-04 16:25:13,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-05-04 16:25:13,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-04 16:25:13,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 419 states. [2024-05-04 16:25:13,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-04 16:25:13,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 16:25:13,596 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-04 16:25:13,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 16:25:13,596 INFO L85 PathProgramCache]: Analyzing trace with hash 618220139, now seen corresponding path program 4 times [2024-05-04 16:25:13,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 16:25:13,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182085857] [2024-05-04 16:25:13,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:25:13,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:25:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:25:14,724 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 5 proven. 117 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-05-04 16:25:14,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 16:25:14,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182085857] [2024-05-04 16:25:14,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182085857] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-04 16:25:14,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338909938] [2024-05-04 16:25:14,725 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-04 16:25:14,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 16:25:14,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 16:25:14,727 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-04 16:25:14,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-04 16:25:14,803 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-04 16:25:14,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-04 16:25:14,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 74 conjunts are in the unsatisfiable core [2024-05-04 16:25:14,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-04 16:25:16,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-04 16:25:16,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 89 treesize of output 53 [2024-05-04 16:25:17,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-04 16:25:17,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 26 [2024-05-04 16:25:17,228 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 5 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:25:17,228 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-04 16:25:19,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-04 16:25:19,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 89 treesize of output 293 [2024-05-04 16:25:23,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-04 16:25:23,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 68 treesize of output 272 [2024-05-04 16:25:25,865 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 26 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:25:25,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338909938] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-04 16:25:25,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-04 16:25:25,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 38, 38] total 97 [2024-05-04 16:25:25,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315441154] [2024-05-04 16:25:25,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-04 16:25:25,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2024-05-04 16:25:25,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 16:25:25,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2024-05-04 16:25:25,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=927, Invalid=8385, Unknown=0, NotChecked=0, Total=9312 [2024-05-04 16:25:25,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 16:25:25,993 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 16:25:25,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 2.0927835051546393) internal successors, (203), 97 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-04 16:25:25,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-04 16:25:25,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-05-04 16:25:25,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-04 16:25:25,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 419 states. [2024-05-04 16:25:25,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-04 16:28:46,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-04 16:28:46,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-05-04 16:28:46,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-04 16:28:46,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 419 states. [2024-05-04 16:28:46,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1039 states. [2024-05-04 16:28:46,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-05-04 16:28:46,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable86 [2024-05-04 16:28:46,722 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-05-04 16:28:46,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-04 16:28:46,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1001592993, now seen corresponding path program 5 times [2024-05-04 16:28:46,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-04 16:28:46,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990584712] [2024-05-04 16:28:46,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-04 16:28:46,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-04 16:28:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-04 16:28:48,457 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 7 proven. 166 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-05-04 16:28:48,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-04 16:28:48,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990584712] [2024-05-04 16:28:48,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990584712] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-04 16:28:48,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713228146] [2024-05-04 16:28:48,458 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-04 16:28:48,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 16:28:48,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-04 16:28:48,467 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-04 16:28:48,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-05-04 16:28:48,544 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-05-04 16:28:48,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-04 16:28:48,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 105 conjunts are in the unsatisfiable core [2024-05-04 16:28:48,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-04 16:28:52,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-04 16:28:52,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 103 treesize of output 59 [2024-05-04 16:28:53,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-04 16:28:53,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 86 treesize of output 34 [2024-05-04 16:28:53,705 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 7 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:28:53,705 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-04 16:28:58,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-04 16:28:58,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 125 treesize of output 549 [2024-05-04 16:29:33,920 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 16:29:33,920 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 16:29:33,921 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 16:29:33,922 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 16:29:33,922 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 16:29:33,922 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 16:29:33,923 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 16:29:33,923 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 16:29:33,924 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 16:29:33,925 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 16:29:33,926 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 16:29:33,927 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 16:29:33,938 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 16:29:33,939 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 16:29:33,939 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 16:29:33,940 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 16:29:33,942 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 16:29:33,943 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 16:29:33,948 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 16:29:33,948 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 16:29:33,948 INFO L173 IndexEqualityManager]: detected equality via solver [2024-05-04 16:29:34,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-04 16:29:34,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 63 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 94 treesize of output 308 [2024-05-04 16:29:35,032 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 28 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-04 16:29:35,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713228146] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-04 16:29:35,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-04 16:29:35,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 49, 49] total 119 [2024-05-04 16:29:35,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020454223] [2024-05-04 16:29:35,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-04 16:29:35,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 119 states [2024-05-04 16:29:35,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-04 16:29:35,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2024-05-04 16:29:35,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=12522, Unknown=0, NotChecked=0, Total=14042 [2024-05-04 16:29:35,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-04 16:29:35,381 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-04 16:29:35,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 119 states, 119 states have (on average 1.8487394957983194) internal successors, (220), 119 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-04 16:29:35,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-04 16:29:35,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-05-04 16:29:35,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-04 16:29:35,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 419 states. [2024-05-04 16:29:35,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 1039 states. [2024-05-04 16:29:35,382 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Received shutdown request... [2024-05-04 16:38:06,353 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-04 16:38:06,354 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-04 16:38:06,354 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-04 16:38:06,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-05-04 16:38:06,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-04 16:38:06,561 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-21-15-2-1 term,while SimplifyDDA2 was simplifying 13 xjuncts wrt. a ∧-20-15-2-1 context. [2024-05-04 16:38:06,563 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (4 of 5 remaining) [2024-05-04 16:38:06,564 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-05-04 16:38:06,564 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-05-04 16:38:06,564 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-05-04 16:38:06,565 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-05-04 16:38:06,572 INFO L448 BasicCegarLoop]: Path program histogram: [8, 6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-04 16:38:06,582 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-04 16:38:06,582 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-05-04 16:38:06,587 INFO L201 PluginConnector]: Adding new model prod-cons3.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 04:38:06 BasicIcfg [2024-05-04 16:38:06,587 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-04 16:38:06,588 INFO L158 Benchmark]: Toolchain (without parser) took 823156.90ms. Allocated memory was 316.7MB in the beginning and 4.1GB in the end (delta: 3.8GB). Free memory was 290.0MB in the beginning and 3.2GB in the end (delta: -2.9GB). Peak memory consumption was 865.6MB. Max. memory is 8.0GB. [2024-05-04 16:38:06,588 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.09ms. Allocated memory is still 160.4MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-04 16:38:06,588 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.37ms. Allocated memory is still 316.7MB. Free memory was 290.0MB in the beginning and 289.3MB in the end (delta: 647.6kB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-04 16:38:06,588 INFO L158 Benchmark]: Boogie Preprocessor took 22.25ms. Allocated memory is still 316.7MB. Free memory was 289.3MB in the beginning and 288.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-04 16:38:06,588 INFO L158 Benchmark]: RCFGBuilder took 318.97ms. Allocated memory is still 316.7MB. Free memory was 288.0MB in the beginning and 276.1MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-04 16:38:06,588 INFO L158 Benchmark]: TraceAbstraction took 822758.16ms. Allocated memory was 316.7MB in the beginning and 4.1GB in the end (delta: 3.8GB). Free memory was 275.0MB in the beginning and 3.2GB in the end (delta: -3.0GB). Peak memory consumption was 851.9MB. Max. memory is 8.0GB. [2024-05-04 16:38:06,589 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.09ms. Allocated memory is still 160.4MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.37ms. Allocated memory is still 316.7MB. Free memory was 290.0MB in the beginning and 289.3MB in the end (delta: 647.6kB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.25ms. Allocated memory is still 316.7MB. Free memory was 289.3MB in the beginning and 288.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 318.97ms. Allocated memory is still 316.7MB. Free memory was 288.0MB in the beginning and 276.1MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 822758.16ms. Allocated memory was 316.7MB in the beginning and 4.1GB in the end (delta: 3.8GB). Free memory was 275.0MB in the beginning and 3.2GB in the end (delta: -3.0GB). Peak memory consumption was 851.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2060121, independent: 1914942, independent conditional: 1914848, independent unconditional: 94, dependent: 145179, dependent conditional: 145173, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1945456, independent: 1914942, independent conditional: 1914848, independent unconditional: 94, dependent: 30514, dependent conditional: 30508, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1945456, independent: 1914942, independent conditional: 1914848, independent unconditional: 94, dependent: 30514, dependent conditional: 30508, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1945456, independent: 1914942, independent conditional: 1914848, independent unconditional: 94, dependent: 30514, dependent conditional: 30508, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2068983, independent: 1914942, independent conditional: 876952, independent unconditional: 1037990, dependent: 154041, dependent conditional: 127626, dependent unconditional: 26415, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2068983, independent: 1914942, independent conditional: 826396, independent unconditional: 1088546, dependent: 154041, dependent conditional: 57957, dependent unconditional: 96084, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2068983, independent: 1914942, independent conditional: 826396, independent unconditional: 1088546, dependent: 154041, dependent conditional: 57957, dependent unconditional: 96084, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1516, independent: 685, independent conditional: 489, independent unconditional: 196, dependent: 831, dependent conditional: 819, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1516, independent: 231, independent conditional: 0, independent unconditional: 231, dependent: 1285, dependent conditional: 0, dependent unconditional: 1285, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1285, independent: 454, independent conditional: 452, independent unconditional: 2, dependent: 831, dependent conditional: 819, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1285, independent: 454, independent conditional: 452, independent unconditional: 2, dependent: 831, dependent conditional: 819, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3268, independent: 881, independent conditional: 878, independent unconditional: 3, dependent: 2388, dependent conditional: 2332, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2068983, independent: 1914257, independent conditional: 825907, independent unconditional: 1088350, dependent: 153210, dependent conditional: 57138, dependent unconditional: 96072, unknown: 1516, unknown conditional: 1308, unknown unconditional: 208] , Statistics on independence cache: Total cache size (in pairs): 1516, Positive cache size: 685, Positive conditional cache size: 489, Positive unconditional cache size: 196, Negative cache size: 831, Negative conditional cache size: 819, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 120225, Maximal queried relation: 8, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2068983, independent: 1914942, independent conditional: 876952, independent unconditional: 1037990, dependent: 154041, dependent conditional: 127626, dependent unconditional: 26415, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2068983, independent: 1914942, independent conditional: 826396, independent unconditional: 1088546, dependent: 154041, dependent conditional: 57957, dependent unconditional: 96084, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2068983, independent: 1914942, independent conditional: 826396, independent unconditional: 1088546, dependent: 154041, dependent conditional: 57957, dependent unconditional: 96084, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1516, independent: 685, independent conditional: 489, independent unconditional: 196, dependent: 831, dependent conditional: 819, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1516, independent: 231, independent conditional: 0, independent unconditional: 231, dependent: 1285, dependent conditional: 0, dependent unconditional: 1285, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1285, independent: 454, independent conditional: 452, independent unconditional: 2, dependent: 831, dependent conditional: 819, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1285, independent: 454, independent conditional: 452, independent unconditional: 2, dependent: 831, dependent conditional: 819, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3268, independent: 881, independent conditional: 878, independent unconditional: 3, dependent: 2388, dependent conditional: 2332, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2068983, independent: 1914257, independent conditional: 825907, independent unconditional: 1088350, dependent: 153210, dependent conditional: 57138, dependent unconditional: 96072, unknown: 1516, unknown conditional: 1308, unknown unconditional: 208] , Statistics on independence cache: Total cache size (in pairs): 1516, Positive cache size: 685, Positive conditional cache size: 489, Positive unconditional cache size: 196, Negative cache size: 831, Negative conditional cache size: 819, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 120225 ], Independence queries for same thread: 114665 - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-21-15-2-1 term,while SimplifyDDA2 was simplifying 13 xjuncts wrt. a ∧-20-15-2-1 context. - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-21-15-2-1 term,while SimplifyDDA2 was simplifying 13 xjuncts wrt. a ∧-20-15-2-1 context. - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-21-15-2-1 term,while SimplifyDDA2 was simplifying 13 xjuncts wrt. a ∧-20-15-2-1 context. - TimeoutResultAtElement [Line: 81]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-21-15-2-1 term,while SimplifyDDA2 was simplifying 13 xjuncts wrt. a ∧-20-15-2-1 context. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-21-15-2-1 term,while SimplifyDDA2 was simplifying 13 xjuncts wrt. a ∧-20-15-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 61 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 822.6s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 8, EmptinessCheckTime: 754.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 2944, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 63.4s InterpolantComputationTime, 604 NumberOfCodeBlocks, 604 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 842 ConstructedInterpolants, 16 QuantifiedInterpolants, 25331 SizeOfPredicates, 98 NumberOfNonLiveVariables, 796 ConjunctsInSsa, 229 ConjunctsInUnsatCore, 15 InterpolantComputations, 2 PerfectInterpolantSequences, 189/1220 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConditionalCommutativityCheckTime: 10.9s, ConditionalCommutativityIAIntegrations: 12, ConditionalCommutativityDFSRestarts: 5, ConditionalCommutativityConditionCalculations: 67, ConditionalCommutativityTraceChecks: 46, ConditionalCommutativityImperfectProofs: 19 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown