java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-15 10:57:28,213 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 10:57:28,215 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 10:57:28,227 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 10:57:28,228 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 10:57:28,229 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 10:57:28,230 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 10:57:28,233 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 10:57:28,235 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 10:57:28,236 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 10:57:28,237 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 10:57:28,237 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 10:57:28,238 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 10:57:28,239 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 10:57:28,240 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 10:57:28,241 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 10:57:28,242 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 10:57:28,244 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 10:57:28,246 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 10:57:28,248 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 10:57:28,249 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 10:57:28,251 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 10:57:28,253 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 10:57:28,254 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 10:57:28,254 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 10:57:28,255 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 10:57:28,256 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 10:57:28,257 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 10:57:28,258 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 10:57:28,259 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 10:57:28,260 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 10:57:28,260 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 10:57:28,261 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 10:57:28,261 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 10:57:28,262 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 10:57:28,263 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 10:57:28,263 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-15 10:57:28,284 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 10:57:28,285 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 10:57:28,286 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 10:57:28,286 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 10:57:28,287 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 10:57:28,287 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 10:57:28,287 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 10:57:28,288 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 10:57:28,288 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-15 10:57:28,288 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 10:57:28,288 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-15 10:57:28,288 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-15 10:57:28,289 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 10:57:28,289 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 10:57:28,290 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 10:57:28,291 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 10:57:28,291 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 10:57:28,291 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 10:57:28,291 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 10:57:28,292 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 10:57:28,292 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 10:57:28,292 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 10:57:28,292 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 10:57:28,292 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 10:57:28,293 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 10:57:28,295 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 10:57:28,295 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 10:57:28,295 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 10:57:28,295 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 10:57:28,295 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 10:57:28,296 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 10:57:28,297 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:57:28,297 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 10:57:28,297 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 10:57:28,297 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 10:57:28,297 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 10:57:28,298 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 10:57:28,298 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 10:57:28,298 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 10:57:28,299 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 10:57:28,347 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 10:57:28,362 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 10:57:28,369 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 10:57:28,371 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 10:57:28,371 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 10:57:28,372 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl [2019-02-15 10:57:28,372 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl' [2019-02-15 10:57:28,430 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 10:57:28,432 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 10:57:28,432 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 10:57:28,432 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 10:57:28,433 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 10:57:28,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:57:28" (1/1) ... [2019-02-15 10:57:28,464 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:57:28" (1/1) ... [2019-02-15 10:57:28,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 10:57:28,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 10:57:28,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 10:57:28,495 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 10:57:28,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:57:28" (1/1) ... [2019-02-15 10:57:28,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:57:28" (1/1) ... [2019-02-15 10:57:28,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:57:28" (1/1) ... [2019-02-15 10:57:28,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:57:28" (1/1) ... [2019-02-15 10:57:28,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:57:28" (1/1) ... [2019-02-15 10:57:28,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:57:28" (1/1) ... [2019-02-15 10:57:28,518 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:57:28" (1/1) ... [2019-02-15 10:57:28,520 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 10:57:28,520 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 10:57:28,520 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 10:57:28,520 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 10:57:28,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:57:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:57:28,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-15 10:57:28,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-15 10:57:29,068 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-15 10:57:29,069 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-02-15 10:57:29,070 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:57:29 BoogieIcfgContainer [2019-02-15 10:57:29,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 10:57:29,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 10:57:29,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 10:57:29,075 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 10:57:29,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:57:28" (1/2) ... [2019-02-15 10:57:29,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bdb8475 and model type speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:57:29, skipping insertion in model container [2019-02-15 10:57:29,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:57:29" (2/2) ... [2019-02-15 10:57:29,079 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-7-limited.bpl [2019-02-15 10:57:29,089 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 10:57:29,100 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-02-15 10:57:29,117 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-02-15 10:57:29,155 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 10:57:29,156 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 10:57:29,156 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 10:57:29,156 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 10:57:29,156 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 10:57:29,157 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 10:57:29,157 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 10:57:29,157 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 10:57:29,176 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-02-15 10:57:29,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-15 10:57:29,190 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:29,193 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-15 10:57:29,196 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:29,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:29,204 INFO L82 PathProgramCache]: Analyzing trace with hash 992, now seen corresponding path program 1 times [2019-02-15 10:57:29,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:29,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:29,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:29,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:29,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:29,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:29,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:57:29,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 10:57:29,534 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:57:29,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 10:57:29,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 10:57:29,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:57:29,553 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-02-15 10:57:29,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:29,819 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-02-15 10:57:29,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:57:29,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-15 10:57:29,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:29,836 INFO L225 Difference]: With dead ends: 33 [2019-02-15 10:57:29,837 INFO L226 Difference]: Without dead ends: 28 [2019-02-15 10:57:29,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:57:29,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-15 10:57:29,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2019-02-15 10:57:29,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-15 10:57:29,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2019-02-15 10:57:29,878 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 2 [2019-02-15 10:57:29,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:29,879 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2019-02-15 10:57:29,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 10:57:29,879 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2019-02-15 10:57:29,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:57:29,880 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:29,880 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:57:29,881 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:29,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:29,881 INFO L82 PathProgramCache]: Analyzing trace with hash 30816, now seen corresponding path program 1 times [2019-02-15 10:57:29,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:29,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:29,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:29,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:29,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:29,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:29,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:57:29,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 10:57:29,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:57:29,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 10:57:29,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 10:57:29,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:57:29,942 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 3 states. [2019-02-15 10:57:30,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:30,187 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-02-15 10:57:30,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:57:30,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-15 10:57:30,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:30,189 INFO L225 Difference]: With dead ends: 28 [2019-02-15 10:57:30,189 INFO L226 Difference]: Without dead ends: 27 [2019-02-15 10:57:30,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:57:30,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-15 10:57:30,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2019-02-15 10:57:30,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-15 10:57:30,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2019-02-15 10:57:30,195 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 3 [2019-02-15 10:57:30,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:30,195 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 30 transitions. [2019-02-15 10:57:30,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 10:57:30,196 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 30 transitions. [2019-02-15 10:57:30,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:57:30,197 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:30,197 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:57:30,197 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:30,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:30,198 INFO L82 PathProgramCache]: Analyzing trace with hash 30380, now seen corresponding path program 1 times [2019-02-15 10:57:30,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:30,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:30,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:30,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:30,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:30,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:30,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:30,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:30,375 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:57:30,377 INFO L207 CegarAbsIntRunner]: [0], [18], [31] [2019-02-15 10:57:30,413 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:30,413 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:30,489 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:30,490 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 3. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:57:30,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:30,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:30,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:30,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:30,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:30,507 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:30,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:30,694 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-02-15 10:57:30,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2019-02-15 10:57:30,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2019-02-15 10:57:30,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:57:30,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 53 [2019-02-15 10:57:30,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 10:57:31,004 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:31,008 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:31,012 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:31,015 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:31,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:31,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-15 10:57:31,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2019-02-15 10:57:31,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:57:31,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:57:31,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 10:57:31,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 10:57:31,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-15 10:57:31,283 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:31,704 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:31,769 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:31,816 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:31,841 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:31,876 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:31,897 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:31,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:31,941 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:71, output treesize:54 [2019-02-15 10:57:32,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-15 10:57:32,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:32,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:32,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:54 [2019-02-15 10:57:33,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:33,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:33,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:33,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:57:33,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:33,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:57:33,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:57:33,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:57:33,707 INFO L87 Difference]: Start difference. First operand 17 states and 30 transitions. Second operand 6 states. [2019-02-15 10:57:53,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:53,720 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2019-02-15 10:57:53,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:57:53,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 10:57:53,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:53,723 INFO L225 Difference]: With dead ends: 54 [2019-02-15 10:57:53,723 INFO L226 Difference]: Without dead ends: 52 [2019-02-15 10:57:53,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:57:53,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-15 10:57:53,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 20. [2019-02-15 10:57:53,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-15 10:57:53,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 41 transitions. [2019-02-15 10:57:53,730 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 41 transitions. Word has length 3 [2019-02-15 10:57:53,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:53,730 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 41 transitions. [2019-02-15 10:57:53,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:57:53,731 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 41 transitions. [2019-02-15 10:57:53,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:57:53,731 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:53,731 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:57:53,732 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:53,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:53,732 INFO L82 PathProgramCache]: Analyzing trace with hash 30008, now seen corresponding path program 1 times [2019-02-15 10:57:53,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:53,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:53,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:53,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:53,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:53,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:53,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:53,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:53,787 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:57:53,787 INFO L207 CegarAbsIntRunner]: [0], [6], [31] [2019-02-15 10:57:53,788 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:53,788 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:53,800 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:53,800 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 3. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:57:53,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:53,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:53,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:53,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:53,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:53,810 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:53,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:53,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-15 10:57:53,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2019-02-15 10:57:53,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:57:54,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:57:54,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,037 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 10:57:54,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 10:57:54,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-15 10:57:54,110 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,187 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,250 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,282 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,308 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,327 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2019-02-15 10:57:54,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2019-02-15 10:57:54,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:57:54,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 53 [2019-02-15 10:57:54,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 10:57:54,661 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,668 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,670 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,672 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,674 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:54,719 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:71, output treesize:54 [2019-02-15 10:57:54,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 126 [2019-02-15 10:57:54,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:54,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:54 [2019-02-15 10:57:54,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:54,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:55,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:55,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 10:57:55,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-15 10:57:55,025 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:57:55,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:57:55,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:57:55,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:57:55,026 INFO L87 Difference]: Start difference. First operand 20 states and 41 transitions. Second operand 4 states. [2019-02-15 10:57:55,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:55,126 INFO L93 Difference]: Finished difference Result 25 states and 67 transitions. [2019-02-15 10:57:55,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 10:57:55,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-15 10:57:55,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:55,127 INFO L225 Difference]: With dead ends: 25 [2019-02-15 10:57:55,127 INFO L226 Difference]: Without dead ends: 24 [2019-02-15 10:57:55,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:57:55,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-15 10:57:55,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-02-15 10:57:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-15 10:57:55,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-02-15 10:57:55,134 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 3 [2019-02-15 10:57:55,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:55,134 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-02-15 10:57:55,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:57:55,134 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-02-15 10:57:55,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:57:55,135 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:55,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:57:55,135 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:55,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:55,135 INFO L82 PathProgramCache]: Analyzing trace with hash 30132, now seen corresponding path program 1 times [2019-02-15 10:57:55,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:55,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:55,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:55,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:55,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:55,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:55,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:55,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:55,254 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:57:55,255 INFO L207 CegarAbsIntRunner]: [0], [10], [31] [2019-02-15 10:57:55,258 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:55,258 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:55,267 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:55,268 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 3. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:57:55,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:55,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:55,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:55,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:57:55,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:55,282 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:55,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:55,423 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-02-15 10:57:55,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-15 10:57:55,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2019-02-15 10:57:55,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:57:55,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:57:55,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 10:57:55,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 10:57:55,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-15 10:57:55,612 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:55,768 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:55,818 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:55,845 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:55,866 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:55,887 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:55,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:55,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2019-02-15 10:57:55,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:55,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 48 [2019-02-15 10:57:56,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 45 [2019-02-15 10:57:56,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 10:57:56,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 10:57:56,167 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:56,169 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:56,172 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:56,174 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:56,177 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:56,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:56,231 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:82, output treesize:54 [2019-02-15 10:57:56,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:56,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 126 [2019-02-15 10:57:56,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:56,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-15 10:57:56,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:54 [2019-02-15 10:57:57,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:57,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:57,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:57,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:57,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:57:57,784 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:57,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:57:57,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:57:57,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:57:57,785 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 6 states. [2019-02-15 10:58:16,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:16,689 INFO L93 Difference]: Finished difference Result 57 states and 111 transitions. [2019-02-15 10:58:16,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:58:16,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 10:58:16,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:16,690 INFO L225 Difference]: With dead ends: 57 [2019-02-15 10:58:16,691 INFO L226 Difference]: Without dead ends: 56 [2019-02-15 10:58:16,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:58:16,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-15 10:58:16,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 25. [2019-02-15 10:58:16,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-15 10:58:16,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2019-02-15 10:58:16,699 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 82 transitions. Word has length 3 [2019-02-15 10:58:16,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:16,699 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 82 transitions. [2019-02-15 10:58:16,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:58:16,699 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 82 transitions. [2019-02-15 10:58:16,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:58:16,700 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:16,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:58:16,700 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:16,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:16,701 INFO L82 PathProgramCache]: Analyzing trace with hash 30628, now seen corresponding path program 1 times [2019-02-15 10:58:16,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:16,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:16,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:16,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:16,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:16,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:16,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:16,792 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:16,792 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:58:16,792 INFO L207 CegarAbsIntRunner]: [0], [26], [31] [2019-02-15 10:58:16,796 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:16,796 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:16,805 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:16,805 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 3. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:58:16,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:16,805 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:16,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:16,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:58:16,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:16,815 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:16,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:16,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-15 10:58:16,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2019-02-15 10:58:16,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:58:16,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:58:16,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 10:58:16,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 10:58:16,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-15 10:58:16,983 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:17,050 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:17,085 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:17,112 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:17,138 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:17,155 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:17,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:17,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2019-02-15 10:58:17,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 48 [2019-02-15 10:58:17,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 45 [2019-02-15 10:58:17,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 10:58:17,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 10:58:17,332 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:17,334 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:17,336 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:17,338 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:17,341 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:17,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:17,376 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:82, output treesize:54 [2019-02-15 10:58:17,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 126 [2019-02-15 10:58:17,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:17,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:17,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:54 [2019-02-15 10:58:18,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:18,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:18,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:18,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:58:18,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:18,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:58:18,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:58:18,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:58:18,739 INFO L87 Difference]: Start difference. First operand 25 states and 82 transitions. Second operand 6 states. [2019-02-15 10:58:37,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:37,254 INFO L93 Difference]: Finished difference Result 59 states and 127 transitions. [2019-02-15 10:58:37,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:58:37,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 10:58:37,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:37,256 INFO L225 Difference]: With dead ends: 59 [2019-02-15 10:58:37,256 INFO L226 Difference]: Without dead ends: 57 [2019-02-15 10:58:37,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:58:37,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-15 10:58:37,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2019-02-15 10:58:37,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-15 10:58:37,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 101 transitions. [2019-02-15 10:58:37,265 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 101 transitions. Word has length 3 [2019-02-15 10:58:37,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:37,265 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 101 transitions. [2019-02-15 10:58:37,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:58:37,266 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 101 transitions. [2019-02-15 10:58:37,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:58:37,266 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:37,267 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:58:37,267 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:37,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:37,267 INFO L82 PathProgramCache]: Analyzing trace with hash 955362, now seen corresponding path program 1 times [2019-02-15 10:58:37,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:37,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:37,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:37,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:37,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:37,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:58:37,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 10:58:37,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:58:37,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 10:58:37,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 10:58:37,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:58:37,317 INFO L87 Difference]: Start difference. First operand 29 states and 101 transitions. Second operand 3 states. [2019-02-15 10:58:37,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:37,385 INFO L93 Difference]: Finished difference Result 33 states and 102 transitions. [2019-02-15 10:58:37,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:58:37,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-15 10:58:37,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:37,386 INFO L225 Difference]: With dead ends: 33 [2019-02-15 10:58:37,386 INFO L226 Difference]: Without dead ends: 32 [2019-02-15 10:58:37,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:58:37,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-02-15 10:58:37,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-02-15 10:58:37,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-15 10:58:37,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 100 transitions. [2019-02-15 10:58:37,394 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 100 transitions. Word has length 4 [2019-02-15 10:58:37,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:37,394 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 100 transitions. [2019-02-15 10:58:37,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 10:58:37,395 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 100 transitions. [2019-02-15 10:58:37,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:58:37,395 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:37,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:58:37,396 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:37,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:37,396 INFO L82 PathProgramCache]: Analyzing trace with hash 941844, now seen corresponding path program 1 times [2019-02-15 10:58:37,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:37,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:37,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:37,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:37,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:37,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:37,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:37,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:37,465 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:58:37,465 INFO L207 CegarAbsIntRunner]: [0], [18], [32], [33] [2019-02-15 10:58:37,466 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:37,466 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:37,477 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:37,477 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:58:37,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:37,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:37,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:37,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:58:37,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:37,494 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:37,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:37,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 20 treesize of output 23 [2019-02-15 10:58:37,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 23 treesize of output 25 [2019-02-15 10:58:37,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:37,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-02-15 10:58:37,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:37,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:37,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2019-02-15 10:58:37,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:37,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:37,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:37,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:37,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:37,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2019-02-15 10:58:37,592 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:37,603 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:37,609 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:37,611 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:37,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:37,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-15 10:58:37,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 27 treesize of output 29 [2019-02-15 10:58:37,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:37,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2019-02-15 10:58:37,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:37,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:37,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-15 10:58:37,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:37,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:37,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:37,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 10:58:37,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:37,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:37,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:37,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:37,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-02-15 10:58:37,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:37,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:37,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:37,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:37,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:37,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 100 [2019-02-15 10:58:37,722 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:37,792 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:37,815 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:37,834 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:37,850 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:37,864 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:37,878 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:37,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:37,907 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:60, output treesize:55 [2019-02-15 10:58:37,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:37,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:37,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:37,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:37,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:37,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:37,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:38,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:38,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:38,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:38,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:38,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:38,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:38,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:38,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:38,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:38,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 104 [2019-02-15 10:58:38,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:58:38,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 2 xjuncts. [2019-02-15 10:58:38,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:104 [2019-02-15 10:58:39,711 WARN L181 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2019-02-15 10:58:39,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:39,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:39,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:39,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 10:58:39,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-15 10:58:39,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:58:39,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:58:39,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:58:39,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:58:39,796 INFO L87 Difference]: Start difference. First operand 29 states and 100 transitions. Second operand 4 states. [2019-02-15 10:58:39,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:39,846 INFO L93 Difference]: Finished difference Result 33 states and 111 transitions. [2019-02-15 10:58:39,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:58:39,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-15 10:58:39,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:39,848 INFO L225 Difference]: With dead ends: 33 [2019-02-15 10:58:39,848 INFO L226 Difference]: Without dead ends: 32 [2019-02-15 10:58:39,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:58:39,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-02-15 10:58:39,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-02-15 10:58:39,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-15 10:58:39,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 110 transitions. [2019-02-15 10:58:39,856 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 110 transitions. Word has length 4 [2019-02-15 10:58:39,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:39,856 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 110 transitions. [2019-02-15 10:58:39,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:58:39,856 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 110 transitions. [2019-02-15 10:58:39,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:58:39,857 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:39,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:58:39,858 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:39,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:39,858 INFO L82 PathProgramCache]: Analyzing trace with hash 941532, now seen corresponding path program 1 times [2019-02-15 10:58:39,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:39,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:39,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:39,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:39,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:39,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:39,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:39,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:39,978 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:58:39,978 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [31] [2019-02-15 10:58:39,980 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:39,980 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:39,988 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:39,988 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:58:39,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:39,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:39,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:39,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:58:39,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:39,998 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:40,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:40,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-15 10:58:40,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2019-02-15 10:58:40,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:58:40,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:58:40,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 10:58:40,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 10:58:40,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-15 10:58:40,175 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:40,229 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:40,264 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:40,290 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:40,310 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:40,327 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:40,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:40,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2019-02-15 10:58:40,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2019-02-15 10:58:40,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 10:58:40,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 53 [2019-02-15 10:58:40,521 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-02-15 10:58:40,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 10:58:40,530 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:40,533 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:40,535 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:40,537 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:40,540 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:40,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:40,569 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:71, output treesize:54 [2019-02-15 10:58:40,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-15 10:58:40,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:40,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:40,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-02-15 10:58:40,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:40,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 134 [2019-02-15 10:58:40,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:40,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-15 10:58:40,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:56 [2019-02-15 10:58:43,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:43,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:43,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:43,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:43,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:58:43,274 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:43,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:58:43,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:58:43,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:58:43,275 INFO L87 Difference]: Start difference. First operand 31 states and 110 transitions. Second operand 8 states. [2019-02-15 10:59:17,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:17,247 INFO L93 Difference]: Finished difference Result 74 states and 179 transitions. [2019-02-15 10:59:17,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:59:17,248 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:59:17,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:17,250 INFO L225 Difference]: With dead ends: 74 [2019-02-15 10:59:17,250 INFO L226 Difference]: Without dead ends: 72 [2019-02-15 10:59:17,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:59:17,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-15 10:59:17,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2019-02-15 10:59:17,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-15 10:59:17,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 139 transitions. [2019-02-15 10:59:17,259 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 139 transitions. Word has length 4 [2019-02-15 10:59:17,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:17,259 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 139 transitions. [2019-02-15 10:59:17,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:59:17,260 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 139 transitions. [2019-02-15 10:59:17,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:59:17,260 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:17,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:59:17,261 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:17,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:17,261 INFO L82 PathProgramCache]: Analyzing trace with hash 941160, now seen corresponding path program 1 times [2019-02-15 10:59:17,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:17,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:17,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:17,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:17,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:17,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:17,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:17,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:17,395 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:59:17,395 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [31] [2019-02-15 10:59:17,397 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:17,397 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:17,406 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:17,407 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:59:17,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:17,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:17,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:17,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:59:17,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:17,416 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:17,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:17,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-15 10:59:17,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2019-02-15 10:59:17,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:59:17,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:59:17,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 10:59:17,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 10:59:17,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-15 10:59:17,590 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:17,647 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:17,681 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:17,709 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:17,729 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:17,748 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:17,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:17,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 49 [2019-02-15 10:59:17,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2019-02-15 10:59:17,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 64 [2019-02-15 10:59:17,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 59 [2019-02-15 10:59:17,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 10:59:17,902 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:17,904 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:17,906 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:17,908 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:17,910 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:17,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:17,939 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:85, output treesize:54 [2019-02-15 10:59:17,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-15 10:59:18,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:18,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:18,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-02-15 10:59:18,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,362 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:18,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 135 [2019-02-15 10:59:18,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:18,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:18,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:54 [2019-02-15 10:59:20,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:20,705 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:20,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:20,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:20,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:59:20,752 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:20,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:59:20,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:59:20,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:59:20,753 INFO L87 Difference]: Start difference. First operand 38 states and 139 transitions. Second operand 8 states. [2019-02-15 10:59:56,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:56,417 INFO L93 Difference]: Finished difference Result 71 states and 181 transitions. [2019-02-15 10:59:56,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:59:56,418 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:59:56,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:56,419 INFO L225 Difference]: With dead ends: 71 [2019-02-15 10:59:56,419 INFO L226 Difference]: Without dead ends: 70 [2019-02-15 10:59:56,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:59:56,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-02-15 10:59:56,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 38. [2019-02-15 10:59:56,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-15 10:59:56,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 139 transitions. [2019-02-15 10:59:56,430 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 139 transitions. Word has length 4 [2019-02-15 10:59:56,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:56,430 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 139 transitions. [2019-02-15 10:59:56,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:59:56,430 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 139 transitions. [2019-02-15 10:59:56,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:59:56,431 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:56,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:59:56,432 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:56,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:56,432 INFO L82 PathProgramCache]: Analyzing trace with hash 941656, now seen corresponding path program 1 times [2019-02-15 10:59:56,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:56,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:56,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:56,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:56,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:56,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:56,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:56,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:56,526 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:59:56,526 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [31] [2019-02-15 10:59:56,528 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:56,528 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:56,535 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:56,535 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:59:56,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:56,536 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:56,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:56,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:59:56,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:56,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:56,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:57,043 WARN L181 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-02-15 10:59:57,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2019-02-15 10:59:57,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 48 [2019-02-15 10:59:57,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 45 [2019-02-15 10:59:57,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-15 10:59:57,343 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-02-15 10:59:57,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 10:59:57,354 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:57,356 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:57,358 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:57,360 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:57,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:57,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-15 10:59:57,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2019-02-15 10:59:57,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 10:59:57,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 10:59:57,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 10:59:57,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 10:59:57,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-15 10:59:57,483 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:57,539 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:57,571 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:57,595 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:57,613 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:57,629 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:57,642 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:57,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:57,671 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:82, output treesize:54 [2019-02-15 10:59:57,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-15 10:59:57,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:57,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:57,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-02-15 10:59:57,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:57,995 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:57,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 135 [2019-02-15 10:59:57,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:58,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-15 10:59:58,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:54 [2019-02-15 11:00:00,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:00,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:00,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:00,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:00,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:00:00,359 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:00,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:00:00,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:00:00,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:00:00,360 INFO L87 Difference]: Start difference. First operand 38 states and 139 transitions. Second operand 8 states. [2019-02-15 11:00:36,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:36,234 INFO L93 Difference]: Finished difference Result 71 states and 181 transitions. [2019-02-15 11:00:36,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:00:36,236 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:00:36,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:36,237 INFO L225 Difference]: With dead ends: 71 [2019-02-15 11:00:36,237 INFO L226 Difference]: Without dead ends: 69 [2019-02-15 11:00:36,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:00:36,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-15 11:00:36,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 37. [2019-02-15 11:00:36,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-15 11:00:36,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 138 transitions. [2019-02-15 11:00:36,245 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 138 transitions. Word has length 4 [2019-02-15 11:00:36,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:36,245 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 138 transitions. [2019-02-15 11:00:36,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:00:36,246 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 138 transitions. [2019-02-15 11:00:36,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:00:36,246 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:36,246 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:00:36,247 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:36,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:36,247 INFO L82 PathProgramCache]: Analyzing trace with hash 941718, now seen corresponding path program 1 times [2019-02-15 11:00:36,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:36,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:36,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:36,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:36,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:36,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:36,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:36,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:36,392 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:00:36,393 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [31] [2019-02-15 11:00:36,394 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:00:36,394 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:00:36,399 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:00:36,399 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:00:36,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:36,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:00:36,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:36,400 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:00:36,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:36,416 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:00:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:36,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:36,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-15 11:00:36,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2019-02-15 11:00:36,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:00:36,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:00:36,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:00:36,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:00:36,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-15 11:00:36,570 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:36,627 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:36,661 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:36,687 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:36,707 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:36,725 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:36,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:36,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2019-02-15 11:00:36,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2019-02-15 11:00:36,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 11:00:36,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 53 [2019-02-15 11:00:36,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:00:36,872 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:36,874 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:36,876 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:36,879 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:36,883 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:36,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:36,910 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:71, output treesize:54 [2019-02-15 11:00:36,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-15 11:00:37,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:37,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:37,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-02-15 11:00:37,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:37,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 142 [2019-02-15 11:00:37,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:37,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-15 11:00:37,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:56 [2019-02-15 11:00:39,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:39,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:39,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:39,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:39,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:00:39,777 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:39,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:00:39,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:00:39,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:00:39,778 INFO L87 Difference]: Start difference. First operand 37 states and 138 transitions. Second operand 8 states. [2019-02-15 11:01:13,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:01:13,053 INFO L93 Difference]: Finished difference Result 74 states and 200 transitions. [2019-02-15 11:01:13,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:01:13,053 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:01:13,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:01:13,054 INFO L225 Difference]: With dead ends: 74 [2019-02-15 11:01:13,054 INFO L226 Difference]: Without dead ends: 63 [2019-02-15 11:01:13,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:01:13,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-15 11:01:13,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 35. [2019-02-15 11:01:13,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-15 11:01:13,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 155 transitions. [2019-02-15 11:01:13,065 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 155 transitions. Word has length 4 [2019-02-15 11:01:13,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:01:13,065 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 155 transitions. [2019-02-15 11:01:13,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:01:13,065 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 155 transitions. [2019-02-15 11:01:13,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:01:13,066 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:01:13,066 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:01:13,066 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:01:13,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:13,066 INFO L82 PathProgramCache]: Analyzing trace with hash 941284, now seen corresponding path program 1 times [2019-02-15 11:01:13,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:01:13,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:13,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:13,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:13,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:01:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:13,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:13,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:13,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:01:13,143 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:01:13,143 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [31] [2019-02-15 11:01:13,145 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:01:13,145 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:01:13,154 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:01:13,154 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:01:13,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:13,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:01:13,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:13,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:01:13,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:13,166 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:01:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:13,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:01:13,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2019-02-15 11:01:13,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2019-02-15 11:01:13,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-15 11:01:13,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 53 [2019-02-15 11:01:13,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-15 11:01:13,284 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:13,287 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:13,289 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:13,291 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:13,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:13,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-15 11:01:13,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2019-02-15 11:01:13,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:01:13,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:01:13,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:01:13,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:01:13,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-15 11:01:13,392 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:13,448 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:13,479 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:13,503 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:13,522 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:13,537 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:13,551 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:13,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:01:13,580 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:71, output treesize:54 [2019-02-15 11:01:13,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-15 11:01:13,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:13,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 11:01:13,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-02-15 11:01:13,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:13,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 142 [2019-02-15 11:01:13,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:13,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-15 11:01:13,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:56 [2019-02-15 11:01:16,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:16,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:01:16,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:16,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:01:16,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:01:16,277 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:01:16,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:01:16,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:01:16,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:01:16,278 INFO L87 Difference]: Start difference. First operand 35 states and 155 transitions. Second operand 8 states. [2019-02-15 11:01:28,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:01:28,691 INFO L93 Difference]: Finished difference Result 67 states and 213 transitions. [2019-02-15 11:01:28,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:01:28,692 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:01:28,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:01:28,693 INFO L225 Difference]: With dead ends: 67 [2019-02-15 11:01:28,693 INFO L226 Difference]: Without dead ends: 65 [2019-02-15 11:01:28,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:01:28,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-15 11:01:28,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 38. [2019-02-15 11:01:28,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-15 11:01:28,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 178 transitions. [2019-02-15 11:01:28,702 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 178 transitions. Word has length 4 [2019-02-15 11:01:28,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:01:28,703 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 178 transitions. [2019-02-15 11:01:28,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:01:28,703 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 178 transitions. [2019-02-15 11:01:28,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:01:28,703 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:01:28,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:01:28,704 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:01:28,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:28,704 INFO L82 PathProgramCache]: Analyzing trace with hash 930312, now seen corresponding path program 1 times [2019-02-15 11:01:28,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:01:28,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:28,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:28,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:28,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:01:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:28,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:28,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:28,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:01:28,798 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:01:28,799 INFO L207 CegarAbsIntRunner]: [0], [6], [32], [33] [2019-02-15 11:01:28,800 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:01:28,800 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:01:28,807 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:01:28,809 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 11:01:28,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:28,809 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:01:28,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:28,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:01:28,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:28,821 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:01:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:28,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:01:28,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-15 11:01:28,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 27 treesize of output 33 [2019-02-15 11:01:28,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2019-02-15 11:01:28,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2019-02-15 11:01:28,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 63 [2019-02-15 11:01:28,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 85 [2019-02-15 11:01:28,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 104 [2019-02-15 11:01:28,929 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:28,993 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:29,023 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:29,047 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:29,068 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:29,086 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:29,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:29,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2019-02-15 11:01:29,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2019-02-15 11:01:29,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2019-02-15 11:01:29,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 45 [2019-02-15 11:01:29,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 33 [2019-02-15 11:01:29,194 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:29,209 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:29,259 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:29,262 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:29,267 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:29,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 11:01:29,302 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:68, output treesize:59 [2019-02-15 11:01:29,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:29,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 120 [2019-02-15 11:01:29,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-15 11:01:29,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 26 dim-0 vars, and 5 xjuncts. [2019-02-15 11:01:29,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:69, output treesize:236 [2019-02-15 11:01:35,400 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-02-15 11:01:35,601 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 11:01:35,603 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:626) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 45 more [2019-02-15 11:01:35,608 INFO L168 Benchmark]: Toolchain (without parser) took 247177.25 ms. Allocated memory was 141.6 MB in the beginning and 497.5 MB in the end (delta: 356.0 MB). Free memory was 108.6 MB in the beginning and 405.8 MB in the end (delta: -297.2 MB). Peak memory consumption was 58.7 MB. Max. memory is 7.1 GB. [2019-02-15 11:01:35,609 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 141.6 MB. Free memory is still 109.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-15 11:01:35,609 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.38 ms. Allocated memory is still 141.6 MB. Free memory was 108.6 MB in the beginning and 106.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-02-15 11:01:35,609 INFO L168 Benchmark]: Boogie Preprocessor took 24.83 ms. Allocated memory is still 141.6 MB. Free memory was 106.5 MB in the beginning and 105.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-15 11:01:35,610 INFO L168 Benchmark]: RCFGBuilder took 550.37 ms. Allocated memory is still 141.6 MB. Free memory was 105.2 MB in the beginning and 92.8 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2019-02-15 11:01:35,610 INFO L168 Benchmark]: TraceAbstraction took 246535.53 ms. Allocated memory was 141.6 MB in the beginning and 497.5 MB in the end (delta: 356.0 MB). Free memory was 92.4 MB in the beginning and 405.8 MB in the end (delta: -313.4 MB). Peak memory consumption was 42.5 MB. Max. memory is 7.1 GB. [2019-02-15 11:01:35,612 INFO L336 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.18 ms. Allocated memory is still 141.6 MB. Free memory is still 109.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.38 ms. Allocated memory is still 141.6 MB. Free memory was 108.6 MB in the beginning and 106.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.83 ms. Allocated memory is still 141.6 MB. Free memory was 106.5 MB in the beginning and 105.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 550.37 ms. Allocated memory is still 141.6 MB. Free memory was 105.2 MB in the beginning and 92.8 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 246535.53 ms. Allocated memory was 141.6 MB in the beginning and 497.5 MB in the end (delta: 356.0 MB). Free memory was 92.4 MB in the beginning and 405.8 MB in the end (delta: -313.4 MB). Peak memory consumption was 42.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...