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-2-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-e1a14da [2018-12-24 13:51:10,469 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-24 13:51:10,475 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-24 13:51:10,487 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-24 13:51:10,488 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-24 13:51:10,489 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-24 13:51:10,490 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-24 13:51:10,492 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-24 13:51:10,494 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-24 13:51:10,495 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-24 13:51:10,496 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-24 13:51:10,496 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-24 13:51:10,497 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-24 13:51:10,498 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-24 13:51:10,499 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-24 13:51:10,500 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-24 13:51:10,501 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-24 13:51:10,503 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-24 13:51:10,505 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-24 13:51:10,506 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-24 13:51:10,507 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-24 13:51:10,509 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-24 13:51:10,511 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-24 13:51:10,512 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-24 13:51:10,512 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-24 13:51:10,513 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-24 13:51:10,514 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-24 13:51:10,514 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-24 13:51:10,515 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-24 13:51:10,516 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-24 13:51:10,517 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-24 13:51:10,517 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-24 13:51:10,517 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-24 13:51:10,518 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-24 13:51:10,519 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-24 13:51:10,520 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-24 13:51:10,520 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 [2018-12-24 13:51:10,545 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-24 13:51:10,545 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-24 13:51:10,546 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-24 13:51:10,546 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-24 13:51:10,546 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-24 13:51:10,547 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-24 13:51:10,547 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-24 13:51:10,547 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-24 13:51:10,547 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-24 13:51:10,548 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-24 13:51:10,551 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-24 13:51:10,551 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-24 13:51:10,551 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-24 13:51:10,551 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-24 13:51:10,552 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-24 13:51:10,553 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-24 13:51:10,553 INFO L133 SettingsManager]: * Use SBE=true [2018-12-24 13:51:10,553 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-24 13:51:10,553 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-24 13:51:10,553 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-24 13:51:10,555 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-24 13:51:10,555 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-24 13:51:10,556 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-24 13:51:10,556 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-24 13:51:10,556 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-24 13:51:10,556 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-24 13:51:10,556 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-24 13:51:10,557 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-24 13:51:10,557 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-24 13:51:10,557 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-24 13:51:10,557 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-24 13:51:10,558 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 13:51:10,558 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-24 13:51:10,558 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-24 13:51:10,558 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-24 13:51:10,558 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-24 13:51:10,560 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-24 13:51:10,560 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-24 13:51:10,561 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-24 13:51:10,561 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-24 13:51:10,601 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-24 13:51:10,615 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-24 13:51:10,620 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-24 13:51:10,622 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-24 13:51:10,622 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-24 13:51:10,623 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-unlimited.bpl [2018-12-24 13:51:10,624 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-unlimited.bpl' [2018-12-24 13:51:10,668 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-24 13:51:10,670 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-24 13:51:10,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-24 13:51:10,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-24 13:51:10,671 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-24 13:51:10,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:10" (1/1) ... [2018-12-24 13:51:10,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:10" (1/1) ... [2018-12-24 13:51:10,735 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-24 13:51:10,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-24 13:51:10,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-24 13:51:10,736 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-24 13:51:10,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:10" (1/1) ... [2018-12-24 13:51:10,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:10" (1/1) ... [2018-12-24 13:51:10,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:10" (1/1) ... [2018-12-24 13:51:10,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:10" (1/1) ... [2018-12-24 13:51:10,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:10" (1/1) ... [2018-12-24 13:51:10,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:10" (1/1) ... [2018-12-24 13:51:10,760 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:10" (1/1) ... [2018-12-24 13:51:10,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-24 13:51:10,763 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-24 13:51:10,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-24 13:51:10,764 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-24 13:51:10,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 13:51:10,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-24 13:51:10,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-24 13:51:11,053 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-24 13:51:11,054 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-24 13:51:11,054 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:51:11 BoogieIcfgContainer [2018-12-24 13:51:11,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-24 13:51:11,055 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-24 13:51:11,056 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-24 13:51:11,059 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-24 13:51:11,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:51:10" (1/2) ... [2018-12-24 13:51:11,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ef9bc7 and model type speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:51:11, skipping insertion in model container [2018-12-24 13:51:11,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:51:11" (2/2) ... [2018-12-24 13:51:11,062 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-2-unlimited.bpl [2018-12-24 13:51:11,072 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-24 13:51:11,080 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-24 13:51:11,099 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-24 13:51:11,140 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-24 13:51:11,140 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-24 13:51:11,141 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-24 13:51:11,141 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-24 13:51:11,141 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-24 13:51:11,141 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-24 13:51:11,141 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-24 13:51:11,142 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-24 13:51:11,161 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-12-24 13:51:11,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-24 13:51:11,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:11,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-24 13:51:11,177 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:11,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:11,187 INFO L82 PathProgramCache]: Analyzing trace with hash 972, now seen corresponding path program 1 times [2018-12-24 13:51:11,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:11,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:11,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:11,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:11,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:11,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:11,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 13:51:11,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-24 13:51:11,374 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:51:11,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 13:51:11,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 13:51:11,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 13:51:11,392 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-12-24 13:51:11,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:11,548 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2018-12-24 13:51:11,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:51:11,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-24 13:51:11,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:11,571 INFO L225 Difference]: With dead ends: 13 [2018-12-24 13:51:11,575 INFO L226 Difference]: Without dead ends: 8 [2018-12-24 13:51:11,582 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 [2018-12-24 13:51:11,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-24 13:51:11,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 6. [2018-12-24 13:51:11,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-24 13:51:11,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2018-12-24 13:51:11,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 2 [2018-12-24 13:51:11,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:11,637 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2018-12-24 13:51:11,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 13:51:11,637 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2018-12-24 13:51:11,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 13:51:11,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:11,638 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 13:51:11,638 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:11,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:11,639 INFO L82 PathProgramCache]: Analyzing trace with hash 29988, now seen corresponding path program 1 times [2018-12-24 13:51:11,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:11,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:11,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:11,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:11,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:11,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:11,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:11,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:11,841 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-24 13:51:11,843 INFO L207 CegarAbsIntRunner]: [0], [6], [11] [2018-12-24 13:51:11,894 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:11,895 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:11,972 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:11,976 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 24 root evaluator evaluations with a maximum evaluation depth of 2. Performed 24 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:51:11,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:11,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:11,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:11,987 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 [2018-12-24 13:51:12,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:12,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:12,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:12,067 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 9 treesize of output 12 [2018-12-24 13:51:12,095 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-24 13:51:12,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:12,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:12,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:12,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2018-12-24 13:51:12,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:12,166 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2018-12-24 13:51:12,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:12,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:12,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2018-12-24 13:51:12,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:12,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:12,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:12,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-24 13:51:12,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2018-12-24 13:51:12,245 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:51:12,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 13:51:12,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 13:51:12,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-24 13:51:12,247 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2018-12-24 13:51:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:12,329 INFO L93 Difference]: Finished difference Result 10 states and 17 transitions. [2018-12-24 13:51:12,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-24 13:51:12,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-24 13:51:12,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:12,333 INFO L225 Difference]: With dead ends: 10 [2018-12-24 13:51:12,333 INFO L226 Difference]: Without dead ends: 9 [2018-12-24 13:51:12,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-24 13:51:12,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-24 13:51:12,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-12-24 13:51:12,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-24 13:51:12,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2018-12-24 13:51:12,340 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 13 transitions. Word has length 3 [2018-12-24 13:51:12,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:12,340 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 13 transitions. [2018-12-24 13:51:12,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 13:51:12,340 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 13 transitions. [2018-12-24 13:51:12,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 13:51:12,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:12,341 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 13:51:12,342 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:12,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:12,342 INFO L82 PathProgramCache]: Analyzing trace with hash 30050, now seen corresponding path program 1 times [2018-12-24 13:51:12,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:12,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:12,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:12,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:12,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:12,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:12,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:12,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:12,439 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-24 13:51:12,439 INFO L207 CegarAbsIntRunner]: [0], [8], [11] [2018-12-24 13:51:12,440 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:12,441 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:12,445 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:12,445 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 24 root evaluator evaluations with a maximum evaluation depth of 2. Performed 24 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:51:12,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:12,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:12,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:12,446 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 [2018-12-24 13:51:12,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:12,466 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:12,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:12,556 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 9 treesize of output 12 [2018-12-24 13:51:12,573 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:12,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:12,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:12,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-24 13:51:12,619 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:12,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:12,638 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2018-12-24 13:51:12,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:12,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-12-24 13:51:12,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:12,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:12,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2018-12-24 13:51:12,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:12,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:13,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:13,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:13,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 13:51:13,057 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:13,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 13:51:13,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 13:51:13,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:51:13,059 INFO L87 Difference]: Start difference. First operand 7 states and 13 transitions. Second operand 6 states. [2018-12-24 13:51:13,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:13,306 INFO L93 Difference]: Finished difference Result 17 states and 27 transitions. [2018-12-24 13:51:13,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 13:51:13,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2018-12-24 13:51:13,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:13,307 INFO L225 Difference]: With dead ends: 17 [2018-12-24 13:51:13,308 INFO L226 Difference]: Without dead ends: 14 [2018-12-24 13:51:13,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-12-24 13:51:13,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-24 13:51:13,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2018-12-24 13:51:13,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-24 13:51:13,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2018-12-24 13:51:13,314 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 21 transitions. Word has length 3 [2018-12-24 13:51:13,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:13,314 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 21 transitions. [2018-12-24 13:51:13,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 13:51:13,315 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 21 transitions. [2018-12-24 13:51:13,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:51:13,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:13,315 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:51:13,316 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:13,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:13,316 INFO L82 PathProgramCache]: Analyzing trace with hash 929546, now seen corresponding path program 1 times [2018-12-24 13:51:13,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:13,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:13,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:13,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:13,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:13,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:13,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:13,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:13,433 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:51:13,433 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [11] [2018-12-24 13:51:13,438 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:13,438 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:13,444 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:13,444 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 26 root evaluator evaluations with a maximum evaluation depth of 2. Performed 26 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:51:13,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:13,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:13,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:13,445 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 [2018-12-24 13:51:13,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:13,454 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:13,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:13,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-24 13:51:13,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:13,498 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 9 treesize of output 12 [2018-12-24 13:51:13,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:13,503 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:13,515 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:13,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:13,527 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2018-12-24 13:51:13,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:13,583 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-12-24 13:51:13,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:13,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:13,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2018-12-24 13:51:13,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:13,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:13,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:13,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:13,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-24 13:51:13,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:13,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:13,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-12-24 13:51:13,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:13,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:14,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:14,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:14,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:51:14,082 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:14,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:51:14,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:51:14,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:51:14,083 INFO L87 Difference]: Start difference. First operand 10 states and 21 transitions. Second operand 8 states. [2018-12-24 13:51:14,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:14,262 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2018-12-24 13:51:14,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:51:14,263 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2018-12-24 13:51:14,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:14,264 INFO L225 Difference]: With dead ends: 18 [2018-12-24 13:51:14,264 INFO L226 Difference]: Without dead ends: 15 [2018-12-24 13:51:14,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:51:14,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-24 13:51:14,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 6. [2018-12-24 13:51:14,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-24 13:51:14,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2018-12-24 13:51:14,269 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 4 [2018-12-24 13:51:14,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:14,269 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2018-12-24 13:51:14,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:51:14,270 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2018-12-24 13:51:14,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:51:14,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:14,270 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:51:14,271 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:14,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:14,271 INFO L82 PathProgramCache]: Analyzing trace with hash 931594, now seen corresponding path program 1 times [2018-12-24 13:51:14,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:14,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:14,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:14,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:14,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:14,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:14,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:14,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:14,301 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:51:14,302 INFO L207 CegarAbsIntRunner]: [0], [8], [12], [13] [2018-12-24 13:51:14,303 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:14,304 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:14,311 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:14,311 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 26 root evaluator evaluations with a maximum evaluation depth of 2. Performed 26 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:51:14,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:14,312 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:14,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:14,312 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 [2018-12-24 13:51:14,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:14,321 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:14,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:14,330 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 9 treesize of output 12 [2018-12-24 13:51:14,338 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-24 13:51:14,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:14,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:14,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:14,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2018-12-24 13:51:14,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:14,380 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2018-12-24 13:51:14,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:14,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:14,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2018-12-24 13:51:14,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:14,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:14,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:14,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-24 13:51:14,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2018-12-24 13:51:14,429 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:51:14,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 13:51:14,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 13:51:14,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-24 13:51:14,430 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2018-12-24 13:51:14,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:14,515 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2018-12-24 13:51:14,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-24 13:51:14,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-24 13:51:14,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:14,516 INFO L225 Difference]: With dead ends: 12 [2018-12-24 13:51:14,516 INFO L226 Difference]: Without dead ends: 10 [2018-12-24 13:51:14,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-24 13:51:14,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-24 13:51:14,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-12-24 13:51:14,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-24 13:51:14,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2018-12-24 13:51:14,523 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 4 [2018-12-24 13:51:14,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:14,524 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 14 transitions. [2018-12-24 13:51:14,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 13:51:14,524 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 14 transitions. [2018-12-24 13:51:14,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:51:14,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:14,525 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-24 13:51:14,525 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:14,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:14,525 INFO L82 PathProgramCache]: Analyzing trace with hash 28814048, now seen corresponding path program 1 times [2018-12-24 13:51:14,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:14,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:14,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:14,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:14,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-24 13:51:14,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 13:51:14,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-24 13:51:14,584 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:51:14,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 13:51:14,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 13:51:14,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-24 13:51:14,585 INFO L87 Difference]: Start difference. First operand 8 states and 14 transitions. Second operand 4 states. [2018-12-24 13:51:14,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:14,731 INFO L93 Difference]: Finished difference Result 11 states and 18 transitions. [2018-12-24 13:51:14,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:51:14,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-24 13:51:14,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:14,732 INFO L225 Difference]: With dead ends: 11 [2018-12-24 13:51:14,732 INFO L226 Difference]: Without dead ends: 9 [2018-12-24 13:51:14,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-24 13:51:14,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-24 13:51:14,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-24 13:51:14,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-24 13:51:14,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2018-12-24 13:51:14,737 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 16 transitions. Word has length 5 [2018-12-24 13:51:14,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:14,738 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 16 transitions. [2018-12-24 13:51:14,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 13:51:14,738 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2018-12-24 13:51:14,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:51:14,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:14,738 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-24 13:51:14,739 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:14,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:14,739 INFO L82 PathProgramCache]: Analyzing trace with hash 28873630, now seen corresponding path program 1 times [2018-12-24 13:51:14,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:14,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:14,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:14,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:14,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:14,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:14,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:14,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:14,803 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-24 13:51:14,803 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [12], [13] [2018-12-24 13:51:14,805 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:51:14,805 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:51:14,809 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:51:14,809 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 28 root evaluator evaluations with a maximum evaluation depth of 2. Performed 28 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-24 13:51:14,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:14,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:51:14,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:14,810 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 [2018-12-24 13:51:14,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:14,818 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:14,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:14,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-24 13:51:14,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:14,862 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 9 treesize of output 12 [2018-12-24 13:51:14,864 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-24 13:51:14,865 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:14,874 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:14,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:14,878 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2018-12-24 13:51:14,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:14,909 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-12-24 13:51:14,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:14,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:14,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2018-12-24 13:51:14,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:14,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:14,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:15,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 13:51:15,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2018-12-24 13:51:15,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:15,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-24 13:51:15,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2018-12-24 13:51:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:15,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:15,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:15,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:51:15,109 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:15,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:51:15,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:51:15,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:51:15,109 INFO L87 Difference]: Start difference. First operand 9 states and 16 transitions. Second operand 8 states. [2018-12-24 13:51:15,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:15,261 INFO L93 Difference]: Finished difference Result 12 states and 22 transitions. [2018-12-24 13:51:15,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:51:15,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-24 13:51:15,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:15,262 INFO L225 Difference]: With dead ends: 12 [2018-12-24 13:51:15,262 INFO L226 Difference]: Without dead ends: 0 [2018-12-24 13:51:15,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:51:15,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-24 13:51:15,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-24 13:51:15,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-24 13:51:15,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-24 13:51:15,264 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2018-12-24 13:51:15,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:15,264 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-24 13:51:15,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:51:15,264 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-24 13:51:15,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-24 13:51:15,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-24 13:51:15,604 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2018-12-24 13:51:15,607 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2018-12-24 13:51:15,607 INFO L448 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2018-12-24 13:51:15,607 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2018-12-24 13:51:15,607 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 31) no Hoare annotation was computed. [2018-12-24 13:51:15,608 INFO L444 ceAbstractionStarter]: At program point L24-1(lines 23 29) the Hoare annotation is: (let ((.cse2 (select |#memory_int| ULTIMATE.start_main_p1))) (let ((.cse0 (let ((.cse3 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))) (or (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 1 .cse3)) (and (= .cse2 0) (= 0 .cse3))))) (.cse1 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse2 1)) ULTIMATE.start_main_p2))) (or (and .cse0 (= 0 .cse1)) (and .cse0 (<= (+ .cse1 1) 0))))) [2018-12-24 13:51:15,608 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 34) no Hoare annotation was computed. [2018-12-24 13:51:15,608 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 32) no Hoare annotation was computed. [2018-12-24 13:51:15,621 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 01:51:15 BoogieIcfgContainer [2018-12-24 13:51:15,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-24 13:51:15,622 INFO L168 Benchmark]: Toolchain (without parser) took 4953.38 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 684.7 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -627.8 MB). Peak memory consumption was 57.0 MB. Max. memory is 7.1 GB. [2018-12-24 13:51:15,624 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 13:51:15,624 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 13:51:15,625 INFO L168 Benchmark]: Boogie Preprocessor took 27.11 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 13:51:15,625 INFO L168 Benchmark]: RCFGBuilder took 291.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-24 13:51:15,626 INFO L168 Benchmark]: TraceAbstraction took 4565.89 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 684.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -648.9 MB). Peak memory consumption was 35.8 MB. Max. memory is 7.1 GB. [2018-12-24 13:51:15,630 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.72 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.11 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 291.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4565.89 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 684.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -648.9 MB). Peak memory consumption was 35.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 32]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 31]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((!(p1 == p2) && 1 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) || (#memory_int[p1] == 0 && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1])) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) || (((!(p1 == p2) && 1 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) || (#memory_int[p1] == 0 && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1])) && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 2 error locations. SAFE Result, 4.4s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 13 SDtfs, 31 SDslu, 1 SDs, 0 SdLazy, 175 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 8 NumberOfFragments, 101 HoareAnnotationTreeSize, 1 FomulaSimplifications, 594 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 561 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 47 ConstructedInterpolants, 4 QuantifiedInterpolants, 1521 SizeOfPredicates, 11 NumberOfNonLiveVariables, 69 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 9/30 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...