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-6-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 17:06:53,415 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 17:06:53,417 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 17:06:53,434 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 17:06:53,434 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 17:06:53,435 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 17:06:53,437 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 17:06:53,438 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 17:06:53,440 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 17:06:53,441 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 17:06:53,442 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 17:06:53,442 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 17:06:53,443 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 17:06:53,444 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 17:06:53,445 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 17:06:53,446 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 17:06:53,447 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 17:06:53,450 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 17:06:53,455 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 17:06:53,457 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 17:06:53,461 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 17:06:53,462 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 17:06:53,469 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 17:06:53,469 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 17:06:53,469 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 17:06:53,470 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 17:06:53,471 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 17:06:53,474 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 17:06:53,476 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 17:06:53,477 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 17:06:53,477 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 17:06:53,478 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 17:06:53,478 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 17:06:53,478 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 17:06:53,479 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 17:06:53,480 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 17:06:53,480 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-01-31 17:06:53,492 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 17:06:53,492 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 17:06:53,493 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 17:06:53,493 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 17:06:53,493 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 17:06:53,494 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 17:06:53,494 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 17:06:53,494 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 17:06:53,494 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 17:06:53,494 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 17:06:53,495 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 17:06:53,495 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 17:06:53,495 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 17:06:53,495 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 17:06:53,496 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 17:06:53,496 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 17:06:53,496 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 17:06:53,496 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 17:06:53,497 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 17:06:53,497 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 17:06:53,497 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 17:06:53,497 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 17:06:53,497 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 17:06:53,497 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 17:06:53,498 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 17:06:53,498 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 17:06:53,498 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 17:06:53,498 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 17:06:53,498 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 17:06:53,499 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 17:06:53,499 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 17:06:53,499 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:06:53,499 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 17:06:53,499 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 17:06:53,500 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 17:06:53,500 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 17:06:53,500 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 17:06:53,500 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 17:06:53,500 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 17:06:53,501 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 17:06:53,539 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 17:06:53,549 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 17:06:53,553 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 17:06:53,554 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 17:06:53,555 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 17:06:53,555 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-limited.bpl [2019-01-31 17:06:53,556 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-limited.bpl' [2019-01-31 17:06:53,593 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 17:06:53,595 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 17:06:53,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 17:06:53,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 17:06:53,596 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 17:06:53,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:53" (1/1) ... [2019-01-31 17:06:53,624 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:53" (1/1) ... [2019-01-31 17:06:53,649 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 17:06:53,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 17:06:53,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 17:06:53,651 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 17:06:53,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:53" (1/1) ... [2019-01-31 17:06:53,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:53" (1/1) ... [2019-01-31 17:06:53,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:53" (1/1) ... [2019-01-31 17:06:53,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:53" (1/1) ... [2019-01-31 17:06:53,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:53" (1/1) ... [2019-01-31 17:06:53,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:53" (1/1) ... [2019-01-31 17:06:53,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:53" (1/1) ... [2019-01-31 17:06:53,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 17:06:53,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 17:06:53,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 17:06:53,675 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 17:06:53,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:53" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:06:53,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 17:06:53,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 17:06:54,165 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 17:06:54,165 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-01-31 17:06:54,167 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:06:54 BoogieIcfgContainer [2019-01-31 17:06:54,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 17:06:54,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 17:06:54,169 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 17:06:54,172 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 17:06:54,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:53" (1/2) ... [2019-01-31 17:06:54,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58b6ba18 and model type speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:06:54, skipping insertion in model container [2019-01-31 17:06:54,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:06:54" (2/2) ... [2019-01-31 17:06:54,176 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-6-limited.bpl [2019-01-31 17:06:54,186 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 17:06:54,195 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-31 17:06:54,213 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-31 17:06:54,276 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 17:06:54,276 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 17:06:54,277 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 17:06:54,277 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 17:06:54,277 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 17:06:54,277 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 17:06:54,277 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 17:06:54,277 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 17:06:54,295 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-31 17:06:54,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-31 17:06:54,301 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:54,302 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-31 17:06:54,305 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:54,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:54,315 INFO L82 PathProgramCache]: Analyzing trace with hash 988, now seen corresponding path program 1 times [2019-01-31 17:06:54,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:54,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:54,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:54,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:54,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:54,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:54,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:06:54,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:06:54,502 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:06:54,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:06:54,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:06:54,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:06:54,518 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2019-01-31 17:06:54,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:54,689 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2019-01-31 17:06:54,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:06:54,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 17:06:54,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:54,706 INFO L225 Difference]: With dead ends: 29 [2019-01-31 17:06:54,706 INFO L226 Difference]: Without dead ends: 24 [2019-01-31 17:06:54,709 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-01-31 17:06:54,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-31 17:06:54,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 14. [2019-01-31 17:06:54,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-31 17:06:54,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2019-01-31 17:06:54,746 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 2 [2019-01-31 17:06:54,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:54,747 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2019-01-31 17:06:54,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:06:54,748 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2019-01-31 17:06:54,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:06:54,748 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:54,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:06:54,749 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:54,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:54,749 INFO L82 PathProgramCache]: Analyzing trace with hash 30376, now seen corresponding path program 1 times [2019-01-31 17:06:54,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:54,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:54,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:54,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:54,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:54,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:54,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:54,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:54,899 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:06:54,901 INFO L207 CegarAbsIntRunner]: [0], [18], [27] [2019-01-31 17:06:54,968 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:54,968 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:55,090 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:55,091 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 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-01-31 17:06:55,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:55,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:55,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:55,099 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-01-31 17:06:55,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:55,112 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:55,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:55,506 WARN L181 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-31 17:06:55,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-31 17:06:55,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:55,605 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 21 treesize of output 24 [2019-01-31 17:06:55,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,643 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 24 treesize of output 30 [2019-01-31 17:06:55,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,673 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 26 treesize of output 40 [2019-01-31 17:06:55,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,696 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 28 treesize of output 54 [2019-01-31 17:06:55,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,755 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 30 treesize of output 72 [2019-01-31 17:06:55,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,787 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:06:55,789 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:55,987 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:56,062 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:56,084 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:56,121 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:56,148 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:56,185 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-01-31 17:06:56,185 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-31 17:06:56,359 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-31 17:06:56,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,550 INFO L303 Elim1Store]: Index analysis took 170 ms [2019-01-31 17:06:56,553 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 41 treesize of output 91 [2019-01-31 17:06:56,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:56,751 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-01-31 17:06:56,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-31 17:06:56,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:56,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:56,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:56,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:56,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:06:56,876 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:56,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:06:56,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:06:56,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:06:56,877 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 6 states. [2019-01-31 17:06:58,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:58,628 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2019-01-31 17:06:58,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:06:58,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:06:58,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:58,631 INFO L225 Difference]: With dead ends: 47 [2019-01-31 17:06:58,631 INFO L226 Difference]: Without dead ends: 45 [2019-01-31 17:06:58,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:06:58,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-31 17:06:58,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 18. [2019-01-31 17:06:58,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-31 17:06:58,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2019-01-31 17:06:58,640 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 3 [2019-01-31 17:06:58,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:58,640 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. [2019-01-31 17:06:58,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:06:58,641 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. [2019-01-31 17:06:58,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:06:58,641 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:58,642 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:06:58,642 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:58,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:58,642 INFO L82 PathProgramCache]: Analyzing trace with hash 30004, now seen corresponding path program 1 times [2019-01-31 17:06:58,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:58,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:58,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:58,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:58,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:58,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:58,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:58,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:58,699 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:06:58,699 INFO L207 CegarAbsIntRunner]: [0], [6], [27] [2019-01-31 17:06:58,703 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:58,703 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:58,718 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:58,718 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 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-01-31 17:06:58,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:58,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:58,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:58,719 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-01-31 17:06:58,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:58,728 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:58,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:58,810 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 21 treesize of output 24 [2019-01-31 17:06:58,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,823 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 24 treesize of output 30 [2019-01-31 17:06:58,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,837 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 26 treesize of output 40 [2019-01-31 17:06:58,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,854 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 28 treesize of output 54 [2019-01-31 17:06:58,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,879 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 30 treesize of output 72 [2019-01-31 17:06:58,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,916 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:06:58,917 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,987 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,051 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,091 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,104 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-31 17:06:59,212 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,240 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-01-31 17:06:59,240 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:45, output treesize:46 [2019-01-31 17:06:59,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,320 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 41 treesize of output 97 [2019-01-31 17:06:59,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,424 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-01-31 17:06:59,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-31 17:06:59,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:59,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:59,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:59,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:06:59,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-31 17:06:59,473 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:06:59,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:06:59,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:06:59,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:06:59,475 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 4 states. [2019-01-31 17:06:59,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:59,542 INFO L93 Difference]: Finished difference Result 23 states and 60 transitions. [2019-01-31 17:06:59,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:06:59,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 17:06:59,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:59,543 INFO L225 Difference]: With dead ends: 23 [2019-01-31 17:06:59,544 INFO L226 Difference]: Without dead ends: 22 [2019-01-31 17:06:59,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:06:59,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-31 17:06:59,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-31 17:06:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-31 17:06:59,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2019-01-31 17:06:59,550 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 59 transitions. Word has length 3 [2019-01-31 17:06:59,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:59,551 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 59 transitions. [2019-01-31 17:06:59,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:06:59,551 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 59 transitions. [2019-01-31 17:06:59,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:06:59,552 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:59,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:06:59,552 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:59,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:59,553 INFO L82 PathProgramCache]: Analyzing trace with hash 30562, now seen corresponding path program 1 times [2019-01-31 17:06:59,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:59,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:59,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:59,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:59,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:59,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:59,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:59,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:59,664 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:06:59,665 INFO L207 CegarAbsIntRunner]: [0], [24], [27] [2019-01-31 17:06:59,667 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:59,667 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:59,676 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:59,676 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 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-01-31 17:06:59,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:59,676 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:59,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:59,677 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-01-31 17:06:59,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:59,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:59,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:59,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-31 17:06:59,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,818 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 21 treesize of output 24 [2019-01-31 17:06:59,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,839 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 24 treesize of output 30 [2019-01-31 17:06:59,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,891 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 26 treesize of output 40 [2019-01-31 17:06:59,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,906 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 28 treesize of output 54 [2019-01-31 17:06:59,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,932 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 30 treesize of output 72 [2019-01-31 17:06:59,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,949 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:06:59,950 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,993 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:00,040 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:00,057 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:00,071 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:00,116 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:00,149 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-01-31 17:07:00,150 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-31 17:07:00,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,258 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 41 treesize of output 97 [2019-01-31 17:07:00,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:00,353 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-01-31 17:07:00,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-31 17:07:00,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:00,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:00,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:00,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:00,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:07:00,491 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:00,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:07:00,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:07:00,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:07:00,492 INFO L87 Difference]: Start difference. First operand 21 states and 59 transitions. Second operand 6 states. [2019-01-31 17:07:01,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:01,914 INFO L93 Difference]: Finished difference Result 50 states and 96 transitions. [2019-01-31 17:07:01,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:07:01,915 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:07:01,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:01,916 INFO L225 Difference]: With dead ends: 50 [2019-01-31 17:07:01,916 INFO L226 Difference]: Without dead ends: 47 [2019-01-31 17:07:01,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:07:01,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-31 17:07:01,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 24. [2019-01-31 17:07:01,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-31 17:07:01,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 74 transitions. [2019-01-31 17:07:01,925 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 74 transitions. Word has length 3 [2019-01-31 17:07:01,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:01,925 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 74 transitions. [2019-01-31 17:07:01,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:07:01,925 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 74 transitions. [2019-01-31 17:07:01,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:07:01,926 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:01,926 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:07:01,926 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:01,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:01,927 INFO L82 PathProgramCache]: Analyzing trace with hash 30128, now seen corresponding path program 1 times [2019-01-31 17:07:01,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:01,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:01,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:01,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:01,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:02,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:02,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:02,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:02,074 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:07:02,074 INFO L207 CegarAbsIntRunner]: [0], [10], [27] [2019-01-31 17:07:02,075 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:02,075 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:02,085 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:02,085 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 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-01-31 17:07:02,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:02,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:02,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:02,086 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-01-31 17:07:02,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:02,099 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:02,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:02,161 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 21 treesize of output 24 [2019-01-31 17:07:02,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,165 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 24 treesize of output 30 [2019-01-31 17:07:02,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,172 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 26 treesize of output 40 [2019-01-31 17:07:02,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,182 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 28 treesize of output 54 [2019-01-31 17:07:02,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,202 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 30 treesize of output 72 [2019-01-31 17:07:02,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,255 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:07:02,255 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,310 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,347 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,395 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,422 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-31 17:07:02,471 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,494 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-01-31 17:07:02,494 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-31 17:07:02,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,539 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 41 treesize of output 97 [2019-01-31 17:07:02,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,629 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-01-31 17:07:02,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-31 17:07:02,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-01-31 17:07:02,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:02,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:02,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:02,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:07:02,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:02,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:07:02,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:07:02,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:07:02,762 INFO L87 Difference]: Start difference. First operand 24 states and 74 transitions. Second operand 6 states. [2019-01-31 17:07:03,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:03,813 INFO L93 Difference]: Finished difference Result 50 states and 108 transitions. [2019-01-31 17:07:03,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:07:03,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:07:03,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:03,815 INFO L225 Difference]: With dead ends: 50 [2019-01-31 17:07:03,815 INFO L226 Difference]: Without dead ends: 48 [2019-01-31 17:07:03,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:07:03,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-31 17:07:03,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 26. [2019-01-31 17:07:03,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-31 17:07:03,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 87 transitions. [2019-01-31 17:07:03,825 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 87 transitions. Word has length 3 [2019-01-31 17:07:03,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:03,826 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 87 transitions. [2019-01-31 17:07:03,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:07:03,827 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 87 transitions. [2019-01-31 17:07:03,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:03,827 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:03,827 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:03,828 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:03,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:03,828 INFO L82 PathProgramCache]: Analyzing trace with hash 941528, now seen corresponding path program 1 times [2019-01-31 17:07:03,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:03,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:03,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:03,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:03,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:03,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:03,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:03,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:03,998 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:07:03,998 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [27] [2019-01-31 17:07:04,000 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:04,000 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:04,007 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:04,007 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 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-01-31 17:07:04,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:04,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:04,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:04,008 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-01-31 17:07:04,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:04,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:04,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:04,139 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 21 treesize of output 24 [2019-01-31 17:07:04,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,143 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 24 treesize of output 30 [2019-01-31 17:07:04,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,153 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 26 treesize of output 40 [2019-01-31 17:07:04,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,184 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 28 treesize of output 54 [2019-01-31 17:07:04,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,287 INFO L303 Elim1Store]: Index analysis took 101 ms [2019-01-31 17:07:04,289 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 30 treesize of output 72 [2019-01-31 17:07:04,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,314 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:07:04,315 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,617 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,641 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,659 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,674 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-31 17:07:04,721 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:04,747 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-31 17:07:04,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,801 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 41 treesize of output 91 [2019-01-31 17:07:04,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:04,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-31 17:07:04,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,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, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 105 [2019-01-31 17:07:04,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,998 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-01-31 17:07:04,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:48 [2019-01-31 17:07:05,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:05,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:05,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:05,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:05,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:05,213 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:05,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:05,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:05,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:05,214 INFO L87 Difference]: Start difference. First operand 26 states and 87 transitions. Second operand 8 states. [2019-01-31 17:07:07,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:07,985 INFO L93 Difference]: Finished difference Result 62 states and 145 transitions. [2019-01-31 17:07:07,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:07,986 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:07:07,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:07,987 INFO L225 Difference]: With dead ends: 62 [2019-01-31 17:07:07,988 INFO L226 Difference]: Without dead ends: 58 [2019-01-31 17:07:07,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:07,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-31 17:07:07,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 30. [2019-01-31 17:07:07,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-31 17:07:07,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 105 transitions. [2019-01-31 17:07:07,997 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 105 transitions. Word has length 4 [2019-01-31 17:07:07,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:07,997 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 105 transitions. [2019-01-31 17:07:07,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:07,997 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 105 transitions. [2019-01-31 17:07:07,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:07,998 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:07,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:07,998 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:07,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:07,999 INFO L82 PathProgramCache]: Analyzing trace with hash 941590, now seen corresponding path program 1 times [2019-01-31 17:07:07,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:07,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:07,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:08,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:08,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:08,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:08,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:08,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:08,100 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:07:08,100 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [27] [2019-01-31 17:07:08,101 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:08,101 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:08,107 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:08,108 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 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-01-31 17:07:08,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:08,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:08,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:08,108 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-01-31 17:07:08,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:08,117 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:08,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:08,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-31 17:07:08,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,189 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 21 treesize of output 24 [2019-01-31 17:07:08,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,193 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 24 treesize of output 30 [2019-01-31 17:07:08,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,199 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 26 treesize of output 40 [2019-01-31 17:07:08,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,213 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 28 treesize of output 54 [2019-01-31 17:07:08,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,226 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 30 treesize of output 72 [2019-01-31 17:07:08,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,239 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:07:08,240 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,281 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,303 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,318 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,331 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,343 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:08,368 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-31 17:07:08,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,414 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 41 treesize of output 91 [2019-01-31 17:07:08,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:08,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-31 17:07:08,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,546 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:08,547 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 43 treesize of output 106 [2019-01-31 17:07:08,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,627 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-01-31 17:07:08,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-31 17:07:08,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:08,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:08,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:08,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:08,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:08,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:08,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:08,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:08,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:08,857 INFO L87 Difference]: Start difference. First operand 30 states and 105 transitions. Second operand 8 states. [2019-01-31 17:07:11,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:11,647 INFO L93 Difference]: Finished difference Result 60 states and 147 transitions. [2019-01-31 17:07:11,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:11,648 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:07:11,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:11,650 INFO L225 Difference]: With dead ends: 60 [2019-01-31 17:07:11,650 INFO L226 Difference]: Without dead ends: 56 [2019-01-31 17:07:11,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:11,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-31 17:07:11,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2019-01-31 17:07:11,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-31 17:07:11,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 110 transitions. [2019-01-31 17:07:11,659 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 110 transitions. Word has length 4 [2019-01-31 17:07:11,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:11,660 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 110 transitions. [2019-01-31 17:07:11,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:11,660 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 110 transitions. [2019-01-31 17:07:11,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:11,660 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:11,661 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:11,661 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:11,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:11,661 INFO L82 PathProgramCache]: Analyzing trace with hash 941156, now seen corresponding path program 1 times [2019-01-31 17:07:11,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:11,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:11,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:11,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:11,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:11,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:11,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:11,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:11,763 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:07:11,763 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [27] [2019-01-31 17:07:11,765 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:11,765 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:11,771 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:11,771 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 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-01-31 17:07:11,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:11,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:11,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:11,772 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-01-31 17:07:11,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:11,782 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:11,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:11,835 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 21 treesize of output 24 [2019-01-31 17:07:11,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,840 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 24 treesize of output 30 [2019-01-31 17:07:11,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,848 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 26 treesize of output 40 [2019-01-31 17:07:11,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,869 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 28 treesize of output 54 [2019-01-31 17:07:11,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,898 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 30 treesize of output 72 [2019-01-31 17:07:11,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,910 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:07:11,911 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,955 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,977 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,000 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,012 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-31 17:07:12,053 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:12,075 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-31 17:07:12,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,137 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 41 treesize of output 91 [2019-01-31 17:07:12,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:12,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-31 17:07:12,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,260 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:12,262 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 43 treesize of output 106 [2019-01-31 17:07:12,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,328 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-01-31 17:07:12,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:46 [2019-01-31 17:07:12,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:12,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:12,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:12,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:12,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:12,520 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:12,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:12,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:12,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:12,521 INFO L87 Difference]: Start difference. First operand 30 states and 110 transitions. Second operand 8 states. [2019-01-31 17:07:15,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:15,216 INFO L93 Difference]: Finished difference Result 57 states and 144 transitions. [2019-01-31 17:07:15,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:15,217 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:07:15,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:15,218 INFO L225 Difference]: With dead ends: 57 [2019-01-31 17:07:15,218 INFO L226 Difference]: Without dead ends: 55 [2019-01-31 17:07:15,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:15,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-31 17:07:15,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-01-31 17:07:15,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-31 17:07:15,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2019-01-31 17:07:15,227 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 109 transitions. Word has length 4 [2019-01-31 17:07:15,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:15,227 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 109 transitions. [2019-01-31 17:07:15,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:15,228 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 109 transitions. [2019-01-31 17:07:15,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:15,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:15,228 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:15,229 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:15,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:15,229 INFO L82 PathProgramCache]: Analyzing trace with hash 941280, now seen corresponding path program 1 times [2019-01-31 17:07:15,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:15,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:15,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:15,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:15,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:15,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:15,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:15,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:15,335 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:07:15,335 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [27] [2019-01-31 17:07:15,336 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:15,336 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:15,342 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:15,343 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 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-01-31 17:07:15,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:15,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:15,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:15,343 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-01-31 17:07:15,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:15,360 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:15,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:15,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:15,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-31 17:07:15,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,436 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 21 treesize of output 24 [2019-01-31 17:07:15,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,444 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 24 treesize of output 30 [2019-01-31 17:07:15,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,450 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 26 treesize of output 40 [2019-01-31 17:07:15,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,455 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 28 treesize of output 54 [2019-01-31 17:07:15,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,469 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 30 treesize of output 72 [2019-01-31 17:07:15,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,497 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:07:15,498 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,640 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,671 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,693 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,715 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,730 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:15,757 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-01-31 17:07:15,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,836 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 41 treesize of output 91 [2019-01-31 17:07:15,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:15,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-31 17:07:15,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-31 17:07:15,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:16,024 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-01-31 17:07:16,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:48 [2019-01-31 17:07:16,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:16,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:16,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:16,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:16,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:16,215 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:16,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:16,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:16,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:16,216 INFO L87 Difference]: Start difference. First operand 30 states and 109 transitions. Second operand 8 states. [2019-01-31 17:07:18,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:18,266 INFO L93 Difference]: Finished difference Result 57 states and 158 transitions. [2019-01-31 17:07:18,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:18,268 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:07:18,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:18,269 INFO L225 Difference]: With dead ends: 57 [2019-01-31 17:07:18,269 INFO L226 Difference]: Without dead ends: 53 [2019-01-31 17:07:18,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:18,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-31 17:07:18,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 31. [2019-01-31 17:07:18,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-31 17:07:18,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 126 transitions. [2019-01-31 17:07:18,278 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 126 transitions. Word has length 4 [2019-01-31 17:07:18,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:18,278 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 126 transitions. [2019-01-31 17:07:18,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:18,278 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 126 transitions. [2019-01-31 17:07:18,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:18,279 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:18,279 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:18,279 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:18,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:18,280 INFO L82 PathProgramCache]: Analyzing trace with hash 929872, now seen corresponding path program 1 times [2019-01-31 17:07:18,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:18,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:18,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:18,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:18,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:18,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:18,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:18,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:18,363 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:07:18,363 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [27] [2019-01-31 17:07:18,365 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:18,365 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:18,375 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:18,377 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 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-01-31 17:07:18,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:18,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:18,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:18,378 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-01-31 17:07:18,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:18,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:18,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:18,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-31 17:07:18,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:18,464 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 21 treesize of output 24 [2019-01-31 17:07:18,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,470 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 24 treesize of output 30 [2019-01-31 17:07:18,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,476 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 26 treesize of output 40 [2019-01-31 17:07:18,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,483 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 28 treesize of output 54 [2019-01-31 17:07:18,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,490 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 30 treesize of output 72 [2019-01-31 17:07:18,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,540 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:07:18,540 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:18,579 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:18,600 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:18,618 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:18,631 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:18,642 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:18,666 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-01-31 17:07:18,666 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-31 17:07:18,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,710 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 41 treesize of output 97 [2019-01-31 17:07:18,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:18,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:18,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-31 17:07:18,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:18,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-31 17:07:18,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:18,914 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-01-31 17:07:18,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-31 17:07:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:18,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:19,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:19,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:19,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:19,036 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:19,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:19,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:19,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:19,037 INFO L87 Difference]: Start difference. First operand 31 states and 126 transitions. Second operand 8 states. [2019-01-31 17:07:20,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:20,720 INFO L93 Difference]: Finished difference Result 77 states and 200 transitions. [2019-01-31 17:07:20,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:20,721 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:07:20,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:20,722 INFO L225 Difference]: With dead ends: 77 [2019-01-31 17:07:20,723 INFO L226 Difference]: Without dead ends: 75 [2019-01-31 17:07:20,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:07:20,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-31 17:07:20,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 38. [2019-01-31 17:07:20,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-31 17:07:20,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 159 transitions. [2019-01-31 17:07:20,734 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 159 transitions. Word has length 4 [2019-01-31 17:07:20,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:20,734 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 159 transitions. [2019-01-31 17:07:20,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:20,735 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 159 transitions. [2019-01-31 17:07:20,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:20,735 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:20,735 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:20,736 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:20,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:20,736 INFO L82 PathProgramCache]: Analyzing trace with hash 930058, now seen corresponding path program 1 times [2019-01-31 17:07:20,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:20,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:20,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:20,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:20,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:20,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:20,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:20,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:20,838 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:07:20,838 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [27] [2019-01-31 17:07:20,839 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:20,839 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:20,845 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:20,845 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 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-01-31 17:07:20,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:20,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:20,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:20,846 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-01-31 17:07:20,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:20,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:20,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:20,924 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 21 treesize of output 24 [2019-01-31 17:07:20,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,933 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 24 treesize of output 30 [2019-01-31 17:07:20,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,943 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 26 treesize of output 40 [2019-01-31 17:07:20,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,954 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 28 treesize of output 54 [2019-01-31 17:07:20,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,967 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 30 treesize of output 72 [2019-01-31 17:07:20,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,987 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-31 17:07:20,988 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,039 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,061 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,078 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,093 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-31 17:07:21,133 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,156 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-01-31 17:07:21,157 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-01-31 17:07:21,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,204 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 41 treesize of output 97 [2019-01-31 17:07:21,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:21,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:46 [2019-01-31 17:07:21,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-31 17:07:21,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,386 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-01-31 17:07:21,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-01-31 17:07:21,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:21,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:21,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:21,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:21,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:07:21,801 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:21,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:21,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:21,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:07:21,802 INFO L87 Difference]: Start difference. First operand 38 states and 159 transitions. Second operand 8 states. [2019-01-31 17:07:23,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:23,482 INFO L93 Difference]: Finished difference Result 82 states and 241 transitions. [2019-01-31 17:07:23,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:23,483 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:07:23,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:23,484 INFO L225 Difference]: With dead ends: 82 [2019-01-31 17:07:23,484 INFO L226 Difference]: Without dead ends: 79 [2019-01-31 17:07:23,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:23,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-31 17:07:23,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 46. [2019-01-31 17:07:23,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-31 17:07:23,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 209 transitions. [2019-01-31 17:07:23,499 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 209 transitions. Word has length 4 [2019-01-31 17:07:23,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:23,499 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 209 transitions. [2019-01-31 17:07:23,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:23,500 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 209 transitions. [2019-01-31 17:07:23,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:07:23,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:23,500 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:07:23,501 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:23,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:23,501 INFO L82 PathProgramCache]: Analyzing trace with hash 930184, now seen corresponding path program 1 times [2019-01-31 17:07:23,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:23,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:23,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:23,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:23,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:23,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:23,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:23,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:23,569 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:07:23,569 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [29] [2019-01-31 17:07:23,571 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:23,571 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:23,579 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:23,579 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 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-01-31 17:07:23,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:23,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:23,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:23,580 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-01-31 17:07:23,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:23,588 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:23,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:23,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-31 17:07:23,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,639 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 21 treesize of output 24 [2019-01-31 17:07:23,642 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 24 treesize of output 30 [2019-01-31 17:07:23,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,648 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 26 treesize of output 36 [2019-01-31 17:07:23,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,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 28 treesize of output 46 [2019-01-31 17:07:23,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,671 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 30 treesize of output 60 [2019-01-31 17:07:23,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,687 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 75 [2019-01-31 17:07:23,687 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,718 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,738 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,753 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,767 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,779 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,803 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-01-31 17:07:23,803 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:42, output treesize:47 [2019-01-31 17:07:33,840 WARN L181 SmtUtils]: Spent 10.03 s on a formula simplification that was a NOOP. DAG size: 29 [2019-01-31 17:07:33,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 41 treesize of output 91 [2019-01-31 17:07:33,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-31 17:07:34,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 5 xjuncts. [2019-01-31 17:07:34,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:196 [2019-01-31 17:08:31,762 WARN L181 SmtUtils]: Spent 57.27 s on a formula simplification that was a NOOP. DAG size: 106 [2019-01-31 17:08:31,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:31,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:31,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:31,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:31,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:08:31,807 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:31,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:08:31,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:08:31,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:08:31,808 INFO L87 Difference]: Start difference. First operand 46 states and 209 transitions. Second operand 6 states. [2019-01-31 17:10:08,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:10:08,524 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:8092 -smt2 -in -t:10000)Received EOF on stdin. No stderr output. 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:191) 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.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) 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) ... 49 more [2019-01-31 17:10:08,529 INFO L168 Benchmark]: Toolchain (without parser) took 194935.11 ms. Allocated memory was 133.7 MB in the beginning and 367.0 MB in the end (delta: 233.3 MB). Free memory was 108.9 MB in the beginning and 89.6 MB in the end (delta: 19.3 MB). Peak memory consumption was 252.6 MB. Max. memory is 7.1 GB. [2019-01-31 17:10:08,529 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 133.7 MB. Free memory is still 110.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 17:10:08,530 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.46 ms. Allocated memory is still 133.7 MB. Free memory was 108.7 MB in the beginning and 106.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-01-31 17:10:08,530 INFO L168 Benchmark]: Boogie Preprocessor took 23.95 ms. Allocated memory is still 133.7 MB. Free memory was 106.4 MB in the beginning and 105.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-31 17:10:08,531 INFO L168 Benchmark]: RCFGBuilder took 492.60 ms. Allocated memory is still 133.7 MB. Free memory was 105.2 MB in the beginning and 93.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. [2019-01-31 17:10:08,531 INFO L168 Benchmark]: TraceAbstraction took 194359.80 ms. Allocated memory was 133.7 MB in the beginning and 367.0 MB in the end (delta: 233.3 MB). Free memory was 93.2 MB in the beginning and 89.6 MB in the end (delta: 3.6 MB). Peak memory consumption was 236.9 MB. Max. memory is 7.1 GB. [2019-01-31 17:10:08,533 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.16 ms. Allocated memory is still 133.7 MB. Free memory is still 110.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.46 ms. Allocated memory is still 133.7 MB. Free memory was 108.7 MB in the beginning and 106.4 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.95 ms. Allocated memory is still 133.7 MB. Free memory was 106.4 MB in the beginning and 105.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 492.60 ms. Allocated memory is still 133.7 MB. Free memory was 105.2 MB in the beginning and 93.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 194359.80 ms. Allocated memory was 133.7 MB in the beginning and 367.0 MB in the end (delta: 233.3 MB). Free memory was 93.2 MB in the beginning and 89.6 MB in the end (delta: 3.6 MB). Peak memory consumption was 236.9 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:8092 -smt2 -in -t:10000)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000)Received EOF on stdin. No stderr output.: 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...