/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 10 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/buffer-mult-alt.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-faa7b7a-m [2024-04-27 11:42:26,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-27 11:42:26,099 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-27 11:42:26,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-27 11:42:26,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-27 11:42:26,133 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-27 11:42:26,133 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-27 11:42:26,134 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-27 11:42:26,134 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-27 11:42:26,138 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-27 11:42:26,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-27 11:42:26,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-27 11:42:26,139 INFO L153 SettingsManager]: * Use SBE=true [2024-04-27 11:42:26,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-27 11:42:26,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-27 11:42:26,141 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-27 11:42:26,141 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-27 11:42:26,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-27 11:42:26,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-27 11:42:26,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-27 11:42:26,142 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-27 11:42:26,142 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-27 11:42:26,143 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-27 11:42:26,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-27 11:42:26,144 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-27 11:42:26,144 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-27 11:42:26,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-27 11:42:26,145 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-27 11:42:26,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-27 11:42:26,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-27 11:42:26,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-27 11:42:26,147 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-27 11:42:26,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-27 11:42:26,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-27 11:42:26,147 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-27 11:42:26,147 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-27 11:42:26,147 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-27 11:42:26,148 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-27 11:42:26,148 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-27 11:42:26,148 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 10 [2024-04-27 11:42:26,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-27 11:42:26,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-27 11:42:26,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-27 11:42:26,411 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-04-27 11:42:26,412 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-04-27 11:42:26,413 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/buffer-mult-alt.wvr.bpl [2024-04-27 11:42:26,413 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/buffer-mult-alt.wvr.bpl' [2024-04-27 11:42:26,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-27 11:42:26,469 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-04-27 11:42:26,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-27 11:42:26,473 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-27 11:42:26,473 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-27 11:42:26,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 11:42:26" (1/1) ... [2024-04-27 11:42:26,492 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 11:42:26" (1/1) ... [2024-04-27 11:42:26,498 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-04-27 11:42:26,499 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-27 11:42:26,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-27 11:42:26,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-27 11:42:26,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-27 11:42:26,513 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 11:42:26" (1/1) ... [2024-04-27 11:42:26,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 11:42:26" (1/1) ... [2024-04-27 11:42:26,516 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 11:42:26" (1/1) ... [2024-04-27 11:42:26,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 11:42:26" (1/1) ... [2024-04-27 11:42:26,524 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 11:42:26" (1/1) ... [2024-04-27 11:42:26,528 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 11:42:26" (1/1) ... [2024-04-27 11:42:26,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 11:42:26" (1/1) ... [2024-04-27 11:42:26,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 11:42:26" (1/1) ... [2024-04-27 11:42:26,531 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-27 11:42:26,531 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-27 11:42:26,532 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-27 11:42:26,532 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-27 11:42:26,535 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 11:42:26" (1/1) ... [2024-04-27 11:42:26,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-27 11:42:26,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-27 11:42:26,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-04-27 11:42:26,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-04-27 11:42:26,625 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2024-04-27 11:42:26,625 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-04-27 11:42:26,625 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-04-27 11:42:26,625 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2024-04-27 11:42:26,625 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-04-27 11:42:26,626 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-04-27 11:42:26,626 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-04-27 11:42:26,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-27 11:42:26,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-27 11:42:26,626 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2024-04-27 11:42:26,626 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-04-27 11:42:26,626 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-04-27 11:42:26,627 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2024-04-27 11:42:26,627 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-04-27 11:42:26,627 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-04-27 11:42:26,628 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-27 11:42:26,682 INFO L241 CfgBuilder]: Building ICFG [2024-04-27 11:42:26,685 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-27 11:42:26,832 INFO L282 CfgBuilder]: Performing block encoding [2024-04-27 11:42:26,865 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-27 11:42:26,865 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-04-27 11:42:26,867 INFO L201 PluginConnector]: Adding new model buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:42:26 BoogieIcfgContainer [2024-04-27 11:42:26,867 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-27 11:42:26,877 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-27 11:42:26,877 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-27 11:42:26,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-27 11:42:26,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.04 11:42:26" (1/2) ... [2024-04-27 11:42:26,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20aa2f4d and model type buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:42:26, skipping insertion in model container [2024-04-27 11:42:26,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:42:26" (2/2) ... [2024-04-27 11:42:26,884 INFO L112 eAbstractionObserver]: Analyzing ICFG buffer-mult-alt.wvr.bpl [2024-04-27 11:42:26,891 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-27 11:42:26,899 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-27 11:42:26,900 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-27 11:42:26,900 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-27 11:42:26,957 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-04-27 11:42:27,005 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-27 11:42:27,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-27 11:42:27,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-27 11:42:27,007 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-27 11:42:27,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-04-27 11:42:27,045 INFO L187 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-27 11:42:27,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-27 11:42:27,068 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-27 11:42:27,077 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;@1ef6c150, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=10, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-04-27 11:42:27,077 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-04-27 11:42:27,147 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-04-27 11:42:27,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-27 11:42:27,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1916109299, now seen corresponding path program 1 times [2024-04-27 11:42:27,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-27 11:42:27,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358033963] [2024-04-27 11:42:27,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 11:42:27,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 11:42:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 11:42:27,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:42:27,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-27 11:42:27,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358033963] [2024-04-27 11:42:27,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358033963] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-27 11:42:27,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-27 11:42:27,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-04-27 11:42:27,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831109064] [2024-04-27 11:42:27,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-27 11:42:27,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-04-27 11:42:27,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-27 11:42:27,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-04-27 11:42:27,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-04-27 11:42:27,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-27 11:42:27,377 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-27 11:42:27,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-27 11:42:27,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-27 11:42:27,592 INFO L85 PathProgramCache]: Analyzing trace with hash 174384018, now seen corresponding path program 1 times [2024-04-27 11:42:27,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 11:42:27,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 11:42:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 11:42:27,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:42:27,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 11:42:27,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 11:42:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 11:42:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:42:27,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-27 11:42:27,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-04-27 11:42:27,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-27 11:42:27,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,SelfDestructingSolverStorable0 [2024-04-27 11:42:27,885 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-04-27 11:42:27,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-27 11:42:27,885 INFO L85 PathProgramCache]: Analyzing trace with hash -736990859, now seen corresponding path program 1 times [2024-04-27 11:42:27,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-27 11:42:27,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330372950] [2024-04-27 11:42:27,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 11:42:27,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 11:42:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 11:42:28,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:42:28,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-27 11:42:28,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330372950] [2024-04-27 11:42:28,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330372950] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-27 11:42:28,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912104877] [2024-04-27 11:42:28,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 11:42:28,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-27 11:42:28,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-27 11:42:28,108 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-27 11:42:28,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-04-27 11:42:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 11:42:28,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjunts are in the unsatisfiable core [2024-04-27 11:42:28,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-27 11:42:28,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-04-27 11:42:28,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:42:28,333 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-27 11:42:28,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 11:42:28,382 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 13 treesize of output 17 [2024-04-27 11:42:28,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:42:28,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912104877] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-27 11:42:28,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-27 11:42:28,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-04-27 11:42:28,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666256387] [2024-04-27 11:42:28,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-27 11:42:28,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-04-27 11:42:28,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-27 11:42:28,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-04-27 11:42:28,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-04-27 11:42:28,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-27 11:42:28,434 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-27 11:42:28,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-27 11:42:28,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-27 11:42:28,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-27 11:42:28,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-27 11:42:28,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-27 11:42:28,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-04-27 11:42:28,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-27 11:42:28,785 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-04-27 11:42:28,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-27 11:42:28,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1772842025, now seen corresponding path program 2 times [2024-04-27 11:42:28,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-27 11:42:28,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594300671] [2024-04-27 11:42:28,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 11:42:28,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 11:42:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 11:42:28,863 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:42:28,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-27 11:42:28,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594300671] [2024-04-27 11:42:28,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594300671] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-27 11:42:28,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625502044] [2024-04-27 11:42:28,864 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-27 11:42:28,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-27 11:42:28,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-27 11:42:28,866 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-04-27 11:42:28,920 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-04-27 11:42:28,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-27 11:42:28,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-27 11:42:28,948 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2024-04-27 11:42:28,954 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-27 11:42:28,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-04-27 11:42:28,996 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-04-27 11:42:28,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625502044] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-27 11:42:28,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-04-27 11:42:28,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2024-04-27 11:42:28,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149492228] [2024-04-27 11:42:28,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-27 11:42:28,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-27 11:42:28,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-27 11:42:28,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-27 11:42:28,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-04-27 11:42:28,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-27 11:42:28,998 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-27 11:42:28,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-27 11:42:28,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-27 11:42:28,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-27 11:42:28,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-27 11:42:29,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-27 11:42:29,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-27 11:42:29,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:29,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-04-27 11:42:29,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-27 11:42:29,324 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-04-27 11:42:29,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-27 11:42:29,325 INFO L85 PathProgramCache]: Analyzing trace with hash -663657101, now seen corresponding path program 3 times [2024-04-27 11:42:29,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-27 11:42:29,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411563190] [2024-04-27 11:42:29,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 11:42:29,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 11:42:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 11:42:29,532 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:42:29,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-27 11:42:29,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411563190] [2024-04-27 11:42:29,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411563190] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-27 11:42:29,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496845528] [2024-04-27 11:42:29,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-04-27 11:42:29,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-27 11:42:29,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-27 11:42:29,534 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-04-27 11:42:29,544 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-04-27 11:42:29,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-04-27 11:42:29,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-27 11:42:29,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 16 conjunts are in the unsatisfiable core [2024-04-27 11:42:29,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-27 11:42:29,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 11:42:29,811 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2024-04-27 11:42:29,923 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:42:29,924 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-27 11:42:30,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 11:42:30,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 31 [2024-04-27 11:42:30,168 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:42:30,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496845528] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-27 11:42:30,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-27 11:42:30,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 17 [2024-04-27 11:42:30,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163620940] [2024-04-27 11:42:30,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-27 11:42:30,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-04-27 11:42:30,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-27 11:42:30,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-04-27 11:42:30,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-04-27 11:42:30,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-27 11:42:30,171 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-27 11:42:30,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.5) internal successors, (81), 17 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-27 11:42:30,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-27 11:42:30,171 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-27 11:42:30,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:30,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-27 11:42:30,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-04-27 11:42:31,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1267142032, now seen corresponding path program 1 times [2024-04-27 11:42:31,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 11:42:31,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 11:42:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 11:42:31,068 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 11:42:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 11:42:31,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-27 11:42:31,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-27 11:42:31,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:31,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-04-27 11:42:31,322 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-04-27 11:42:31,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-27 11:42:31,520 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-04-27 11:42:31,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-27 11:42:31,521 INFO L85 PathProgramCache]: Analyzing trace with hash -390336109, now seen corresponding path program 1 times [2024-04-27 11:42:31,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-27 11:42:31,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305873581] [2024-04-27 11:42:31,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 11:42:31,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 11:42:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 11:42:31,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:42:31,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-27 11:42:31,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305873581] [2024-04-27 11:42:31,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305873581] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-27 11:42:31,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-27 11:42:31,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-27 11:42:31,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547162740] [2024-04-27 11:42:31,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-27 11:42:31,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-27 11:42:31,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-27 11:42:31,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-27 11:42:31,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-04-27 11:42:31,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-27 11:42:31,557 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-27 11:42:31,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-27 11:42:31,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-27 11:42:31,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-27 11:42:31,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:31,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-04-27 11:42:31,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-27 11:42:32,031 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-04-27 11:42:32,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1836058486, now seen corresponding path program 1 times [2024-04-27 11:42:32,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 11:42:32,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 11:42:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 11:42:32,223 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 11:42:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 11:42:32,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-27 11:42:32,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-27 11:42:32,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:32,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-27 11:42:32,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:32,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7 [2024-04-27 11:42:32,638 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-04-27 11:42:32,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-27 11:42:32,638 INFO L85 PathProgramCache]: Analyzing trace with hash 222355548, now seen corresponding path program 1 times [2024-04-27 11:42:32,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-27 11:42:32,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381616740] [2024-04-27 11:42:32,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 11:42:32,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 11:42:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 11:42:32,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:42:32,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-27 11:42:32,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381616740] [2024-04-27 11:42:32,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381616740] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-27 11:42:32,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107268772] [2024-04-27 11:42:32,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 11:42:32,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-27 11:42:32,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-27 11:42:32,682 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-04-27 11:42:32,704 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-04-27 11:42:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 11:42:32,724 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjunts are in the unsatisfiable core [2024-04-27 11:42:32,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-27 11:42:32,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:42:32,810 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-27 11:42:32,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:42:32,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107268772] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-27 11:42:32,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-27 11:42:32,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-04-27 11:42:32,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630882753] [2024-04-27 11:42:32,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-27 11:42:32,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-04-27 11:42:32,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-27 11:42:32,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-04-27 11:42:32,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-04-27 11:42:32,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-27 11:42:32,871 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-27 11:42:32,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-27 11:42:32,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-27 11:42:32,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-27 11:42:32,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:32,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-27 11:42:32,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:32,872 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-27 11:42:33,464 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 12 treesize of output 8 [2024-04-27 11:42:33,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1836058486, now seen corresponding path program 2 times [2024-04-27 11:42:33,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 11:42:33,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 11:42:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 11:42:33,587 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 11:42:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 11:42:33,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-27 11:42:33,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-27 11:42:33,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:33,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-27 11:42:33,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:33,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-27 11:42:34,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-04-27 11:42:34,199 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,SelfDestructingSolverStorable10,SelfDestructingSolverStorable9 [2024-04-27 11:42:34,199 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-27 11:42:34,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-27 11:42:34,200 INFO L85 PathProgramCache]: Analyzing trace with hash -2103532372, now seen corresponding path program 2 times [2024-04-27 11:42:34,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-27 11:42:34,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995779700] [2024-04-27 11:42:34,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 11:42:34,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 11:42:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 11:42:34,445 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:42:34,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-27 11:42:34,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995779700] [2024-04-27 11:42:34,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995779700] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-27 11:42:34,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028442586] [2024-04-27 11:42:34,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-27 11:42:34,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-27 11:42:34,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-27 11:42:34,447 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-04-27 11:42:34,463 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-04-27 11:42:34,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-27 11:42:34,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-27 11:42:34,488 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 21 conjunts are in the unsatisfiable core [2024-04-27 11:42:34,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-27 11:42:34,662 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 19 treesize of output 15 [2024-04-27 11:42:34,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 11:42:34,771 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 25 treesize of output 13 [2024-04-27 11:42:34,783 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:42:34,783 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-27 11:42:34,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 11:42:34,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2024-04-27 11:42:34,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 11:42:34,955 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 31 treesize of output 55 [2024-04-27 11:42:35,049 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:42:35,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028442586] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-27 11:42:35,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-27 11:42:35,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-04-27 11:42:35,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118226335] [2024-04-27 11:42:35,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-27 11:42:35,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-04-27 11:42:35,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-27 11:42:35,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-04-27 11:42:35,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2024-04-27 11:42:35,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-27 11:42:35,051 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-27 11:42:35,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 18 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-27 11:42:35,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-27 11:42:35,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-27 11:42:35,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:35,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-27 11:42:35,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:35,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-27 11:42:35,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-27 11:42:35,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-04-27 11:42:35,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1836058486, now seen corresponding path program 3 times [2024-04-27 11:42:35,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 11:42:35,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 11:42:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 11:42:35,809 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 11:42:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 11:42:36,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-27 11:42:36,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-27 11:42:36,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:36,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-27 11:42:36,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:36,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-27 11:42:36,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-27 11:42:36,360 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-04-27 11:42:36,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12 [2024-04-27 11:42:36,561 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-27 11:42:36,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-27 11:42:36,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1831638172, now seen corresponding path program 3 times [2024-04-27 11:42:36,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-27 11:42:36,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282105412] [2024-04-27 11:42:36,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 11:42:36,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 11:42:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 11:42:36,834 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:42:36,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-27 11:42:36,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282105412] [2024-04-27 11:42:36,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282105412] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-27 11:42:36,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923955119] [2024-04-27 11:42:36,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-04-27 11:42:36,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-27 11:42:36,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-27 11:42:36,837 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-27 11:42:36,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-04-27 11:42:36,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-04-27 11:42:36,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-27 11:42:36,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 28 conjunts are in the unsatisfiable core [2024-04-27 11:42:36,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-27 11:42:37,067 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 19 treesize of output 15 [2024-04-27 11:42:37,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:42:37,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 11:42:37,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 89 [2024-04-27 11:42:37,917 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:42:37,917 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-27 11:42:38,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 11:42:38,247 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 26 treesize of output 30 [2024-04-27 11:42:38,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 11:42:38,325 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 43 treesize of output 51 [2024-04-27 11:42:38,514 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:42:38,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923955119] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-27 11:42:38,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-27 11:42:38,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 29 [2024-04-27 11:42:38,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766801484] [2024-04-27 11:42:38,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-27 11:42:38,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-04-27 11:42:38,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-27 11:42:38,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-04-27 11:42:38,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2024-04-27 11:42:38,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-27 11:42:38,523 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-27 11:42:38,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.7) internal successors, (111), 29 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-27 11:42:38,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-27 11:42:38,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-27 11:42:38,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:38,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-27 11:42:38,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:38,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-27 11:42:38,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-27 11:42:38,524 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-27 11:42:40,252 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 12 treesize of output 8 [2024-04-27 11:42:40,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1836058486, now seen corresponding path program 4 times [2024-04-27 11:42:40,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 11:42:40,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 11:42:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 11:42:40,375 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 11:42:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 11:42:42,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-27 11:42:42,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-27 11:42:42,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:42,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-27 11:42:42,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:42,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-27 11:42:42,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-27 11:42:42,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-04-27 11:42:42,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-04-27 11:42:42,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14 [2024-04-27 11:42:42,688 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-27 11:42:42,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-27 11:42:42,689 INFO L85 PathProgramCache]: Analyzing trace with hash 623262474, now seen corresponding path program 4 times [2024-04-27 11:42:42,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-27 11:42:42,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971302587] [2024-04-27 11:42:42,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 11:42:42,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 11:42:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 11:42:42,760 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:42:42,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-27 11:42:42,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971302587] [2024-04-27 11:42:42,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971302587] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-27 11:42:42,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380708518] [2024-04-27 11:42:42,761 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-04-27 11:42:42,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-27 11:42:42,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-27 11:42:42,762 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-27 11:42:42,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-04-27 11:42:42,804 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-04-27 11:42:42,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-27 11:42:42,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjunts are in the unsatisfiable core [2024-04-27 11:42:42,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-27 11:42:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-04-27 11:42:42,835 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-04-27 11:42:42,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380708518] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-27 11:42:42,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-04-27 11:42:42,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2024-04-27 11:42:42,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006922398] [2024-04-27 11:42:42,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-27 11:42:42,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-04-27 11:42:42,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-27 11:42:42,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-04-27 11:42:42,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-04-27 11:42:42,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-27 11:42:42,839 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-27 11:42:42,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-27 11:42:42,839 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-27 11:42:42,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-27 11:42:42,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:42,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-27 11:42:42,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:42,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-27 11:42:42,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-27 11:42:42,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-04-27 11:42:42,840 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-27 11:42:43,202 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-04-27 11:42:43,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1836058486, now seen corresponding path program 5 times [2024-04-27 11:42:43,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 11:42:43,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 11:42:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 11:42:43,381 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 11:42:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 11:42:44,353 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 11:42:44,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:42:44,355 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 25 treesize of output 13 [2024-04-27 11:42:44,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-04-27 11:42:44,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1013706749, now seen corresponding path program 1 times [2024-04-27 11:42:44,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 11:42:44,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 11:42:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 11:42:44,612 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-27 11:42:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-27 11:42:44,805 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 11:42:44,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:42:44,806 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 30 treesize of output 16 [2024-04-27 11:42:44,941 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 11:42:44,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:42:44,943 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 30 treesize of output 16 [2024-04-27 11:42:45,001 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 11:42:45,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:42:45,002 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 30 treesize of output 16 [2024-04-27 11:42:45,083 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 11:42:45,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:42:45,084 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 30 treesize of output 16 [2024-04-27 11:42:45,187 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 11:42:45,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:42:45,189 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 30 treesize of output 16 [2024-04-27 11:42:45,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1360138241, now seen corresponding path program 2 times [2024-04-27 11:42:45,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 11:42:45,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 11:42:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 11:42:45,272 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-27 11:42:45,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 11:42:45,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 11:42:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 11:42:45,299 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-04-27 11:42:45,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-27 11:42:45,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-27 11:42:45,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:45,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-27 11:42:45,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:45,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-27 11:42:45,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-27 11:42:45,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-04-27 11:42:45,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:45,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-04-27 11:42:46,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,SelfDestructingSolverStorable19,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-04-27 11:42:46,015 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-27 11:42:46,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-27 11:42:46,015 INFO L85 PathProgramCache]: Analyzing trace with hash 612337443, now seen corresponding path program 5 times [2024-04-27 11:42:46,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-27 11:42:46,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982139214] [2024-04-27 11:42:46,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 11:42:46,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 11:42:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 11:42:46,506 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:42:46,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-27 11:42:46,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982139214] [2024-04-27 11:42:46,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982139214] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-27 11:42:46,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353088870] [2024-04-27 11:42:46,509 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-04-27 11:42:46,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-27 11:42:46,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-27 11:42:46,510 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-27 11:42:46,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-04-27 11:42:46,563 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-04-27 11:42:46,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-27 11:42:46,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 29 conjunts are in the unsatisfiable core [2024-04-27 11:42:46,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-27 11:42:47,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 11:42:47,094 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 38 treesize of output 26 [2024-04-27 11:42:47,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 11:42:47,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 31 [2024-04-27 11:42:47,242 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:42:47,242 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-27 11:42:47,623 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 11:42:47,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 11:42:47,642 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 40 treesize of output 66 [2024-04-27 11:42:47,788 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 11:42:47,789 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 11:42:47,790 INFO L173 IndexEqualityManager]: detected equality via solver [2024-04-27 11:42:47,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 11:42:47,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 81 [2024-04-27 11:42:48,069 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:42:48,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353088870] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-27 11:42:48,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-27 11:42:48,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31 [2024-04-27 11:42:48,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015090264] [2024-04-27 11:42:48,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-27 11:42:48,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-04-27 11:42:48,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-27 11:42:48,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-04-27 11:42:48,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=840, Unknown=0, NotChecked=0, Total=992 [2024-04-27 11:42:48,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-27 11:42:48,072 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-27 11:42:48,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.21875) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-27 11:42:48,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-27 11:42:48,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-27 11:42:48,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:48,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-27 11:42:48,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:48,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-27 11:42:48,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-27 11:42:48,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-04-27 11:42:48,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:48,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-27 11:42:51,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 11:42:51,485 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 32 treesize of output 16 [2024-04-27 11:42:51,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-04-27 11:42:51,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2024-04-27 11:42:51,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 11:42:51,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 16 [2024-04-27 11:42:51,999 INFO L85 PathProgramCache]: Analyzing trace with hash 197103822, now seen corresponding path program 3 times [2024-04-27 11:42:52,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 11:42:52,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 11:42:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 11:42:52,062 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-04-27 11:42:52,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 11:42:52,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 11:42:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 11:42:52,134 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-04-27 11:42:54,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-27 11:42:54,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-27 11:42:54,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:54,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-27 11:42:54,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:54,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-27 11:42:54,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-27 11:42:54,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-04-27 11:42:54,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:54,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-04-27 11:42:54,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-04-27 11:42:54,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-27 11:42:54,274 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-27 11:42:54,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-27 11:42:54,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1878987104, now seen corresponding path program 6 times [2024-04-27 11:42:54,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-27 11:42:54,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720541863] [2024-04-27 11:42:54,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 11:42:54,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 11:42:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 11:42:54,356 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 143 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-04-27 11:42:54,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-27 11:42:54,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720541863] [2024-04-27 11:42:54,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720541863] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-27 11:42:54,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147868270] [2024-04-27 11:42:54,357 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-04-27 11:42:54,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-27 11:42:54,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-27 11:42:54,358 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-27 11:42:54,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-04-27 11:42:54,419 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2024-04-27 11:42:54,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-27 11:42:54,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 10 conjunts are in the unsatisfiable core [2024-04-27 11:42:54,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-27 11:42:54,490 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 125 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-04-27 11:42:54,490 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-27 11:42:54,567 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 125 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-04-27 11:42:54,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147868270] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-27 11:42:54,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-27 11:42:54,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2024-04-27 11:42:54,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942311658] [2024-04-27 11:42:54,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-27 11:42:54,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-04-27 11:42:54,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-27 11:42:54,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-04-27 11:42:54,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-04-27 11:42:54,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-27 11:42:54,569 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-27 11:42:54,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-27 11:42:54,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-27 11:42:54,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-27 11:42:54,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:54,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-27 11:42:54,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:54,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-27 11:42:54,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-27 11:42:54,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-04-27 11:42:54,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:54,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-04-27 11:42:54,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-27 11:42:56,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-27 11:42:56,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-27 11:42:56,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:56,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-27 11:42:56,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:56,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-27 11:42:56,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-27 11:42:56,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-04-27 11:42:56,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:56,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-04-27 11:42:56,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-27 11:42:56,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-04-27 11:42:57,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-04-27 11:42:57,061 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-27 11:42:57,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-27 11:42:57,061 INFO L85 PathProgramCache]: Analyzing trace with hash -671156069, now seen corresponding path program 7 times [2024-04-27 11:42:57,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-27 11:42:57,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212469456] [2024-04-27 11:42:57,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 11:42:57,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 11:42:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 11:42:57,199 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 17 proven. 39 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-04-27 11:42:57,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-27 11:42:57,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212469456] [2024-04-27 11:42:57,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212469456] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-27 11:42:57,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721890552] [2024-04-27 11:42:57,200 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-04-27 11:42:57,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-27 11:42:57,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-27 11:42:57,201 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-27 11:42:57,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-04-27 11:42:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 11:42:57,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2024-04-27 11:42:57,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-27 11:42:57,476 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 17 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:42:57,476 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-27 11:42:57,650 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 26 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:42:57,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721890552] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-27 11:42:57,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-27 11:42:57,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 22 [2024-04-27 11:42:57,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473574927] [2024-04-27 11:42:57,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-27 11:42:57,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-04-27 11:42:57,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-27 11:42:57,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-04-27 11:42:57,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2024-04-27 11:42:57,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-27 11:42:57,653 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-27 11:42:57,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.739130434782608) internal successors, (132), 22 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-27 11:42:57,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-27 11:42:57,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-27 11:42:57,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:57,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-27 11:42:57,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:57,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-27 11:42:57,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-27 11:42:57,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-04-27 11:42:57,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:57,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2024-04-27 11:42:57,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-27 11:42:57,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-27 11:42:58,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-27 11:42:58,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-27 11:42:58,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:58,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-27 11:42:58,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:58,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-27 11:42:58,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-27 11:42:58,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-04-27 11:42:58,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:42:58,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-04-27 11:42:58,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-27 11:42:58,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-04-27 11:42:58,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-04-27 11:42:59,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-27 11:42:59,035 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-27 11:42:59,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-27 11:42:59,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1757344630, now seen corresponding path program 8 times [2024-04-27 11:42:59,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-27 11:42:59,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288375368] [2024-04-27 11:42:59,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 11:42:59,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 11:42:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 11:42:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 48 proven. 80 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-04-27 11:42:59,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-27 11:42:59,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288375368] [2024-04-27 11:42:59,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288375368] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-27 11:42:59,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738126605] [2024-04-27 11:42:59,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-27 11:42:59,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-27 11:42:59,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-27 11:42:59,238 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-27 11:42:59,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-04-27 11:42:59,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-27 11:42:59,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-27 11:42:59,308 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 18 conjunts are in the unsatisfiable core [2024-04-27 11:42:59,310 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-27 11:42:59,739 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 9 proven. 229 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:42:59,739 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-27 11:43:00,110 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 19 proven. 219 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:43:00,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738126605] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-27 11:43:00,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-27 11:43:00,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 16, 16] total 34 [2024-04-27 11:43:00,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725620727] [2024-04-27 11:43:00,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-27 11:43:00,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-04-27 11:43:00,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-27 11:43:00,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-04-27 11:43:00,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=927, Unknown=0, NotChecked=0, Total=1190 [2024-04-27 11:43:00,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-27 11:43:00,112 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-27 11:43:00,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 5.628571428571429) internal successors, (197), 34 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-27 11:43:00,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-27 11:43:00,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-27 11:43:00,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:43:00,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-27 11:43:00,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:43:00,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-27 11:43:00,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-27 11:43:00,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-04-27 11:43:00,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:43:00,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2024-04-27 11:43:00,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-27 11:43:00,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-04-27 11:43:00,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-27 11:43:04,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-27 11:43:04,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-04-27 11:43:04,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:43:04,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-04-27 11:43:04,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:43:04,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-27 11:43:04,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-04-27 11:43:04,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-04-27 11:43:04,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:43:04,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-04-27 11:43:04,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-04-27 11:43:04,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-04-27 11:43:04,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2024-04-27 11:43:04,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-04-27 11:43:04,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-04-27 11:43:04,732 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-04-27 11:43:04,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-27 11:43:04,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1815331546, now seen corresponding path program 9 times [2024-04-27 11:43:04,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-27 11:43:04,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709721269] [2024-04-27 11:43:04,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-27 11:43:04,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-27 11:43:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-27 11:43:07,508 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 11 proven. 244 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-04-27 11:43:07,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-27 11:43:07,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709721269] [2024-04-27 11:43:07,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709721269] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-27 11:43:07,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893468111] [2024-04-27 11:43:07,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-04-27 11:43:07,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-27 11:43:07,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-27 11:43:07,510 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-27 11:43:07,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-04-27 11:43:07,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-04-27 11:43:07,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-27 11:43:07,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 95 conjunts are in the unsatisfiable core [2024-04-27 11:43:07,583 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-27 11:43:13,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:43:13,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:43:13,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:43:13,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:43:13,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:43:13,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:43:13,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:43:13,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:43:13,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:43:13,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:43:13,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:43:13,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:43:13,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:43:13,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:43:13,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:43:13,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:43:13,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:43:13,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:43:13,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:43:13,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:43:13,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:43:13,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 11:43:13,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 15 select indices, 15 select index equivalence classes, 60 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 45 case distinctions, treesize of input 126 treesize of output 512 [2024-04-27 11:44:18,438 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:18,480 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:18,510 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:18,566 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:18,603 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:18,675 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:18,697 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:18,723 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-04-27 11:44:18,782 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:18,803 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:18,825 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:18,867 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:18,882 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:18,915 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:18,936 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:18,963 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:19,047 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:19,062 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:19,097 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:19,114 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:19,132 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-04-27 11:44:19,193 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:19,208 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:19,274 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:19,308 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:19,327 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:19,404 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:19,456 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:19,478 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:19,494 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:19,591 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:19,782 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:19,814 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:19,910 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:19,923 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:19,934 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:19,954 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:19,980 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-04-27 11:44:20,022 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:20,036 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:20,060 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:20,067 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:20,102 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:20,115 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:20,126 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:20,150 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:20,176 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-04-27 11:44:20,220 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:20,230 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:20,252 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:20,301 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:20,308 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:20,369 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:20,387 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:20,410 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:20,438 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:20,455 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-04-27 11:44:20,497 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:20,521 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-04-27 11:44:20,553 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2024-04-27 11:44:20,675 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:20,695 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:20,724 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:20,762 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:20,791 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:20,815 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:20,839 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:20,877 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:20,899 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:20,923 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:20,957 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:20,980 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:21,000 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:21,031 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:21,051 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:21,073 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:21,108 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:21,129 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-04-27 11:44:21,166 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:21,204 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:22,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:44:22,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:44:22,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:44:22,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:44:22,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:44:22,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:44:22,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:44:22,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:44:22,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:44:22,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:44:22,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:44:22,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-04-27 11:44:22,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 11:44:22,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 13 select indices, 13 select index equivalence classes, 30 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 48 case distinctions, treesize of input 342 treesize of output 532 [2024-04-27 11:44:36,225 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:36,326 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:36,712 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:36,926 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:38,157 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:38,958 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:39,100 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:39,308 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:39,363 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:39,509 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:39,548 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:39,618 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:39,662 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-04-27 11:44:39,721 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:39,756 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:39,826 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:39,874 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:40,175 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:40,214 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:40,316 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:40,366 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:40,407 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:40,434 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:40,521 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:40,572 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:40,723 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:40,755 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:40,816 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:40,862 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:41,003 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:41,104 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:41,180 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:41,333 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:41,390 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:41,505 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:41,594 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:41,641 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:41,690 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:41,740 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:41,805 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:41,858 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:41,956 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:42,009 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:42,055 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:42,153 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:42,228 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:42,289 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:42,381 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:42,437 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-04-27 11:44:42,502 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:42,543 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:42,610 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:42,690 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:42,752 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:42,859 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:42,911 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:42,967 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:43,074 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:43,141 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:43,215 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:43,275 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:43,394 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:43,583 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:43,626 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:43,664 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:43,708 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2024-04-27 11:44:43,762 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:43,809 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:43,853 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:43,888 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:43,959 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:43,992 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:44,053 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:44,184 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:44,237 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:44,288 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:44,329 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:44,467 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:44,518 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:44,568 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:44,620 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:44,671 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:44,731 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:44,778 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:45,141 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:45,258 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:45,304 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:45,371 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:45,412 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:45,483 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:45,554 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:45,609 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:45,729 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:45,858 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:46,046 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:46,124 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:46,235 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:46,296 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:46,415 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:46,470 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:46,557 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:46,614 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:46,740 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:46,816 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:46,984 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:47,073 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:47,186 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:47,247 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:47,364 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:47,417 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:47,496 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:47,597 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:47,671 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:48,448 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:48,769 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:48,950 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:49,004 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:49,066 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:49,172 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:49,220 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:49,425 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:49,604 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:49,644 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:49,708 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:49,815 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:49,863 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:49,929 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:50,120 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:50,152 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:50,209 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:50,266 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:50,333 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:50,360 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:50,537 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:50,584 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:50,601 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:50,638 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:50,659 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:50,728 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:50,811 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:50,843 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:50,957 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:51,503 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:51,561 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:51,650 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:51,740 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:51,840 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:51,945 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:51,977 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:52,007 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:52,103 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:52,149 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:44:52,184 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:52,259 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:52,306 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:52,413 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:52,481 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:52,524 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:52,721 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:52,901 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:53,111 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:53,134 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:53,198 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:53,260 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:53,288 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:53,437 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:53,465 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:53,561 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:53,590 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:53,673 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:53,706 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:53,762 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:53,796 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:53,819 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:53,862 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:53,962 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:53,993 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:54,034 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:54,061 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:54,169 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:54,199 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:54,272 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:54,305 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:54,424 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-04-27 11:44:54,463 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-04-27 11:44:54,483 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2024-04-27 11:45:00,320 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:45:00,320 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-27 11:45:06,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 11:45:06,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 135 treesize of output 151 [2024-04-27 11:45:07,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-04-27 11:45:07,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 136 treesize of output 154 [2024-04-27 11:45:08,498 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 51 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-27 11:45:08,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893468111] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-27 11:45:08,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-27 11:45:08,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 34, 34] total 90 [2024-04-27 11:45:08,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324457136] [2024-04-27 11:45:08,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-27 11:45:08,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2024-04-27 11:45:08,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-27 11:45:08,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2024-04-27 11:45:08,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1116, Invalid=7074, Unknown=0, NotChecked=0, Total=8190 [2024-04-27 11:45:08,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-27 11:45:08,502 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-27 11:45:08,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 2.791208791208791) internal successors, (254), 90 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-04-27 11:45:08,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-27 11:45:08,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-04-27 11:45:08,502 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:45:08,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-04-27 11:45:08,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:45:08,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-27 11:45:08,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-04-27 11:45:08,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2024-04-27 11:45:08,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-04-27 11:45:08,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2024-04-27 11:45:08,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-04-27 11:45:08,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-04-27 11:45:08,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2024-04-27 11:45:08,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-27 11:46:05,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:46:09,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:46:27,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:46:34,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:46:37,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:47:27,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:47:51,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:47:53,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:47:57,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:47:59,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:48:01,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:48:03,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:48:06,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:48:13,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:48:15,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:48:17,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:48:19,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:48:21,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:48:22,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:48:30,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:48:32,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:48:35,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:48:39,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:48:40,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:48:42,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:48:48,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:48:50,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:48:52,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:49:03,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:49:05,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:49:07,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:49:11,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:49:13,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:49:15,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:49:16,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:49:18,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:49:20,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:49:22,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:49:24,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:49:27,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:49:31,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:49:33,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:49:35,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:49:37,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:49:39,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:49:41,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:49:43,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:49:45,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:49:47,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:49:49,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:49:51,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:49:55,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:49:57,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:49:59,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:50:01,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:50:04,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:50:06,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:50:08,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:50:10,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:50:12,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:50:15,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:50:17,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:50:19,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:50:21,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:50:24,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:50:27,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:50:29,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:50:31,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:50:42,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:50:46,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:50:47,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:50:49,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:50:51,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:51:12,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:51:14,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:51:15,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:51:17,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:51:19,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:51:21,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:51:23,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:51:26,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:51:28,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:51:30,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:51:32,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:51:34,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:51:35,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:51:37,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:51:40,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:51:42,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:51:44,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:51:46,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:51:48,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:51:51,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:51:53,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:51:55,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:51:57,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:52:07,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:52:10,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:52:11,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:52:14,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:52:16,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:52:18,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:52:24,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:52:27,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:52:28,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:52:30,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:52:32,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:52:34,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:52:36,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:52:37,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:52:39,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:52:42,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:52:44,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:52:46,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:52:48,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:52:49,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:52:52,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:52:55,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:52:57,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:52:59,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:53:01,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:53:03,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:53:05,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:53:07,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:53:08,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:53:11,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:53:13,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:53:15,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:53:17,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:53:20,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:53:23,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:53:25,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:53:27,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:53:29,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:53:30,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:53:53,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:53:56,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:53:58,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:54:01,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:54:03,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:54:05,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:54:07,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:54:09,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:54:11,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:54:13,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:54:15,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:54:18,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:54:30,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:54:32,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:54:34,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:54:35,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:54:38,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:54:40,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:54:41,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:54:43,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:54:45,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:54:47,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:54:48,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:54:50,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:54:52,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:54:55,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:54:57,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:55:13,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:55:37,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:55:43,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:55:45,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:55:47,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:55:49,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:55:51,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:55:54,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:56:09,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Received shutdown request... [2024-04-27 11:56:39,838 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-04-27 11:56:39,838 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-04-27 11:56:39,838 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-04-27 11:56:40,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-04-27 11:56:40,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-04-27 11:56:40,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-04-27 11:56:41,039 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-04-27 11:56:41,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2024-04-27 11:56:41,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-04-27 11:56:41,116 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2024-04-27 11:56:41,118 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (4 of 5 remaining) [2024-04-27 11:56:41,118 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-04-27 11:56:41,118 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-04-27 11:56:41,119 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-04-27 11:56:41,119 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-04-27 11:56:41,126 INFO L448 BasicCegarLoop]: Path program histogram: [9, 5, 3, 3, 1, 1, 1, 1] [2024-04-27 11:56:41,129 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-04-27 11:56:41,130 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-04-27 11:56:41,132 INFO L201 PluginConnector]: Adding new model buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:56:41 BasicIcfg [2024-04-27 11:56:41,132 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-04-27 11:56:41,132 INFO L158 Benchmark]: Toolchain (without parser) took 854663.93ms. Allocated memory was 306.2MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 279.5MB in the beginning and 1.4GB in the end (delta: -1.1GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2024-04-27 11:56:41,132 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 306.2MB. Free memory is still 273.3MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-27 11:56:41,133 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.04ms. Allocated memory is still 306.2MB. Free memory was 279.5MB in the beginning and 277.7MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-27 11:56:41,133 INFO L158 Benchmark]: Boogie Preprocessor took 26.27ms. Allocated memory is still 306.2MB. Free memory was 277.7MB in the beginning and 276.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-27 11:56:41,133 INFO L158 Benchmark]: RCFGBuilder took 335.73ms. Allocated memory is still 306.2MB. Free memory was 276.7MB in the beginning and 264.9MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-04-27 11:56:41,133 INFO L158 Benchmark]: TraceAbstraction took 854255.13ms. Allocated memory was 306.2MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 263.6MB in the beginning and 1.4GB in the end (delta: -1.1GB). Peak memory consumption was 991.2MB. Max. memory is 8.0GB. [2024-04-27 11:56:41,134 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.11ms. Allocated memory is still 306.2MB. Free memory is still 273.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.04ms. Allocated memory is still 306.2MB. Free memory was 279.5MB in the beginning and 277.7MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.27ms. Allocated memory is still 306.2MB. Free memory was 277.7MB in the beginning and 276.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 335.73ms. Allocated memory is still 306.2MB. Free memory was 276.7MB in the beginning and 264.9MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 854255.13ms. Allocated memory was 306.2MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 263.6MB in the beginning and 1.4GB in the end (delta: -1.1GB). Peak memory consumption was 991.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 881349, independent: 788991, independent conditional: 788867, independent unconditional: 124, dependent: 92358, dependent conditional: 92330, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 802085, independent: 788991, independent conditional: 788867, independent unconditional: 124, dependent: 13094, dependent conditional: 13094, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 802085, independent: 788991, independent conditional: 788867, independent unconditional: 124, dependent: 13094, dependent conditional: 13094, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 802085, independent: 788991, independent conditional: 788867, independent unconditional: 124, dependent: 13094, dependent conditional: 13094, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 882464, independent: 788991, independent conditional: 452469, independent unconditional: 336522, dependent: 93473, dependent conditional: 73660, dependent unconditional: 19813, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 882464, independent: 788991, independent conditional: 376967, independent unconditional: 412024, dependent: 93473, dependent conditional: 51319, dependent unconditional: 42154, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 882464, independent: 788991, independent conditional: 376967, independent unconditional: 412024, dependent: 93473, dependent conditional: 51319, dependent unconditional: 42154, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1054, independent: 625, independent conditional: 345, independent unconditional: 280, dependent: 429, dependent conditional: 420, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1054, independent: 321, independent conditional: 0, independent unconditional: 321, dependent: 733, dependent conditional: 0, dependent unconditional: 733, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 733, independent: 304, independent conditional: 294, independent unconditional: 10, dependent: 429, dependent conditional: 420, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 733, independent: 304, independent conditional: 294, independent unconditional: 10, dependent: 429, dependent conditional: 420, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2125, independent: 1012, independent conditional: 999, independent unconditional: 13, dependent: 1113, dependent conditional: 1099, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 882464, independent: 788366, independent conditional: 376622, independent unconditional: 411744, dependent: 93044, dependent conditional: 50899, dependent unconditional: 42145, unknown: 1054, unknown conditional: 765, unknown unconditional: 289] , Statistics on independence cache: Total cache size (in pairs): 1054, Positive cache size: 625, Positive conditional cache size: 345, Positive unconditional cache size: 280, Negative cache size: 429, Negative conditional cache size: 420, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 97843, Maximal queried relation: 14, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 882464, independent: 788991, independent conditional: 452469, independent unconditional: 336522, dependent: 93473, dependent conditional: 73660, dependent unconditional: 19813, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 882464, independent: 788991, independent conditional: 376967, independent unconditional: 412024, dependent: 93473, dependent conditional: 51319, dependent unconditional: 42154, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 882464, independent: 788991, independent conditional: 376967, independent unconditional: 412024, dependent: 93473, dependent conditional: 51319, dependent unconditional: 42154, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1054, independent: 625, independent conditional: 345, independent unconditional: 280, dependent: 429, dependent conditional: 420, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1054, independent: 321, independent conditional: 0, independent unconditional: 321, dependent: 733, dependent conditional: 0, dependent unconditional: 733, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 733, independent: 304, independent conditional: 294, independent unconditional: 10, dependent: 429, dependent conditional: 420, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 733, independent: 304, independent conditional: 294, independent unconditional: 10, dependent: 429, dependent conditional: 420, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2125, independent: 1012, independent conditional: 999, independent unconditional: 13, dependent: 1113, dependent conditional: 1099, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 882464, independent: 788366, independent conditional: 376622, independent unconditional: 411744, dependent: 93044, dependent conditional: 50899, dependent unconditional: 42145, unknown: 1054, unknown conditional: 765, unknown unconditional: 289] , Statistics on independence cache: Total cache size (in pairs): 1054, Positive cache size: 625, Positive conditional cache size: 345, Positive unconditional cache size: 280, Negative cache size: 429, Negative conditional cache size: 420, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 97843 ], Independence queries for same thread: 79264 - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 75]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 54 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 854.1s, OverallIterations: 14, TraceHistogramMax: 0, PathProgramHistogramMax: 9, EmptinessCheckTime: 718.9s, 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: 468, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 131.8s InterpolantComputationTime, 1201 NumberOfCodeBlocks, 1201 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 1681 ConstructedInterpolants, 49 QuantifiedInterpolants, 31806 SizeOfPredicates, 54 NumberOfNonLiveVariables, 1714 ConjunctsInSsa, 252 ConjunctsInUnsatCore, 36 InterpolantComputations, 4 PerfectInterpolantSequences, 881/2534 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: 7.4s, ConditionalCommutativityIAIntegrations: 0, ConditionalCommutativityDFSRestarts: 1, ConditionalCommutativityImperfectProofs: 2 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown