java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-18 09:38:50,592 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-18 09:38:50,594 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-18 09:38:50,604 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-18 09:38:50,604 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-18 09:38:50,605 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-18 09:38:50,606 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-18 09:38:50,608 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-18 09:38:50,610 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-18 09:38:50,611 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-18 09:38:50,611 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-18 09:38:50,612 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-18 09:38:50,613 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-18 09:38:50,614 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-18 09:38:50,615 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-18 09:38:50,615 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-18 09:38:50,616 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-18 09:38:50,620 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-18 09:38:50,624 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-18 09:38:50,625 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-18 09:38:50,629 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-18 09:38:50,630 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-18 09:38:50,634 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-18 09:38:50,634 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-18 09:38:50,634 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-18 09:38:50,635 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-18 09:38:50,639 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-18 09:38:50,640 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-18 09:38:50,641 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-18 09:38:50,642 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-18 09:38:50,643 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-18 09:38:50,643 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-18 09:38:50,643 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-18 09:38:50,644 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-18 09:38:50,645 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-18 09:38:50,645 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-18 09:38:50,646 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-18 09:38:50,664 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-18 09:38:50,664 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-18 09:38:50,665 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-18 09:38:50,665 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-18 09:38:50,666 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-18 09:38:50,666 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-18 09:38:50,666 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-18 09:38:50,666 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-18 09:38:50,666 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-18 09:38:50,667 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-18 09:38:50,667 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-18 09:38:50,667 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-18 09:38:50,667 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-18 09:38:50,667 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-18 09:38:50,668 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-18 09:38:50,668 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-18 09:38:50,668 INFO L133 SettingsManager]: * Use SBE=true [2019-02-18 09:38:50,669 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-18 09:38:50,669 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-18 09:38:50,669 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-18 09:38:50,669 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-18 09:38:50,669 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-18 09:38:50,670 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-18 09:38:50,670 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-18 09:38:50,670 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-18 09:38:50,670 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-18 09:38:50,670 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-18 09:38:50,671 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-18 09:38:50,671 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-18 09:38:50,671 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-18 09:38:50,671 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-18 09:38:50,671 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:38:50,672 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-18 09:38:50,672 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-18 09:38:50,672 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-18 09:38:50,672 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-18 09:38:50,672 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-18 09:38:50,672 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-02-18 09:38:50,673 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-18 09:38:50,673 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-18 09:38:50,708 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-18 09:38:50,721 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-18 09:38:50,726 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-18 09:38:50,727 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-18 09:38:50,728 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-18 09:38:50,728 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl [2019-02-18 09:38:50,729 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl' [2019-02-18 09:38:50,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-18 09:38:50,770 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-18 09:38:50,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-18 09:38:50,771 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-18 09:38:50,771 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-18 09:38:50,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:50" (1/1) ... [2019-02-18 09:38:50,799 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:50" (1/1) ... [2019-02-18 09:38:50,835 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-18 09:38:50,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-18 09:38:50,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-18 09:38:50,836 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-18 09:38:50,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:50" (1/1) ... [2019-02-18 09:38:50,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:50" (1/1) ... [2019-02-18 09:38:50,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:50" (1/1) ... [2019-02-18 09:38:50,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:50" (1/1) ... [2019-02-18 09:38:50,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:50" (1/1) ... [2019-02-18 09:38:50,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:50" (1/1) ... [2019-02-18 09:38:50,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:50" (1/1) ... [2019-02-18 09:38:50,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-18 09:38:50,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-18 09:38:50,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-18 09:38:50,863 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-18 09:38:50,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:50" (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-02-18 09:38:50,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-18 09:38:50,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-18 09:38:51,377 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-18 09:38:51,378 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-02-18 09:38:51,379 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:38:51 BoogieIcfgContainer [2019-02-18 09:38:51,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-18 09:38:51,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-18 09:38:51,380 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-18 09:38:51,383 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-18 09:38:51,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:38:50" (1/2) ... [2019-02-18 09:38:51,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64457d1a and model type speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 09:38:51, skipping insertion in model container [2019-02-18 09:38:51,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:38:51" (2/2) ... [2019-02-18 09:38:51,386 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-7-limited.bpl [2019-02-18 09:38:51,394 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-18 09:38:51,401 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-02-18 09:38:51,416 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-02-18 09:38:51,445 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-18 09:38:51,445 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-18 09:38:51,445 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-18 09:38:51,445 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-18 09:38:51,445 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-18 09:38:51,446 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-18 09:38:51,446 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-18 09:38:51,446 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-18 09:38:51,461 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-02-18 09:38:51,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-18 09:38:51,467 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:51,468 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-18 09:38:51,471 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:51,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:51,477 INFO L82 PathProgramCache]: Analyzing trace with hash 992, now seen corresponding path program 1 times [2019-02-18 09:38:51,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:51,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:51,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:51,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:51,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:51,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:51,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:38:51,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 09:38:51,695 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:38:51,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:38:51,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:38:51,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:38:51,719 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-02-18 09:38:51,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:51,879 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-02-18 09:38:51,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:38:51,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-18 09:38:51,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:51,895 INFO L225 Difference]: With dead ends: 33 [2019-02-18 09:38:51,895 INFO L226 Difference]: Without dead ends: 28 [2019-02-18 09:38:51,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:38:51,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-18 09:38:51,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2019-02-18 09:38:51,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-18 09:38:51,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2019-02-18 09:38:51,940 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 2 [2019-02-18 09:38:51,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:51,951 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2019-02-18 09:38:51,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:38:51,951 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2019-02-18 09:38:51,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:38:51,952 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:51,952 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:38:51,953 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:51,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:51,953 INFO L82 PathProgramCache]: Analyzing trace with hash 30816, now seen corresponding path program 1 times [2019-02-18 09:38:51,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:51,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:51,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:51,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:51,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:52,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:52,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:38:52,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 09:38:52,037 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:38:52,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:38:52,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:38:52,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:38:52,041 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 3 states. [2019-02-18 09:38:52,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:52,400 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-02-18 09:38:52,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:38:52,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-18 09:38:52,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:52,402 INFO L225 Difference]: With dead ends: 28 [2019-02-18 09:38:52,402 INFO L226 Difference]: Without dead ends: 27 [2019-02-18 09:38:52,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:38:52,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-18 09:38:52,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2019-02-18 09:38:52,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-18 09:38:52,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2019-02-18 09:38:52,408 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 3 [2019-02-18 09:38:52,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:52,408 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 30 transitions. [2019-02-18 09:38:52,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:38:52,409 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 30 transitions. [2019-02-18 09:38:52,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:38:52,409 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:52,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:38:52,410 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:52,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:52,410 INFO L82 PathProgramCache]: Analyzing trace with hash 30380, now seen corresponding path program 1 times [2019-02-18 09:38:52,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:52,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:52,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:52,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:52,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:52,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:52,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:52,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:52,571 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 09:38:52,573 INFO L207 CegarAbsIntRunner]: [0], [18], [31] [2019-02-18 09:38:52,610 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:38:52,611 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:38:52,688 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:38:52,689 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 3. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:38:52,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:52,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:38:52,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:52,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:52,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:52,713 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:38:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:52,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:52,954 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-02-18 09:38:53,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2019-02-18 09:38:53,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2019-02-18 09:38:53,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:38:53,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 53 [2019-02-18 09:38:53,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 09:38:53,204 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,209 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,212 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,219 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-18 09:38:53,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-18 09:38:53,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-18 09:38:53,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-18 09:38:53,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-18 09:38:53,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-18 09:38:53,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:53,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-18 09:38:53,441 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,862 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,917 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,951 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,973 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:53,996 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,015 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:54,141 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:71, output treesize:54 [2019-02-18 09:38:54,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:38:54,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-18 09:38:54,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:38:54,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-18 09:38:54,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:54 [2019-02-18 09:38:55,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:55,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:55,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:38:55,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:55,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:38:55,715 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:55,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:38:55,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:38:55,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:38:55,716 INFO L87 Difference]: Start difference. First operand 17 states and 30 transitions. Second operand 6 states. [2019-02-18 09:39:20,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:20,276 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2019-02-18 09:39:20,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:39:20,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-18 09:39:20,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:20,279 INFO L225 Difference]: With dead ends: 54 [2019-02-18 09:39:20,279 INFO L226 Difference]: Without dead ends: 52 [2019-02-18 09:39:20,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-18 09:39:20,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-18 09:39:20,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 20. [2019-02-18 09:39:20,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-18 09:39:20,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 41 transitions. [2019-02-18 09:39:20,286 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 41 transitions. Word has length 3 [2019-02-18 09:39:20,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:20,286 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 41 transitions. [2019-02-18 09:39:20,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:39:20,287 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 41 transitions. [2019-02-18 09:39:20,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:39:20,287 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:20,287 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:39:20,288 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:20,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:20,288 INFO L82 PathProgramCache]: Analyzing trace with hash 30008, now seen corresponding path program 1 times [2019-02-18 09:39:20,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:20,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:20,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:20,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:20,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:20,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:20,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:20,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:20,355 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 09:39:20,355 INFO L207 CegarAbsIntRunner]: [0], [6], [31] [2019-02-18 09:39:20,356 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:20,357 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:20,368 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:20,368 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 3. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:39:20,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:20,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:20,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:20,369 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:20,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:20,379 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:20,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:20,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-18 09:39:20,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-18 09:39:20,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-18 09:39:20,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-18 09:39:20,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-18 09:39:20,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-18 09:39:20,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:20,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-18 09:39:20,661 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:20,734 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:20,777 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:20,805 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:20,829 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:20,849 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:20,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:21,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2019-02-18 09:39:21,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2019-02-18 09:39:21,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:39:21,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 53 [2019-02-18 09:39:21,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 09:39:21,154 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:21,158 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:21,164 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:21,166 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:21,168 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:21,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:21,203 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:71, output treesize:54 [2019-02-18 09:39:21,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 126 [2019-02-18 09:39:21,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:21,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:21,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:54 [2019-02-18 09:39:21,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:21,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:21,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 09:39:21,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-18 09:39:21,476 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:39:21,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:39:21,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:39:21,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:39:21,477 INFO L87 Difference]: Start difference. First operand 20 states and 41 transitions. Second operand 4 states. [2019-02-18 09:39:21,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:21,569 INFO L93 Difference]: Finished difference Result 25 states and 67 transitions. [2019-02-18 09:39:21,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 09:39:21,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-18 09:39:21,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:21,570 INFO L225 Difference]: With dead ends: 25 [2019-02-18 09:39:21,570 INFO L226 Difference]: Without dead ends: 24 [2019-02-18 09:39:21,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:39:21,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-18 09:39:21,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-02-18 09:39:21,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-18 09:39:21,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-02-18 09:39:21,577 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 3 [2019-02-18 09:39:21,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:21,577 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-02-18 09:39:21,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:39:21,577 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-02-18 09:39:21,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:39:21,578 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:21,578 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:39:21,578 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:21,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:21,579 INFO L82 PathProgramCache]: Analyzing trace with hash 30132, now seen corresponding path program 1 times [2019-02-18 09:39:21,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:21,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:21,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:21,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:21,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:21,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:21,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:21,648 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 09:39:21,650 INFO L207 CegarAbsIntRunner]: [0], [10], [31] [2019-02-18 09:39:21,651 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:21,651 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:21,661 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:21,661 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 3. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:39:21,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:21,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:21,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:21,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:21,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:21,672 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:21,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:21,811 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-02-18 09:39:21,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-18 09:39:21,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-18 09:39:21,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-18 09:39:21,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-18 09:39:21,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-18 09:39:21,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:21,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-18 09:39:22,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-18 09:39:22,038 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:22,135 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:22,241 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:22,271 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:22,293 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:22,313 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:22,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:22,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2019-02-18 09:39:22,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 48 [2019-02-18 09:39:22,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 45 [2019-02-18 09:39:22,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 09:39:22,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 09:39:22,516 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:22,518 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:22,536 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:22,538 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:22,539 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:22,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:22,570 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:82, output treesize:54 [2019-02-18 09:39:22,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:22,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 126 [2019-02-18 09:39:22,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:22,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:22,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:54 [2019-02-18 09:39:23,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:23,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:23,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:23,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:23,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:39:23,951 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:23,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:39:23,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:39:23,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:39:23,952 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 6 states. [2019-02-18 09:39:44,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:39:44,984 INFO L93 Difference]: Finished difference Result 57 states and 111 transitions. [2019-02-18 09:39:44,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:39:44,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-18 09:39:44,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:39:44,986 INFO L225 Difference]: With dead ends: 57 [2019-02-18 09:39:44,986 INFO L226 Difference]: Without dead ends: 56 [2019-02-18 09:39:44,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-18 09:39:44,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-18 09:39:44,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 25. [2019-02-18 09:39:44,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-18 09:39:44,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2019-02-18 09:39:44,995 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 82 transitions. Word has length 3 [2019-02-18 09:39:44,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:39:44,995 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 82 transitions. [2019-02-18 09:39:44,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:39:44,995 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 82 transitions. [2019-02-18 09:39:44,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:39:44,996 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:39:44,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:39:44,996 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:39:44,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:44,997 INFO L82 PathProgramCache]: Analyzing trace with hash 30628, now seen corresponding path program 1 times [2019-02-18 09:39:44,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:39:44,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:44,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:44,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:39:44,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:39:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:45,295 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-02-18 09:39:45,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:45,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:45,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:39:45,366 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 09:39:45,366 INFO L207 CegarAbsIntRunner]: [0], [26], [31] [2019-02-18 09:39:45,368 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:39:45,368 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:39:45,383 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:39:45,386 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 3. Performed 86 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:39:45,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:39:45,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:39:45,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:39:45,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:39:45,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:39:45,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:39:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:39:45,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:39:45,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-18 09:39:45,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-18 09:39:45,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-18 09:39:45,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-18 09:39:45,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-18 09:39:45,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-18 09:39:45,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-18 09:39:45,580 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:45,643 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:45,679 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:45,707 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:45,728 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:45,746 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:45,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:45,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2019-02-18 09:39:45,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 48 [2019-02-18 09:39:45,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 45 [2019-02-18 09:39:45,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 09:39:45,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:45,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 09:39:45,942 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:45,945 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:45,946 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:45,948 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:45,951 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:39:45,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:45,985 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:82, output treesize:54 [2019-02-18 09:39:46,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,037 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:39:46,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 126 [2019-02-18 09:39:46,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:39:46,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-18 09:39:46,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:54 [2019-02-18 09:39:47,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:47,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:39:47,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:39:47,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:39:47,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:39:47,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:39:47,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:39:47,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:39:47,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:39:47,365 INFO L87 Difference]: Start difference. First operand 25 states and 82 transitions. Second operand 6 states. [2019-02-18 09:40:08,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:08,568 INFO L93 Difference]: Finished difference Result 59 states and 127 transitions. [2019-02-18 09:40:08,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:40:08,569 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-18 09:40:08,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:08,570 INFO L225 Difference]: With dead ends: 59 [2019-02-18 09:40:08,570 INFO L226 Difference]: Without dead ends: 57 [2019-02-18 09:40:08,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-18 09:40:08,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-18 09:40:08,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2019-02-18 09:40:08,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-18 09:40:08,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 101 transitions. [2019-02-18 09:40:08,579 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 101 transitions. Word has length 3 [2019-02-18 09:40:08,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:08,579 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 101 transitions. [2019-02-18 09:40:08,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:40:08,579 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 101 transitions. [2019-02-18 09:40:08,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:40:08,580 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:08,580 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:40:08,580 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:08,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:08,581 INFO L82 PathProgramCache]: Analyzing trace with hash 955362, now seen corresponding path program 1 times [2019-02-18 09:40:08,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:08,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:08,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:08,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:08,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:08,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:40:08,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 09:40:08,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:40:08,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:40:08,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:40:08,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:40:08,628 INFO L87 Difference]: Start difference. First operand 29 states and 101 transitions. Second operand 3 states. [2019-02-18 09:40:08,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:08,790 INFO L93 Difference]: Finished difference Result 33 states and 102 transitions. [2019-02-18 09:40:08,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:40:08,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-18 09:40:08,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:08,792 INFO L225 Difference]: With dead ends: 33 [2019-02-18 09:40:08,792 INFO L226 Difference]: Without dead ends: 32 [2019-02-18 09:40:08,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:40:08,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-02-18 09:40:08,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-02-18 09:40:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-18 09:40:08,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 100 transitions. [2019-02-18 09:40:08,800 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 100 transitions. Word has length 4 [2019-02-18 09:40:08,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:08,800 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 100 transitions. [2019-02-18 09:40:08,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:40:08,800 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 100 transitions. [2019-02-18 09:40:08,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:40:08,801 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:08,801 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:40:08,801 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:08,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:08,802 INFO L82 PathProgramCache]: Analyzing trace with hash 941844, now seen corresponding path program 1 times [2019-02-18 09:40:08,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:08,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:08,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:08,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:08,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:08,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:08,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:08,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:08,869 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:40:08,869 INFO L207 CegarAbsIntRunner]: [0], [18], [32], [33] [2019-02-18 09:40:08,871 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:08,871 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:08,882 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:08,882 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:40:08,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:08,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:08,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:08,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:40:08,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:08,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:08,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:08,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2019-02-18 09:40:08,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-18 09:40:08,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:08,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-02-18 09:40:08,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:08,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:08,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2019-02-18 09:40:08,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:08,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:08,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:08,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:08,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:08,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2019-02-18 09:40:08,990 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:09,004 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:09,009 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:09,012 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:09,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:09,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-18 09:40:09,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-02-18 09:40:09,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2019-02-18 09:40:09,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 09:40:09,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 09:40:09,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-02-18 09:40:09,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 100 [2019-02-18 09:40:09,125 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:09,169 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:09,192 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:09,211 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:09,225 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:09,239 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:09,253 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:09,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:09,282 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:60, output treesize:55 [2019-02-18 09:40:09,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:09,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 104 [2019-02-18 09:40:09,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 09:40:09,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 2 xjuncts. [2019-02-18 09:40:09,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:104 [2019-02-18 09:40:11,059 WARN L181 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2019-02-18 09:40:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:11,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:11,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:11,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 09:40:11,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-18 09:40:11,134 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:40:11,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:40:11,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:40:11,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:40:11,135 INFO L87 Difference]: Start difference. First operand 29 states and 100 transitions. Second operand 4 states. [2019-02-18 09:40:11,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:11,189 INFO L93 Difference]: Finished difference Result 33 states and 111 transitions. [2019-02-18 09:40:11,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:40:11,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-18 09:40:11,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:11,193 INFO L225 Difference]: With dead ends: 33 [2019-02-18 09:40:11,193 INFO L226 Difference]: Without dead ends: 32 [2019-02-18 09:40:11,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:40:11,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-02-18 09:40:11,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-02-18 09:40:11,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-18 09:40:11,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 110 transitions. [2019-02-18 09:40:11,202 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 110 transitions. Word has length 4 [2019-02-18 09:40:11,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:11,202 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 110 transitions. [2019-02-18 09:40:11,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:40:11,202 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 110 transitions. [2019-02-18 09:40:11,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:40:11,203 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:11,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:40:11,203 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:11,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:11,204 INFO L82 PathProgramCache]: Analyzing trace with hash 941532, now seen corresponding path program 1 times [2019-02-18 09:40:11,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:11,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:11,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:11,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:11,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:11,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:11,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:11,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:11,318 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:40:11,318 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [31] [2019-02-18 09:40:11,319 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:11,319 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:11,326 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:11,326 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:40:11,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:11,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:11,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:11,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:40:11,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:11,338 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:11,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:11,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-18 09:40:11,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-18 09:40:11,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-18 09:40:11,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-18 09:40:11,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-18 09:40:11,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-18 09:40:11,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-18 09:40:11,520 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:11,575 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:11,609 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:11,636 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:11,659 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:11,676 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:11,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:11,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2019-02-18 09:40:11,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2019-02-18 09:40:11,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:40:11,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 53 [2019-02-18 09:40:11,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 09:40:11,798 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:11,800 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:11,801 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:11,803 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:11,829 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:11,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:11,911 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:71, output treesize:54 [2019-02-18 09:40:11,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:11,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-18 09:40:11,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:12,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:12,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-02-18 09:40:12,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:12,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:12,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:12,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:12,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:12,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:12,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:12,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:12,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:12,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:12,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:12,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:12,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:12,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:12,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:12,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:12,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:12,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:12,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:12,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:12,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:12,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:12,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:12,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:12,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 134 [2019-02-18 09:40:12,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:12,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:12,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:56 [2019-02-18 09:40:14,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:14,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:14,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:14,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:14,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:40:14,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:14,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:40:14,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:40:14,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:40:14,665 INFO L87 Difference]: Start difference. First operand 31 states and 110 transitions. Second operand 8 states. [2019-02-18 09:40:52,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:40:52,879 INFO L93 Difference]: Finished difference Result 74 states and 179 transitions. [2019-02-18 09:40:52,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:40:52,880 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:40:52,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:40:52,882 INFO L225 Difference]: With dead ends: 74 [2019-02-18 09:40:52,882 INFO L226 Difference]: Without dead ends: 72 [2019-02-18 09:40:52,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:40:52,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-18 09:40:52,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2019-02-18 09:40:52,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-18 09:40:52,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 139 transitions. [2019-02-18 09:40:52,890 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 139 transitions. Word has length 4 [2019-02-18 09:40:52,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:40:52,891 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 139 transitions. [2019-02-18 09:40:52,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:40:52,891 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 139 transitions. [2019-02-18 09:40:52,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:40:52,891 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:40:52,892 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:40:52,892 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:40:52,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:52,892 INFO L82 PathProgramCache]: Analyzing trace with hash 941160, now seen corresponding path program 1 times [2019-02-18 09:40:52,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:40:52,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:52,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:52,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:40:52,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:40:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:53,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:53,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:53,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:40:53,001 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:40:53,001 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [31] [2019-02-18 09:40:53,002 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:40:53,002 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:40:53,009 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:40:53,010 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:40:53,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:40:53,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:40:53,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:40:53,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:40:53,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:40:53,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:40:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:40:53,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:40:53,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-18 09:40:53,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-18 09:40:53,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-18 09:40:53,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-18 09:40:53,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-18 09:40:53,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-18 09:40:53,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-18 09:40:53,191 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:53,253 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:53,288 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:53,311 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:53,332 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:53,352 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:53,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:53,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 49 [2019-02-18 09:40:53,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2019-02-18 09:40:53,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 64 [2019-02-18 09:40:53,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 59 [2019-02-18 09:40:53,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 09:40:53,503 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:53,521 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:53,536 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:53,543 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:53,545 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:40:53,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:53,573 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:85, output treesize:54 [2019-02-18 09:40:53,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-18 09:40:53,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:53,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:53,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-02-18 09:40:53,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:40:53,926 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:40:53,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 135 [2019-02-18 09:40:53,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:40:54,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-18 09:40:54,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:54 [2019-02-18 09:40:56,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:56,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:40:56,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:40:56,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:40:56,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:40:56,903 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:40:56,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:40:56,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:40:56,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:40:56,904 INFO L87 Difference]: Start difference. First operand 38 states and 139 transitions. Second operand 8 states. [2019-02-18 09:41:45,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:41:45,217 INFO L93 Difference]: Finished difference Result 71 states and 181 transitions. [2019-02-18 09:41:45,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:41:45,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:41:45,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:41:45,220 INFO L225 Difference]: With dead ends: 71 [2019-02-18 09:41:45,220 INFO L226 Difference]: Without dead ends: 70 [2019-02-18 09:41:45,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:41:45,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-02-18 09:41:45,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 38. [2019-02-18 09:41:45,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-18 09:41:45,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 139 transitions. [2019-02-18 09:41:45,229 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 139 transitions. Word has length 4 [2019-02-18 09:41:45,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:41:45,229 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 139 transitions. [2019-02-18 09:41:45,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:41:45,230 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 139 transitions. [2019-02-18 09:41:45,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:41:45,230 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:41:45,230 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:41:45,231 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:41:45,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:45,231 INFO L82 PathProgramCache]: Analyzing trace with hash 941656, now seen corresponding path program 1 times [2019-02-18 09:41:45,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:41:45,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:45,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:45,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:41:45,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:41:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:45,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:41:45,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:45,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:41:45,334 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:41:45,334 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [31] [2019-02-18 09:41:45,335 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:41:45,335 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:41:45,341 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:41:45,341 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:41:45,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:41:45,342 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:41:45,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:41:45,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:41:45,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:41:45,356 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:41:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:41:45,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:41:45,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2019-02-18 09:41:45,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 48 [2019-02-18 09:41:45,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 45 [2019-02-18 09:41:45,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 09:41:45,688 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-02-18 09:41:45,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 09:41:45,699 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:45,703 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:45,705 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:45,706 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:45,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:45,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-18 09:41:45,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-18 09:41:45,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-18 09:41:45,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-18 09:41:45,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-18 09:41:45,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-18 09:41:45,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:45,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-18 09:41:45,789 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:45,842 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:45,872 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:45,896 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:45,915 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:45,930 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:45,989 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:41:46,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:41:46,018 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:82, output treesize:54 [2019-02-18 09:41:46,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-18 09:41:46,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:46,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-18 09:41:46,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-02-18 09:41:46,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:41:46,237 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 09:41:46,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 135 [2019-02-18 09:41:46,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:41:46,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-18 09:41:46,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:54 [2019-02-18 09:41:48,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:41:48,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:41:48,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:41:48,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:41:48,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:41:48,672 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:41:48,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:41:48,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:41:48,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:41:48,673 INFO L87 Difference]: Start difference. First operand 38 states and 139 transitions. Second operand 8 states. [2019-02-18 09:42:26,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:42:26,637 INFO L93 Difference]: Finished difference Result 71 states and 181 transitions. [2019-02-18 09:42:26,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:42:26,638 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:42:26,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:42:26,639 INFO L225 Difference]: With dead ends: 71 [2019-02-18 09:42:26,639 INFO L226 Difference]: Without dead ends: 69 [2019-02-18 09:42:26,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:42:26,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-18 09:42:26,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 37. [2019-02-18 09:42:26,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-18 09:42:26,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 138 transitions. [2019-02-18 09:42:26,647 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 138 transitions. Word has length 4 [2019-02-18 09:42:26,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:42:26,647 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 138 transitions. [2019-02-18 09:42:26,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:42:26,647 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 138 transitions. [2019-02-18 09:42:26,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:42:26,648 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:42:26,648 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:42:26,648 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:42:26,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:26,649 INFO L82 PathProgramCache]: Analyzing trace with hash 941718, now seen corresponding path program 1 times [2019-02-18 09:42:26,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:42:26,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:26,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:42:26,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:42:26,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:42:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:26,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:42:26,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:26,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:42:26,791 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:42:26,791 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [31] [2019-02-18 09:42:26,792 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:42:26,792 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:42:26,798 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:42:26,798 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:42:26,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:42:26,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:42:26,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:42:26,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:42:26,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:42:26,809 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:42:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:42:26,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:42:26,928 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-02-18 09:42:26,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-18 09:42:26,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:26,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-18 09:42:26,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:26,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:26,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-18 09:42:26,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:26,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:26,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:26,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-18 09:42:26,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:26,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:26,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:26,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:26,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-18 09:42:26,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:26,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:26,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:26,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-18 09:42:27,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-18 09:42:27,023 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:27,080 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:27,111 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:27,138 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:27,160 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:27,178 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:27,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:27,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2019-02-18 09:42:27,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2019-02-18 09:42:27,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:42:27,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 53 [2019-02-18 09:42:27,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 09:42:27,325 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:27,327 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:27,328 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:27,331 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:27,335 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:42:27,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:42:27,361 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:71, output treesize:54 [2019-02-18 09:42:27,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-18 09:42:27,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:27,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-18 09:42:27,551 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-02-18 09:42:27,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:42:27,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 142 [2019-02-18 09:42:27,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:42:27,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-18 09:42:27,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:56 [2019-02-18 09:42:30,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:42:30,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:42:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:42:30,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:42:30,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:42:30,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:42:30,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:42:30,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:42:30,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:42:30,306 INFO L87 Difference]: Start difference. First operand 37 states and 138 transitions. Second operand 8 states. [2019-02-18 09:43:18,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:43:18,255 INFO L93 Difference]: Finished difference Result 74 states and 200 transitions. [2019-02-18 09:43:18,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:43:18,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:43:18,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:43:18,256 INFO L225 Difference]: With dead ends: 74 [2019-02-18 09:43:18,256 INFO L226 Difference]: Without dead ends: 63 [2019-02-18 09:43:18,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:43:18,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-18 09:43:18,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 35. [2019-02-18 09:43:18,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-18 09:43:18,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 155 transitions. [2019-02-18 09:43:18,265 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 155 transitions. Word has length 4 [2019-02-18 09:43:18,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:43:18,265 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 155 transitions. [2019-02-18 09:43:18,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:43:18,265 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 155 transitions. [2019-02-18 09:43:18,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:43:18,266 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:43:18,266 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:43:18,266 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:43:18,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:43:18,267 INFO L82 PathProgramCache]: Analyzing trace with hash 941284, now seen corresponding path program 1 times [2019-02-18 09:43:18,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:43:18,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:43:18,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:43:18,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:43:18,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:43:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:43:18,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:43:18,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:43:18,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:43:18,366 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:43:18,366 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [31] [2019-02-18 09:43:18,367 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:43:18,367 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:43:18,381 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:43:18,382 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 09:43:18,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:43:18,382 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:43:18,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:43:18,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:43:18,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:43:18,397 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:43:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:43:18,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:43:18,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2019-02-18 09:43:18,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2019-02-18 09:43:18,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-02-18 09:43:18,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 53 [2019-02-18 09:43:18,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 09:43:18,508 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:18,510 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:18,512 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:18,517 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:18,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:18,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-18 09:43:18,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-18 09:43:18,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-18 09:43:18,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-18 09:43:18,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-18 09:43:18,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-18 09:43:18,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-18 09:43:18,662 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:18,721 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:18,752 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:18,776 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:18,795 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:18,810 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:18,824 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:18,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 09:43:18,853 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:71, output treesize:54 [2019-02-18 09:43:18,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:18,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-18 09:43:18,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:18,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-18 09:43:18,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-02-18 09:43:19,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:19,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:19,037 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:19,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:19,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:19,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:19,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:19,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:19,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:19,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:19,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:19,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:19,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:19,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:19,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:19,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:19,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:19,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:19,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:19,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:19,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:19,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:19,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:19,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:19,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 142 [2019-02-18 09:43:19,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:19,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-18 09:43:19,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:56 [2019-02-18 09:43:21,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:43:21,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:43:21,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:43:21,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:43:21,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 09:43:21,577 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:43:21,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:43:21,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:43:21,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:43:21,578 INFO L87 Difference]: Start difference. First operand 35 states and 155 transitions. Second operand 8 states. [2019-02-18 09:43:41,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:43:41,375 INFO L93 Difference]: Finished difference Result 67 states and 213 transitions. [2019-02-18 09:43:41,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:43:41,376 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 09:43:41,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:43:41,377 INFO L225 Difference]: With dead ends: 67 [2019-02-18 09:43:41,377 INFO L226 Difference]: Without dead ends: 65 [2019-02-18 09:43:41,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:43:41,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-18 09:43:41,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 38. [2019-02-18 09:43:41,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-18 09:43:41,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 178 transitions. [2019-02-18 09:43:41,387 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 178 transitions. Word has length 4 [2019-02-18 09:43:41,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:43:41,387 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 178 transitions. [2019-02-18 09:43:41,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:43:41,388 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 178 transitions. [2019-02-18 09:43:41,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:43:41,388 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:43:41,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:43:41,389 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:43:41,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:43:41,389 INFO L82 PathProgramCache]: Analyzing trace with hash 930312, now seen corresponding path program 1 times [2019-02-18 09:43:41,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:43:41,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:43:41,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:43:41,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:43:41,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:43:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:43:41,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:43:41,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:43:41,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:43:41,455 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 09:43:41,455 INFO L207 CegarAbsIntRunner]: [0], [6], [32], [33] [2019-02-18 09:43:41,457 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:43:41,457 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:43:41,462 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:43:41,462 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:43:41,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:43:41,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:43:41,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:43:41,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:43:41,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:43:41,472 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:43:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:43:41,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:43:41,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-18 09:43:41,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-18 09:43:41,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:41,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 39 [2019-02-18 09:43:41,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:41,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:41,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2019-02-18 09:43:41,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:41,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:41,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:41,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 63 [2019-02-18 09:43:41,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:41,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:41,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:41,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:41,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:41,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 85 [2019-02-18 09:43:41,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:41,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:41,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:41,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:41,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:41,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 104 [2019-02-18 09:43:41,602 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:41,673 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:41,704 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:41,731 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:41,750 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:41,766 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:41,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:41,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:41,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2019-02-18 09:43:41,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2019-02-18 09:43:41,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:41,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 35 [2019-02-18 09:43:41,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:41,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:41,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 45 [2019-02-18 09:43:41,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:41,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:41,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:41,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:41,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:41,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 33 [2019-02-18 09:43:41,882 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-18 09:43:41,898 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:41,947 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:41,951 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:41,957 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:43:41,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-18 09:43:41,992 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:68, output treesize:59 [2019-02-18 09:43:42,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:42,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:42,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:42,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:42,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:42,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:42,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:42,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:42,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:42,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:42,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:42,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:42,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:42,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:42,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:42,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 09:43:42,155 INFO L303 Elim1Store]: Index analysis took 138 ms [2019-02-18 09:43:42,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 18 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 120 [2019-02-18 09:43:42,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-18 09:43:42,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 26 dim-0 vars, and 5 xjuncts. [2019-02-18 09:43:42,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:69, output treesize:236 [2019-02-18 09:45:14,112 WARN L181 SmtUtils]: Spent 1.51 m on a formula simplification that was a NOOP. DAG size: 126 [2019-02-18 09:45:14,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:45:14,121 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:45:14,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:45:14,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:45:14,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 09:45:14,227 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:45:14,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:45:14,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:45:14,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:45:14,227 INFO L87 Difference]: Start difference. First operand 38 states and 178 transitions. Second operand 6 states. [2019-02-18 09:45:35,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:45:35,011 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:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.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-02-18 09:45:35,015 INFO L168 Benchmark]: Toolchain (without parser) took 404246.06 ms. Allocated memory was 134.7 MB in the beginning and 482.3 MB in the end (delta: 347.6 MB). Free memory was 109.7 MB in the beginning and 349.8 MB in the end (delta: -240.1 MB). Peak memory consumption was 107.5 MB. Max. memory is 7.1 GB. [2019-02-18 09:45:35,015 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 134.7 MB. Free memory is still 111.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-18 09:45:35,016 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.72 ms. Allocated memory is still 134.7 MB. Free memory was 109.7 MB in the beginning and 107.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-02-18 09:45:35,016 INFO L168 Benchmark]: Boogie Preprocessor took 26.67 ms. Allocated memory is still 134.7 MB. Free memory was 107.4 MB in the beginning and 106.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-18 09:45:35,016 INFO L168 Benchmark]: RCFGBuilder took 516.49 ms. Allocated memory is still 134.7 MB. Free memory was 106.1 MB in the beginning and 93.7 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2019-02-18 09:45:35,017 INFO L168 Benchmark]: TraceAbstraction took 403634.44 ms. Allocated memory was 134.7 MB in the beginning and 482.3 MB in the end (delta: 347.6 MB). Free memory was 93.3 MB in the beginning and 349.8 MB in the end (delta: -256.6 MB). Peak memory consumption was 91.0 MB. Max. memory is 7.1 GB. [2019-02-18 09:45:35,019 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.17 ms. Allocated memory is still 134.7 MB. Free memory is still 111.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.72 ms. Allocated memory is still 134.7 MB. Free memory was 109.7 MB in the beginning and 107.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.67 ms. Allocated memory is still 134.7 MB. Free memory was 107.4 MB in the beginning and 106.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 516.49 ms. Allocated memory is still 134.7 MB. Free memory was 106.1 MB in the beginning and 93.7 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 403634.44 ms. Allocated memory was 134.7 MB in the beginning and 482.3 MB in the end (delta: 347.6 MB). Free memory was 93.3 MB in the beginning and 349.8 MB in the end (delta: -256.6 MB). Peak memory consumption was 91.0 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...