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 -i ../../../trunk/examples/programs/loopAcceleration/loopAccelerationWerner/tripleNestedLoop.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:18:16,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:18:16,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:18:16,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:18:16,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:18:16,512 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:18:16,513 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:18:16,515 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:18:16,518 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:18:16,519 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:18:16,527 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:18:16,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:18:16,528 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:18:16,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:18:16,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:18:16,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:18:16,534 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:18:16,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:18:16,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:18:16,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:18:16,546 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:18:16,549 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:18:16,550 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:18:16,551 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:18:16,554 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:18:16,554 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:18:16,554 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:18:16,556 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:18:16,556 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:18:16,559 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:18:16,559 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:18:16,560 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:18:16,563 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:18:16,564 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:18:16,566 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:18:16,566 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:18:16,567 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:18:16,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:18:16,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:18:16,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:18:16,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:18:16,618 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:18:16,633 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:18:16,638 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:18:16,640 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:18:16,640 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:18:16,641 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/loopAcceleration/loopAccelerationWerner/tripleNestedLoop.bpl [2019-08-05 11:18:16,641 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/loopAcceleration/loopAccelerationWerner/tripleNestedLoop.bpl' [2019-08-05 11:18:16,675 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:18:16,677 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:18:16,677 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:18:16,677 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:18:16,678 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:18:16,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "tripleNestedLoop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:16" (1/1) ... [2019-08-05 11:18:16,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "tripleNestedLoop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:16" (1/1) ... [2019-08-05 11:18:16,711 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:18:16,711 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:18:16,711 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:18:16,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:18:16,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:18:16,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:18:16,714 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:18:16,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "tripleNestedLoop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:16" (1/1) ... [2019-08-05 11:18:16,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "tripleNestedLoop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:16" (1/1) ... [2019-08-05 11:18:16,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "tripleNestedLoop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:16" (1/1) ... [2019-08-05 11:18:16,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "tripleNestedLoop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:16" (1/1) ... [2019-08-05 11:18:16,732 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "tripleNestedLoop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:16" (1/1) ... [2019-08-05 11:18:16,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "tripleNestedLoop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:16" (1/1) ... [2019-08-05 11:18:16,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "tripleNestedLoop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:16" (1/1) ... [2019-08-05 11:18:16,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:18:16,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:18:16,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:18:16,743 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:18:16,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "tripleNestedLoop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:16" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:18:16,814 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:18:16,815 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:18:16,815 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:18:17,083 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:18:17,084 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:18:17,085 INFO L202 PluginConnector]: Adding new model tripleNestedLoop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:18:17 BoogieIcfgContainer [2019-08-05 11:18:17,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:18:17,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:18:17,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:18:17,090 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:18:17,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "tripleNestedLoop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:18:16" (1/2) ... [2019-08-05 11:18:17,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df793db and model type tripleNestedLoop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:18:17, skipping insertion in model container [2019-08-05 11:18:17,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "tripleNestedLoop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:18:17" (2/2) ... [2019-08-05 11:18:17,093 INFO L109 eAbstractionObserver]: Analyzing ICFG tripleNestedLoop.bpl [2019-08-05 11:18:17,103 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:18:17,110 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-08-05 11:18:17,127 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-08-05 11:18:17,158 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:18:17,159 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:18:17,159 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:18:17,159 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:18:17,159 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:18:17,160 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:18:17,160 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:18:17,160 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:18:17,160 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:18:17,175 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-08-05 11:18:17,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:18:17,184 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:17,188 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:18:17,194 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:17,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:17,202 INFO L82 PathProgramCache]: Analyzing trace with hash 30368, now seen corresponding path program 1 times [2019-08-05 11:18:17,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:17,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:18:17,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:17,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:17,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:18:17,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:18:17,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:18:17,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:18:17,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:18:17,387 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-08-05 11:18:17,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:17,477 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-08-05 11:18:17,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:18:17,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:18:17,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:17,490 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:18:17,490 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:18:17,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-08-05 11:18:17,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:18:17,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:18:17,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:18:17,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-08-05 11:18:17,526 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 3 [2019-08-05 11:18:17,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:17,526 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-08-05 11:18:17,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:18:17,526 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-08-05 11:18:17,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:18:17,527 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:17,527 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:18:17,528 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:17,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:17,528 INFO L82 PathProgramCache]: Analyzing trace with hash 28764268, now seen corresponding path program 1 times [2019-08-05 11:18:17,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:17,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:18:17,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:17,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:18:17,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:18:17,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:18:17,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:18:17,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:18:17,575 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 3 states. [2019-08-05 11:18:17,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:17,617 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-08-05 11:18:17,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:18:17,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 11:18:17,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:17,618 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:18:17,618 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:18:17,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-08-05 11:18:17,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:18:17,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:18:17,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:18:17,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-08-05 11:18:17,623 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 5 [2019-08-05 11:18:17,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:17,623 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-08-05 11:18:17,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:18:17,624 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-08-05 11:18:17,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:18:17,624 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:17,624 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:18:17,625 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:17,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:17,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1865148134, now seen corresponding path program 1 times [2019-08-05 11:18:17,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:17,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:18:17,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:17,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:18:17,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:18:17,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:18:17,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:18:17,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:18:17,659 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 3 states. [2019-08-05 11:18:17,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:17,679 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-08-05 11:18:17,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:18:17,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-08-05 11:18:17,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:17,680 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:18:17,680 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:18:17,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-08-05 11:18:17,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:18:17,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:18:17,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:18:17,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-08-05 11:18:17,688 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2019-08-05 11:18:17,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:17,689 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-08-05 11:18:17,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:18:17,689 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-08-05 11:18:17,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:18:17,689 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:17,690 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:18:17,690 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:17,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:17,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1983108748, now seen corresponding path program 1 times [2019-08-05 11:18:17,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:17,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:18:17,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:17,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:18:17,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:17,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:18:17,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:18:17,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:18:17,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:17,747 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 4 states. [2019-08-05 11:18:17,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:17,821 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2019-08-05 11:18:17,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:18:17,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-08-05 11:18:17,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:17,824 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:18:17,824 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:18:17,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:17,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:18:17,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:18:17,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:18:17,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-08-05 11:18:17,830 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2019-08-05 11:18:17,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:17,831 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-08-05 11:18:17,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:18:17,831 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-08-05 11:18:17,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:18:17,832 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:17,832 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:18:17,833 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:17,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:17,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1344920486, now seen corresponding path program 2 times [2019-08-05 11:18:17,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:17,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:18:17,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 11:18:17,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:17,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:18:17,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:18:17,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:18:17,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:17,888 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 4 states. [2019-08-05 11:18:17,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:17,925 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-08-05 11:18:17,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:18:17,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-08-05 11:18:17,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:17,940 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:18:17,940 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:18:17,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:17,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:18:17,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:18:17,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:18:17,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-08-05 11:18:17,946 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 9 [2019-08-05 11:18:17,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:17,947 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-08-05 11:18:17,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:18:17,948 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2019-08-05 11:18:17,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:18:17,948 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:17,948 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 11:18:17,949 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:17,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:17,949 INFO L82 PathProgramCache]: Analyzing trace with hash -324078688, now seen corresponding path program 3 times [2019-08-05 11:18:17,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:17,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:18:17,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:18,009 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-08-05 11:18:18,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:18:18,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:18:18,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:18:18,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:18:18,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:18,011 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 4 states. [2019-08-05 11:18:18,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:18,080 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-08-05 11:18:18,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:18:18,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-08-05 11:18:18,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:18,083 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:18:18,083 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:18:18,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:18,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:18:18,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 11:18:18,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:18:18,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-08-05 11:18:18,089 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 11 [2019-08-05 11:18:18,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:18,091 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-08-05 11:18:18,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:18:18,091 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-08-05 11:18:18,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:18:18,092 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:18,092 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1] [2019-08-05 11:18:18,094 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:18,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:18,094 INFO L82 PathProgramCache]: Analyzing trace with hash 2092574060, now seen corresponding path program 4 times [2019-08-05 11:18:18,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:18,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:18:18,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:18,158 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 11:18:18,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:18:18,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:18:18,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:18:18,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:18:18,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:18,160 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 4 states. [2019-08-05 11:18:18,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:18,210 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-08-05 11:18:18,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:18:18,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-08-05 11:18:18,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:18,212 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:18:18,212 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:18:18,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:18,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:18:18,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 11:18:18,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:18:18,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2019-08-05 11:18:18,217 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 13 [2019-08-05 11:18:18,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:18,217 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-08-05 11:18:18,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:18:18,218 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2019-08-05 11:18:18,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:18:18,220 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:18,220 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:18:18,220 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:18,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:18,221 INFO L82 PathProgramCache]: Analyzing trace with hash 445286472, now seen corresponding path program 1 times [2019-08-05 11:18:18,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:18,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:18:18,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:18,295 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 11:18:18,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:18:18,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:18:18,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:18:18,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:18:18,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:18,296 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand 4 states. [2019-08-05 11:18:18,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:18,380 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-08-05 11:18:18,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:18:18,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-08-05 11:18:18,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:18,382 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:18:18,382 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:18:18,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:18,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:18:18,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:18:18,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:18:18,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-08-05 11:18:18,387 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 14 [2019-08-05 11:18:18,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:18,387 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-08-05 11:18:18,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:18:18,387 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2019-08-05 11:18:18,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:18:18,388 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:18:18,388 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 11:18:18,389 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:18:18,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:18:18,389 INFO L82 PathProgramCache]: Analyzing trace with hash 918978798, now seen corresponding path program 1 times [2019-08-05 11:18:18,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:18:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:18:18,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:18:18,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:18:18,516 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-08-05 11:18:18,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:18:18,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:18:18,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:18:18,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:18:18,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:18,518 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 4 states. [2019-08-05 11:18:18,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:18:18,543 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-08-05 11:18:18,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:18:18,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-08-05 11:18:18,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:18:18,544 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:18:18,544 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:18:18,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:18:18,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:18:18,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:18:18,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:18:18,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:18:18,545 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2019-08-05 11:18:18,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:18:18,546 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:18:18,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:18:18,546 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:18:18,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:18:18,551 INFO L202 PluginConnector]: Adding new model tripleNestedLoop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:18:18 BoogieIcfgContainer [2019-08-05 11:18:18,551 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:18:18,554 INFO L168 Benchmark]: Toolchain (without parser) took 1876.35 ms. Allocated memory was 141.0 MB in the beginning and 177.2 MB in the end (delta: 36.2 MB). Free memory was 110.6 MB in the beginning and 123.4 MB in the end (delta: -12.8 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:18:18,555 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory is still 111.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:18:18,556 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.31 ms. Allocated memory is still 141.0 MB. Free memory was 110.6 MB in the beginning and 108.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:18:18,557 INFO L168 Benchmark]: Boogie Preprocessor took 28.02 ms. Allocated memory is still 141.0 MB. Free memory was 108.6 MB in the beginning and 107.7 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 7.1 GB. [2019-08-05 11:18:18,558 INFO L168 Benchmark]: RCFGBuilder took 342.75 ms. Allocated memory is still 141.0 MB. Free memory was 107.3 MB in the beginning and 97.5 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:18:18,559 INFO L168 Benchmark]: TraceAbstraction took 1464.86 ms. Allocated memory was 141.0 MB in the beginning and 177.2 MB in the end (delta: 36.2 MB). Free memory was 97.5 MB in the beginning and 123.4 MB in the end (delta: -26.0 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:18:18,563 INFO L335 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 141.0 MB. Free memory is still 111.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.31 ms. Allocated memory is still 141.0 MB. Free memory was 110.6 MB in the beginning and 108.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.02 ms. Allocated memory is still 141.0 MB. Free memory was 108.6 MB in the beginning and 107.7 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 7.1 GB. * RCFGBuilder took 342.75 ms. Allocated memory is still 141.0 MB. Free memory was 107.3 MB in the beginning and 97.5 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1464.86 ms. Allocated memory was 141.0 MB in the beginning and 177.2 MB in the end (delta: 36.2 MB). Free memory was 97.5 MB in the beginning and 123.4 MB in the end (delta: -26.0 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 26]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 24]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 25]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 3 error locations. SAFE Result, 1.4s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 92 SDtfs, 27 SDslu, 63 SDs, 0 SdLazy, 50 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 2512 SizeOfPredicates, 6 NumberOfNonLiveVariables, 217 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 63/66 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...