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-fa1c628-m [2019-01-31 17:07:08,523 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 17:07:08,528 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 17:07:08,541 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 17:07:08,541 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 17:07:08,542 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 17:07:08,543 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 17:07:08,546 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 17:07:08,547 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 17:07:08,548 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 17:07:08,549 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 17:07:08,549 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 17:07:08,550 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 17:07:08,551 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 17:07:08,553 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 17:07:08,553 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 17:07:08,554 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 17:07:08,556 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 17:07:08,559 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 17:07:08,561 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 17:07:08,562 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 17:07:08,563 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 17:07:08,566 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 17:07:08,567 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 17:07:08,567 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 17:07:08,568 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 17:07:08,569 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 17:07:08,570 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 17:07:08,571 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 17:07:08,575 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 17:07:08,575 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 17:07:08,576 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 17:07:08,576 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 17:07:08,577 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 17:07:08,578 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 17:07:08,578 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 17:07:08,579 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-31 17:07:08,596 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 17:07:08,596 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 17:07:08,597 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 17:07:08,597 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 17:07:08,597 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 17:07:08,597 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 17:07:08,598 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 17:07:08,598 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 17:07:08,598 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 17:07:08,598 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 17:07:08,598 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 17:07:08,599 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 17:07:08,599 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 17:07:08,599 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 17:07:08,600 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 17:07:08,600 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 17:07:08,600 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 17:07:08,600 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 17:07:08,600 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 17:07:08,601 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 17:07:08,601 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 17:07:08,601 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 17:07:08,601 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 17:07:08,601 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 17:07:08,602 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 17:07:08,602 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 17:07:08,602 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 17:07:08,602 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 17:07:08,602 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 17:07:08,603 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 17:07:08,603 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 17:07:08,603 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:07:08,603 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 17:07:08,603 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 17:07:08,604 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 17:07:08,604 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 17:07:08,604 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 17:07:08,604 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 17:07:08,604 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 17:07:08,604 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 17:07:08,633 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 17:07:08,645 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 17:07:08,649 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 17:07:08,650 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 17:07:08,651 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 17:07:08,651 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-01-31 17:07:08,652 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl' [2019-01-31 17:07:08,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 17:07:08,694 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 17:07:08,694 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 17:07:08,694 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 17:07:08,695 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 17:07:08,711 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 31.01 05:07:08" (1/1) ... [2019-01-31 17:07:08,723 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 31.01 05:07:08" (1/1) ... [2019-01-31 17:07:08,749 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 17:07:08,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 17:07:08,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 17:07:08,750 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 17:07:08,762 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 31.01 05:07:08" (1/1) ... [2019-01-31 17:07:08,762 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 31.01 05:07:08" (1/1) ... [2019-01-31 17:07:08,764 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 31.01 05:07:08" (1/1) ... [2019-01-31 17:07:08,764 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 31.01 05:07:08" (1/1) ... [2019-01-31 17:07:08,768 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 31.01 05:07:08" (1/1) ... [2019-01-31 17:07:08,772 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 31.01 05:07:08" (1/1) ... [2019-01-31 17:07:08,773 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 31.01 05:07:08" (1/1) ... [2019-01-31 17:07:08,775 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 17:07:08,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 17:07:08,776 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 17:07:08,776 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 17:07:08,780 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 31.01 05:07:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:07:08,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 17:07:08,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 17:07:09,318 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 17:07:09,319 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-01-31 17:07:09,320 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:07:09 BoogieIcfgContainer [2019-01-31 17:07:09,320 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 17:07:09,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 17:07:09,321 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 17:07:09,325 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 17:07:09,325 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 31.01 05:07:08" (1/2) ... [2019-01-31 17:07:09,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22909db9 and model type speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:07:09, skipping insertion in model container [2019-01-31 17:07:09,326 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 31.01 05:07:09" (2/2) ... [2019-01-31 17:07:09,328 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-7-limited.bpl [2019-01-31 17:07:09,338 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 17:07:09,346 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-01-31 17:07:09,362 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-01-31 17:07:09,395 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 17:07:09,395 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 17:07:09,395 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 17:07:09,395 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 17:07:09,396 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 17:07:09,396 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 17:07:09,396 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 17:07:09,396 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 17:07:09,412 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-01-31 17:07:09,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-31 17:07:09,418 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:09,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-31 17:07:09,422 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:09,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:09,428 INFO L82 PathProgramCache]: Analyzing trace with hash 992, now seen corresponding path program 1 times [2019-01-31 17:07:09,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:09,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:09,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:09,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:09,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:09,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:09,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:07:09,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:07:09,639 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:07:09,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:07:09,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:07:09,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:07:09,662 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-01-31 17:07:09,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:09,876 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-01-31 17:07:09,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:07:09,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 17:07:09,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:09,891 INFO L225 Difference]: With dead ends: 33 [2019-01-31 17:07:09,891 INFO L226 Difference]: Without dead ends: 28 [2019-01-31 17:07:09,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:07:09,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-31 17:07:09,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2019-01-31 17:07:09,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-31 17:07:09,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2019-01-31 17:07:09,939 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 2 [2019-01-31 17:07:09,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:09,941 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2019-01-31 17:07:09,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:07:09,947 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2019-01-31 17:07:09,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:07:09,948 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:09,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:07:09,949 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:09,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:09,949 INFO L82 PathProgramCache]: Analyzing trace with hash 30816, now seen corresponding path program 1 times [2019-01-31 17:07:09,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:09,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:09,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:09,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:09,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:10,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:10,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:07:10,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:07:10,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:07:10,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:07:10,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:07:10,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:07:10,019 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 3 states. [2019-01-31 17:07:10,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:10,349 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-01-31 17:07:10,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:07:10,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 17:07:10,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:10,351 INFO L225 Difference]: With dead ends: 28 [2019-01-31 17:07:10,352 INFO L226 Difference]: Without dead ends: 27 [2019-01-31 17:07:10,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:07:10,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-31 17:07:10,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2019-01-31 17:07:10,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-31 17:07:10,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2019-01-31 17:07:10,357 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 3 [2019-01-31 17:07:10,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:10,357 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 30 transitions. [2019-01-31 17:07:10,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:07:10,358 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 30 transitions. [2019-01-31 17:07:10,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:07:10,358 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:10,358 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:07:10,359 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:10,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:10,359 INFO L82 PathProgramCache]: Analyzing trace with hash 30380, now seen corresponding path program 1 times [2019-01-31 17:07:10,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:10,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:10,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:10,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:10,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:10,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:10,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:10,493 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:10,494 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:07:10,496 INFO L207 CegarAbsIntRunner]: [0], [18], [31] [2019-01-31 17:07:10,527 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:10,527 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:10,603 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:10,604 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-01-31 17:07:10,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:10,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:10,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:10,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:10,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:10,627 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:10,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:10,977 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-01-31 17:07:11,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,061 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-01-31 17:07:11,079 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-01-31 17:07:11,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,113 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-01-31 17:07:11,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 53 [2019-01-31 17:07:11,242 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-01-31 17:07:11,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,268 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-01-31 17:07:11,271 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,276 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,277 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,282 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,372 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-01-31 17:07:11,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,386 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-01-31 17:07:11,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,398 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-01-31 17:07:11,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,419 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-01-31 17:07:11,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,436 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-01-31 17:07:11,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,501 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-01-31 17:07:11,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,538 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-01-31 17:07:11,540 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,960 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,015 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,046 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,071 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,091 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,110 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:12,164 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:71, output treesize:54 [2019-01-31 17:07:12,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,276 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-01-31 17:07:12,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,512 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-01-31 17:07:12,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:54 [2019-01-31 17:07:13,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:13,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:13,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:13,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:13,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:07:13,844 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:13,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:07:13,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:07:13,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:07:13,845 INFO L87 Difference]: Start difference. First operand 17 states and 30 transitions. Second operand 6 states. [2019-01-31 17:07:38,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:38,111 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2019-01-31 17:07:38,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:07:38,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:07:38,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:38,114 INFO L225 Difference]: With dead ends: 54 [2019-01-31 17:07:38,114 INFO L226 Difference]: Without dead ends: 52 [2019-01-31 17:07:38,115 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-01-31 17:07:38,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-31 17:07:38,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 20. [2019-01-31 17:07:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-31 17:07:38,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 41 transitions. [2019-01-31 17:07:38,121 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 41 transitions. Word has length 3 [2019-01-31 17:07:38,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:38,121 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 41 transitions. [2019-01-31 17:07:38,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:07:38,122 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 41 transitions. [2019-01-31 17:07:38,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:07:38,122 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:38,122 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:07:38,123 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:38,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:38,123 INFO L82 PathProgramCache]: Analyzing trace with hash 30008, now seen corresponding path program 1 times [2019-01-31 17:07:38,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:38,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:38,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:38,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:38,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:38,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:38,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:38,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:38,207 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:07:38,208 INFO L207 CegarAbsIntRunner]: [0], [6], [31] [2019-01-31 17:07:38,210 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:38,210 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:38,222 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:38,223 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-01-31 17:07:38,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:38,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:38,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:38,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:38,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:38,232 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:38,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:38,313 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-01-31 17:07:38,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,319 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-01-31 17:07:38,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,328 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-01-31 17:07:38,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,388 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-01-31 17:07:38,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,419 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-01-31 17:07:38,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,518 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-01-31 17:07:38,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,599 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-01-31 17:07:38,600 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,673 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,719 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,745 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,767 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,818 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,890 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-01-31 17:07:38,899 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-01-31 17:07:38,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,921 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-01-31 17:07:38,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,933 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-01-31 17:07:38,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,984 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-01-31 17:07:38,986 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,990 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,998 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:39,002 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:39,004 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:39,043 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-01-31 17:07:39,043 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:71, output treesize:54 [2019-01-31 17:07:39,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,133 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-01-31 17:07:39,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:39,237 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-01-31 17:07:39,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:54 [2019-01-31 17:07:39,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:39,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:39,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:39,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:07:39,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-31 17:07:39,356 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:07:39,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:07:39,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:07:39,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:07:39,357 INFO L87 Difference]: Start difference. First operand 20 states and 41 transitions. Second operand 4 states. [2019-01-31 17:07:39,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:39,446 INFO L93 Difference]: Finished difference Result 25 states and 67 transitions. [2019-01-31 17:07:39,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:07:39,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 17:07:39,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:39,447 INFO L225 Difference]: With dead ends: 25 [2019-01-31 17:07:39,447 INFO L226 Difference]: Without dead ends: 24 [2019-01-31 17:07:39,448 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-01-31 17:07:39,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-31 17:07:39,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-01-31 17:07:39,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-31 17:07:39,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-01-31 17:07:39,453 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 3 [2019-01-31 17:07:39,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:39,454 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-01-31 17:07:39,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:07:39,454 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-01-31 17:07:39,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:07:39,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:39,454 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:07:39,455 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:39,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:39,455 INFO L82 PathProgramCache]: Analyzing trace with hash 30132, now seen corresponding path program 1 times [2019-01-31 17:07:39,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:39,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:39,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:39,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:39,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:39,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:39,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:39,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:39,574 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:07:39,574 INFO L207 CegarAbsIntRunner]: [0], [10], [31] [2019-01-31 17:07:39,578 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:39,578 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:39,586 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:39,587 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-01-31 17:07:39,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:39,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:39,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:39,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:39,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:39,598 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:39,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:39,736 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-01-31 17:07:39,739 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-01-31 17:07:39,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,746 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-01-31 17:07:39,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,795 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-01-31 17:07:39,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,807 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-01-31 17:07:39,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,919 INFO L303 Elim1Store]: Index analysis took 109 ms [2019-01-31 17:07:39,920 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-01-31 17:07:39,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,946 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-01-31 17:07:39,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,975 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-01-31 17:07:39,976 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,067 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,171 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,196 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,217 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,235 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01-31 17:07:40,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,355 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-01-31 17:07:40,363 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-01-31 17:07:40,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,370 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-01-31 17:07:40,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,443 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-01-31 17:07:40,444 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,448 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,450 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,452 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,455 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:40,487 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:82, output treesize:54 [2019-01-31 17:07:40,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,556 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-01-31 17:07:40,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,928 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-01-31 17:07:40,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:54 [2019-01-31 17:07:42,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:42,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:42,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:42,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:42,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:07:42,111 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:42,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:07:42,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:07:42,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:07:42,111 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 6 states. [2019-01-31 17:08:02,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:02,659 INFO L93 Difference]: Finished difference Result 57 states and 111 transitions. [2019-01-31 17:08:02,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:08:02,659 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:08:02,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:02,661 INFO L225 Difference]: With dead ends: 57 [2019-01-31 17:08:02,661 INFO L226 Difference]: Without dead ends: 56 [2019-01-31 17:08:02,662 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-01-31 17:08:02,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-31 17:08:02,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 25. [2019-01-31 17:08:02,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-31 17:08:02,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2019-01-31 17:08:02,669 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 82 transitions. Word has length 3 [2019-01-31 17:08:02,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:02,669 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 82 transitions. [2019-01-31 17:08:02,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:08:02,669 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 82 transitions. [2019-01-31 17:08:02,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:08:02,670 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:02,670 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:08:02,670 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:02,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:02,671 INFO L82 PathProgramCache]: Analyzing trace with hash 30628, now seen corresponding path program 1 times [2019-01-31 17:08:02,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:02,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:02,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:02,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:02,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:02,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:02,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:02,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:02,749 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:08:02,749 INFO L207 CegarAbsIntRunner]: [0], [26], [31] [2019-01-31 17:08:02,750 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:02,750 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:02,758 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:02,758 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-01-31 17:08:02,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:02,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:02,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:02,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:08:02,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:02,770 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:02,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:02,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:02,860 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-01-31 17:08:02,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,866 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-01-31 17:08:02,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,874 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-01-31 17:08:02,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,888 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-01-31 17:08:02,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,910 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-01-31 17:08:02,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,924 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-01-31 17:08:02,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,961 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-01-31 17:08:02,963 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:03,029 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:03,067 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:03,096 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:03,118 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:03,140 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:03,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:03,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,209 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-01-31 17:08:03,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,238 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-01-31 17:08:03,242 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-01-31 17:08:03,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,250 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-01-31 17:08:03,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,307 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-01-31 17:08:03,308 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:03,310 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:03,311 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:03,313 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:03,314 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:03,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:03,345 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:82, output treesize:54 [2019-01-31 17:08:03,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:03,396 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-01-31 17:08:03,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:03,493 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-01-31 17:08:03,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:54 [2019-01-31 17:08:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:04,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:04,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:04,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:04,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:08:04,674 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:04,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:08:04,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:08:04,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:08:04,675 INFO L87 Difference]: Start difference. First operand 25 states and 82 transitions. Second operand 6 states. [2019-01-31 17:08:25,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:25,283 INFO L93 Difference]: Finished difference Result 59 states and 127 transitions. [2019-01-31 17:08:25,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:08:25,285 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:08:25,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:25,286 INFO L225 Difference]: With dead ends: 59 [2019-01-31 17:08:25,286 INFO L226 Difference]: Without dead ends: 57 [2019-01-31 17:08:25,288 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-01-31 17:08:25,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-31 17:08:25,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2019-01-31 17:08:25,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-31 17:08:25,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 101 transitions. [2019-01-31 17:08:25,298 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 101 transitions. Word has length 3 [2019-01-31 17:08:25,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:25,298 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 101 transitions. [2019-01-31 17:08:25,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:08:25,298 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 101 transitions. [2019-01-31 17:08:25,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:08:25,299 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:25,299 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:08:25,300 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:25,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:25,300 INFO L82 PathProgramCache]: Analyzing trace with hash 955362, now seen corresponding path program 1 times [2019-01-31 17:08:25,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:25,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:25,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:25,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:25,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:25,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:25,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:08:25,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:08:25,336 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:08:25,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:08:25,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:08:25,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:08:25,336 INFO L87 Difference]: Start difference. First operand 29 states and 101 transitions. Second operand 3 states. [2019-01-31 17:08:25,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:25,399 INFO L93 Difference]: Finished difference Result 33 states and 102 transitions. [2019-01-31 17:08:25,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:08:25,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-31 17:08:25,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:25,401 INFO L225 Difference]: With dead ends: 33 [2019-01-31 17:08:25,401 INFO L226 Difference]: Without dead ends: 32 [2019-01-31 17:08:25,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:08:25,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-31 17:08:25,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-01-31 17:08:25,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-31 17:08:25,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 100 transitions. [2019-01-31 17:08:25,409 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 100 transitions. Word has length 4 [2019-01-31 17:08:25,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:25,409 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 100 transitions. [2019-01-31 17:08:25,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:08:25,409 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 100 transitions. [2019-01-31 17:08:25,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:08:25,412 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:25,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:08:25,412 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:25,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:25,413 INFO L82 PathProgramCache]: Analyzing trace with hash 941844, now seen corresponding path program 1 times [2019-01-31 17:08:25,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:25,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:25,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:25,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:25,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:25,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:25,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:25,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:25,497 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:08:25,497 INFO L207 CegarAbsIntRunner]: [0], [18], [32], [33] [2019-01-31 17:08:25,498 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:25,498 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:25,510 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:25,511 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-01-31 17:08:25,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:25,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:25,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:25,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:08:25,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:25,521 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:25,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:25,540 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-01-31 17:08:25,547 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-01-31 17:08:25,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:25,557 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-01-31 17:08:25,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:25,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:25,579 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-01-31 17:08:25,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:25,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:25,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:25,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:25,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:25,610 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-01-31 17:08:25,611 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:25,626 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:25,632 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:25,635 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:25,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:25,656 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-01-31 17:08:25,660 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-01-31 17:08:25,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:25,671 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-01-31 17:08:25,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:25,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:25,681 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-01-31 17:08:25,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:25,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:25,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:25,700 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-01-31 17:08:25,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:25,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:25,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:25,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:25,728 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-01-31 17:08:25,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:25,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:25,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:25,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:25,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:25,783 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-01-31 17:08:25,785 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:25,830 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:25,856 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:25,876 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:25,893 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:25,908 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:25,921 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:25,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:25,953 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:60, output treesize:55 [2019-01-31 17:08:26,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,047 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-01-31 17:08:26,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-31 17:08:26,241 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-01-31 17:08:26,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:104 [2019-01-31 17:08:27,715 WARN L181 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2019-01-31 17:08:27,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:27,723 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:27,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:27,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:08:27,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-31 17:08:27,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:08:27,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:08:27,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:08:27,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:08:27,796 INFO L87 Difference]: Start difference. First operand 29 states and 100 transitions. Second operand 4 states. [2019-01-31 17:08:27,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:27,966 INFO L93 Difference]: Finished difference Result 33 states and 111 transitions. [2019-01-31 17:08:27,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:08:27,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 17:08:27,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:27,967 INFO L225 Difference]: With dead ends: 33 [2019-01-31 17:08:27,968 INFO L226 Difference]: Without dead ends: 32 [2019-01-31 17:08:27,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:08:27,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-31 17:08:27,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-01-31 17:08:27,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-31 17:08:27,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 110 transitions. [2019-01-31 17:08:27,976 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 110 transitions. Word has length 4 [2019-01-31 17:08:27,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:27,976 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 110 transitions. [2019-01-31 17:08:27,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:08:27,976 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 110 transitions. [2019-01-31 17:08:27,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:08:27,977 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:27,977 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:08:27,977 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:27,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:27,978 INFO L82 PathProgramCache]: Analyzing trace with hash 941532, now seen corresponding path program 1 times [2019-01-31 17:08:27,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:27,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:27,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:27,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:27,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:28,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:28,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:28,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:28,071 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:08:28,072 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [31] [2019-01-31 17:08:28,073 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:28,073 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:28,080 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:28,080 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-01-31 17:08:28,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:28,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:28,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:28,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:08:28,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:28,094 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:28,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:28,163 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-01-31 17:08:28,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,167 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-01-31 17:08:28,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,174 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-01-31 17:08:28,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,202 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-01-31 17:08:28,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,220 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-01-31 17:08:28,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,232 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-01-31 17:08:28,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,264 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-01-31 17:08:28,265 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,325 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,358 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,385 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,404 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,422 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,488 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-01-31 17:08:28,491 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-01-31 17:08:28,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:08:28,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,503 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-01-31 17:08:28,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,552 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-01-31 17:08:28,553 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,555 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,556 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,557 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,584 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:28,664 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:71, output treesize:54 [2019-01-31 17:08:28,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-01-31 17:08:28,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:28,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-01-31 17:08:28,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,965 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-01-31 17:08:28,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:29,057 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-01-31 17:08:29,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:56 [2019-01-31 17:08:31,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:31,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:31,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:31,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:31,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:08:31,362 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:31,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:08:31,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:08:31,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:08:31,363 INFO L87 Difference]: Start difference. First operand 31 states and 110 transitions. Second operand 8 states. [2019-01-31 17:09:09,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:09,135 INFO L93 Difference]: Finished difference Result 74 states and 179 transitions. [2019-01-31 17:09:09,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:09:09,137 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:09:09,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:09,138 INFO L225 Difference]: With dead ends: 74 [2019-01-31 17:09:09,138 INFO L226 Difference]: Without dead ends: 72 [2019-01-31 17:09:09,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:09:09,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-31 17:09:09,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 38. [2019-01-31 17:09:09,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-31 17:09:09,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 139 transitions. [2019-01-31 17:09:09,147 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 139 transitions. Word has length 4 [2019-01-31 17:09:09,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:09,147 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 139 transitions. [2019-01-31 17:09:09,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:09:09,148 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 139 transitions. [2019-01-31 17:09:09,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:09:09,148 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:09,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:09:09,149 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:09,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:09,149 INFO L82 PathProgramCache]: Analyzing trace with hash 941160, now seen corresponding path program 1 times [2019-01-31 17:09:09,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:09,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:09,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:09,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:09,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:09,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:09:09,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:09,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:09,255 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:09:09,255 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [31] [2019-01-31 17:09:09,257 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:09,257 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:09,264 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:09,264 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-01-31 17:09:09,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:09,264 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:09,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:09,265 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:09:09,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:09,274 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:09,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:09,356 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-01-31 17:09:09,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,361 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-01-31 17:09:09,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,373 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-01-31 17:09:09,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,390 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-01-31 17:09:09,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,401 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-01-31 17:09:09,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,414 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-01-31 17:09:09,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,428 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-01-31 17:09:09,429 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:09,489 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:09,523 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:09,554 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:09,581 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:09,602 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:09,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:09,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,680 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-01-31 17:09:09,684 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-01-31 17:09:09,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,708 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-01-31 17:09:09,716 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-01-31 17:09:09,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,778 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-01-31 17:09:09,779 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:09,781 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:09,784 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:09,785 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:09,788 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:09,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:09:09,817 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:85, output treesize:54 [2019-01-31 17:09:09,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,890 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-01-31 17:09:09,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:09,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:09:09,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-01-31 17:09:10,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:10,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:10,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:10,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:10,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:10,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:10,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:10,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:10,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:10,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:10,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:10,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:10,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:10,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:10,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:10,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:10,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:10,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:10,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:10,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:10,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:10,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:10,175 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:10,177 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-01-31 17:09:10,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:10,271 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-01-31 17:09:10,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:54 [2019-01-31 17:09:12,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:09:12,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:12,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:09:12,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:12,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:09:12,603 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:12,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:09:12,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:09:12,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:09:12,604 INFO L87 Difference]: Start difference. First operand 38 states and 139 transitions. Second operand 8 states. [2019-01-31 17:10:00,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:10:00,169 INFO L93 Difference]: Finished difference Result 71 states and 181 transitions. [2019-01-31 17:10:00,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:10:00,169 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:10:00,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:10:00,171 INFO L225 Difference]: With dead ends: 71 [2019-01-31 17:10:00,171 INFO L226 Difference]: Without dead ends: 70 [2019-01-31 17:10:00,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:10:00,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-31 17:10:00,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 38. [2019-01-31 17:10:00,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-31 17:10:00,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 139 transitions. [2019-01-31 17:10:00,179 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 139 transitions. Word has length 4 [2019-01-31 17:10:00,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:10:00,180 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 139 transitions. [2019-01-31 17:10:00,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:10:00,180 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 139 transitions. [2019-01-31 17:10:00,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:10:00,180 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:10:00,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:10:00,181 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:10:00,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:00,181 INFO L82 PathProgramCache]: Analyzing trace with hash 941656, now seen corresponding path program 1 times [2019-01-31 17:10:00,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:10:00,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:00,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:00,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:00,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:10:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:00,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:10:00,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:00,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:10:00,285 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:10:00,285 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [31] [2019-01-31 17:10:00,286 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:10:00,286 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:10:00,292 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:10:00,292 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-01-31 17:10:00,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:00,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:10:00,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:00,293 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:10:00,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:00,303 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:10:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:00,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:10:00,849 WARN L181 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-01-31 17:10:00,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,855 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-01-31 17:10:00,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,897 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-01-31 17:10:00,904 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-01-31 17:10:00,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,911 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-01-31 17:10:01,160 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-01-31 17:10:01,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,171 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-01-31 17:10:01,172 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:01,174 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:01,176 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:01,178 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:01,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:01,197 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-01-31 17:10:01,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,202 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-01-31 17:10:01,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,207 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-01-31 17:10:01,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,222 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-01-31 17:10:01,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,233 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-01-31 17:10:01,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,244 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-01-31 17:10:01,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,255 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-01-31 17:10:01,256 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:01,313 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:01,345 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:01,371 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:01,390 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:01,407 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:01,466 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:01,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:10:01,497 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:82, output treesize:54 [2019-01-31 17:10:01,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,563 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-01-31 17:10:01,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:01,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:10:01,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-01-31 17:10:01,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:01,849 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:01,850 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-01-31 17:10:01,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:01,945 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-01-31 17:10:01,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:54 [2019-01-31 17:10:04,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:10:04,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:10:04,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:10:04,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:10:04,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:10:04,257 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:10:04,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:10:04,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:10:04,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:10:04,258 INFO L87 Difference]: Start difference. First operand 38 states and 139 transitions. Second operand 8 states. [2019-01-31 17:10:41,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:10:41,708 INFO L93 Difference]: Finished difference Result 71 states and 181 transitions. [2019-01-31 17:10:41,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:10:41,708 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:10:41,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:10:41,710 INFO L225 Difference]: With dead ends: 71 [2019-01-31 17:10:41,710 INFO L226 Difference]: Without dead ends: 69 [2019-01-31 17:10:41,710 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-01-31 17:10:41,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-31 17:10:41,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 37. [2019-01-31 17:10:41,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-31 17:10:41,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 138 transitions. [2019-01-31 17:10:41,718 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 138 transitions. Word has length 4 [2019-01-31 17:10:41,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:10:41,718 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 138 transitions. [2019-01-31 17:10:41,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:10:41,718 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 138 transitions. [2019-01-31 17:10:41,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:10:41,719 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:10:41,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:10:41,719 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:10:41,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:41,720 INFO L82 PathProgramCache]: Analyzing trace with hash 941718, now seen corresponding path program 1 times [2019-01-31 17:10:41,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:10:41,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:41,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:41,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:41,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:10:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:41,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:10:41,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:41,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:10:41,864 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:10:41,864 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [31] [2019-01-31 17:10:41,865 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:10:41,865 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:10:41,870 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:10:41,870 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-01-31 17:10:41,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:41,870 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:10:41,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:41,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:10:41,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:41,887 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:10:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:41,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:10:41,958 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-01-31 17:10:41,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,963 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-01-31 17:10:41,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,968 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-01-31 17:10:41,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,980 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-01-31 17:10:41,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,988 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-01-31 17:10:41,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,033 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-01-31 17:10:42,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,044 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-01-31 17:10:42,045 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:42,107 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:42,142 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:42,169 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:42,189 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:42,208 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:42,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:42,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,267 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-01-31 17:10:42,271 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-01-31 17:10:42,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,315 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-01-31 17:10:42,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,321 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-01-31 17:10:42,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,354 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-01-31 17:10:42,355 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:42,357 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:42,358 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:42,361 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:42,365 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:42,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:10:42,392 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:71, output treesize:54 [2019-01-31 17:10:42,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,493 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-01-31 17:10:42,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:42,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:10:42,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-01-31 17:10:42,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:42,813 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-01-31 17:10:42,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:42,946 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-01-31 17:10:42,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:56 [2019-01-31 17:10:45,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:10:45,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:10:45,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:10:45,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:10:45,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:10:45,283 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:10:45,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:10:45,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:10:45,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:10:45,283 INFO L87 Difference]: Start difference. First operand 37 states and 138 transitions. Second operand 8 states. [2019-01-31 17:11:32,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:11:32,673 INFO L93 Difference]: Finished difference Result 74 states and 200 transitions. [2019-01-31 17:11:32,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:11:32,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:11:32,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:11:32,675 INFO L225 Difference]: With dead ends: 74 [2019-01-31 17:11:32,675 INFO L226 Difference]: Without dead ends: 63 [2019-01-31 17:11:32,675 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-01-31 17:11:32,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-31 17:11:32,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 35. [2019-01-31 17:11:32,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-31 17:11:32,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 155 transitions. [2019-01-31 17:11:32,683 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 155 transitions. Word has length 4 [2019-01-31 17:11:32,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:11:32,683 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 155 transitions. [2019-01-31 17:11:32,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:11:32,684 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 155 transitions. [2019-01-31 17:11:32,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:11:32,687 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:11:32,687 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:11:32,687 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:11:32,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:32,688 INFO L82 PathProgramCache]: Analyzing trace with hash 941284, now seen corresponding path program 1 times [2019-01-31 17:11:32,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:11:32,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:32,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:32,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:32,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:11:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:32,962 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-31 17:11:32,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:11:32,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:32,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:11:32,983 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:11:32,983 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [31] [2019-01-31 17:11:32,984 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:11:32,985 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:11:32,990 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:11:32,990 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-01-31 17:11:32,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:32,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:11:32,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:32,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:11:33,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:33,002 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:11:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:33,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:11:33,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,096 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-01-31 17:11:33,100 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-01-31 17:11:33,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,104 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-01-31 17:11:33,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,111 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-01-31 17:11:33,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,143 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-01-31 17:11:33,143 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:33,146 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:33,147 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:33,150 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:33,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:33,170 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-01-31 17:11:33,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,176 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-01-31 17:11:33,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,188 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-01-31 17:11:33,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,195 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-01-31 17:11:33,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,206 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-01-31 17:11:33,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,214 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-01-31 17:11:33,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,227 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-01-31 17:11:33,228 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:33,286 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:33,318 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:33,341 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:33,360 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:33,377 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:33,392 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:33,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:11:33,423 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:71, output treesize:54 [2019-01-31 17:11:33,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,486 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-01-31 17:11:33,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:33,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:11:33,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-01-31 17:11:33,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:33,657 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-01-31 17:11:33,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:33,751 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-01-31 17:11:33,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:56 [2019-01-31 17:11:36,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:11:36,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:11:36,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:11:36,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:11:36,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:11:36,162 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:11:36,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:11:36,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:11:36,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:11:36,163 INFO L87 Difference]: Start difference. First operand 35 states and 155 transitions. Second operand 8 states. [2019-01-31 17:11:56,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:11:56,042 INFO L93 Difference]: Finished difference Result 67 states and 213 transitions. [2019-01-31 17:11:56,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:11:56,043 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:11:56,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:11:56,044 INFO L225 Difference]: With dead ends: 67 [2019-01-31 17:11:56,044 INFO L226 Difference]: Without dead ends: 65 [2019-01-31 17:11:56,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:11:56,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-31 17:11:56,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 38. [2019-01-31 17:11:56,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-31 17:11:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 178 transitions. [2019-01-31 17:11:56,053 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 178 transitions. Word has length 4 [2019-01-31 17:11:56,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:11:56,054 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 178 transitions. [2019-01-31 17:11:56,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:11:56,054 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 178 transitions. [2019-01-31 17:11:56,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:11:56,054 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:11:56,055 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:11:56,055 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:11:56,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:56,055 INFO L82 PathProgramCache]: Analyzing trace with hash 930312, now seen corresponding path program 1 times [2019-01-31 17:11:56,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:11:56,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:56,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:56,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:56,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:11:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:56,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:11:56,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:56,115 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:11:56,116 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:11:56,116 INFO L207 CegarAbsIntRunner]: [0], [6], [32], [33] [2019-01-31 17:11:56,117 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:11:56,118 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:11:56,122 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:11:56,123 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-01-31 17:11:56,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:56,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:11:56,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:56,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:11:56,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:56,133 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:11:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:56,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:11:56,188 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-01-31 17:11:56,191 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-01-31 17:11:56,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,198 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-01-31 17:11:56,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,217 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-01-31 17:11:56,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,228 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-01-31 17:11:56,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,247 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-01-31 17:11:56,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 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-01-31 17:11:56,262 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:56,328 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:56,358 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:56,382 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:56,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:56,420 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:56,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:56,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,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, 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-01-31 17:11:56,479 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-01-31 17:11:56,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,484 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-01-31 17:11:56,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,493 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-01-31 17:11:56,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,525 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-01-31 17:11:56,526 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:56,541 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:56,593 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:56,596 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:56,601 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:56,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-31 17:11:56,634 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:68, output treesize:59 [2019-01-31 17:11:56,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:56,719 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-01-31 17:11:56,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-31 17:11:57,109 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-01-31 17:11:57,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:69, output treesize:236 [2019-01-31 17:13:25,269 WARN L181 SmtUtils]: Spent 1.46 m on a formula simplification that was a NOOP. DAG size: 126 [2019-01-31 17:13:25,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:13:25,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:13:25,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:13:25,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:13:25,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:13:25,471 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:13:25,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:13:25,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:13:25,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:13:25,472 INFO L87 Difference]: Start difference. First operand 38 states and 178 transitions. Second operand 6 states. [2019-01-31 17:13:47,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:13:47,477 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-01-31 17:13:47,481 INFO L168 Benchmark]: Toolchain (without parser) took 398788.09 ms. Allocated memory was 141.6 MB in the beginning and 303.6 MB in the end (delta: 162.0 MB). Free memory was 108.9 MB in the beginning and 209.1 MB in the end (delta: -100.2 MB). Peak memory consumption was 61.8 MB. Max. memory is 7.1 GB. [2019-01-31 17:13:47,481 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 141.6 MB. Free memory is still 110.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 17:13:47,481 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.44 ms. Allocated memory is still 141.6 MB. Free memory was 108.9 MB in the beginning and 106.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-01-31 17:13:47,482 INFO L168 Benchmark]: Boogie Preprocessor took 24.95 ms. Allocated memory is still 141.6 MB. Free memory was 106.5 MB in the beginning and 105.3 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. [2019-01-31 17:13:47,482 INFO L168 Benchmark]: RCFGBuilder took 544.85 ms. Allocated memory is still 141.6 MB. Free memory was 105.3 MB in the beginning and 92.6 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. [2019-01-31 17:13:47,482 INFO L168 Benchmark]: TraceAbstraction took 398158.74 ms. Allocated memory was 141.6 MB in the beginning and 303.6 MB in the end (delta: 162.0 MB). Free memory was 92.4 MB in the beginning and 209.1 MB in the end (delta: -116.6 MB). Peak memory consumption was 45.4 MB. Max. memory is 7.1 GB. [2019-01-31 17:13:47,484 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.20 ms. Allocated memory is still 141.6 MB. Free memory is still 110.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.44 ms. Allocated memory is still 141.6 MB. Free memory was 108.9 MB in the beginning and 106.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.95 ms. Allocated memory is still 141.6 MB. Free memory was 106.5 MB in the beginning and 105.3 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 544.85 ms. Allocated memory is still 141.6 MB. Free memory was 105.3 MB in the beginning and 92.6 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 398158.74 ms. Allocated memory was 141.6 MB in the beginning and 303.6 MB in the end (delta: 162.0 MB). Free memory was 92.4 MB in the beginning and 209.1 MB in the end (delta: -116.6 MB). Peak memory consumption was 45.4 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...