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/abstractInterpretation/unclassified/EasyArray2_incorrect.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:15:50,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:15:50,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:15:50,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:15:50,499 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:15:50,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:15:50,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:15:50,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:15:50,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:15:50,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:15:50,509 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:15:50,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:15:50,513 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:15:50,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:15:50,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:15:50,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:15:50,524 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:15:50,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:15:50,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:15:50,528 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:15:50,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:15:50,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:15:50,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:15:50,532 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:15:50,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:15:50,535 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:15:50,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:15:50,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:15:50,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:15:50,537 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:15:50,537 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:15:50,538 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:15:50,538 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:15:50,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:15:50,540 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:15:50,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:15:50,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:15:50,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:15:50,541 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:15:50,542 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:15:50,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:15:50,570 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:15:50,582 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:15:50,585 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:15:50,587 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:15:50,588 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:15:50,589 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/EasyArray2_incorrect.bpl [2019-08-05 11:15:50,589 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/EasyArray2_incorrect.bpl' [2019-08-05 11:15:50,625 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:15:50,627 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:15:50,627 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:15:50,628 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:15:50,628 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:15:50,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "EasyArray2_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:50" (1/1) ... [2019-08-05 11:15:50,656 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "EasyArray2_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:50" (1/1) ... [2019-08-05 11:15:50,662 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:15:50,665 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:15:50,665 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:15:50,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:15:50,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:15:50,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:15:50,669 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:15:50,680 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "EasyArray2_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:50" (1/1) ... [2019-08-05 11:15:50,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "EasyArray2_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:50" (1/1) ... [2019-08-05 11:15:50,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "EasyArray2_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:50" (1/1) ... [2019-08-05 11:15:50,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "EasyArray2_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:50" (1/1) ... [2019-08-05 11:15:50,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "EasyArray2_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:50" (1/1) ... [2019-08-05 11:15:50,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "EasyArray2_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:50" (1/1) ... [2019-08-05 11:15:50,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "EasyArray2_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:50" (1/1) ... [2019-08-05 11:15:50,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:15:50,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:15:50,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:15:50,697 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:15:50,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "EasyArray2_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory: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:15:50,770 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:15:50,771 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:15:50,771 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:15:51,173 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:15:51,174 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:15:51,175 INFO L202 PluginConnector]: Adding new model EasyArray2_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:15:51 BoogieIcfgContainer [2019-08-05 11:15:51,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:15:51,177 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:15:51,177 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:15:51,180 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:15:51,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "EasyArray2_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:50" (1/2) ... [2019-08-05 11:15:51,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585cd374 and model type EasyArray2_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:15:51, skipping insertion in model container [2019-08-05 11:15:51,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "EasyArray2_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:15:51" (2/2) ... [2019-08-05 11:15:51,184 INFO L109 eAbstractionObserver]: Analyzing ICFG EasyArray2_incorrect.bpl [2019-08-05 11:15:51,194 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:15:51,202 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:15:51,220 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:15:51,246 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:15:51,247 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:15:51,247 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:15:51,247 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:15:51,247 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:15:51,247 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:15:51,248 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:15:51,248 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:15:51,248 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:15:51,262 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 11:15:51,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:15:51,270 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:51,271 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:15:51,274 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:51,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:51,282 INFO L82 PathProgramCache]: Analyzing trace with hash 934861, now seen corresponding path program 1 times [2019-08-05 11:15:51,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:51,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:15:51,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:51,405 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:15:51,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:15:51,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:15:51,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:15:51,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:15:51,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:15:51,431 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-05 11:15:51,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:51,486 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-08-05 11:15:51,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:15:51,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 11:15:51,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:51,498 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:15:51,499 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:15:51,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:15:51,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:15:51,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 11:15:51,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:15:51,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-05 11:15:51,534 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-08-05 11:15:51,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:51,535 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-05 11:15:51,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:15:51,535 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-05 11:15:51,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:15:51,536 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:51,536 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:15:51,536 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:51,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:51,537 INFO L82 PathProgramCache]: Analyzing trace with hash 916493976, now seen corresponding path program 1 times [2019-08-05 11:15:51,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:51,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:15:51,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:51,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:15:51,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:51,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:15:51,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:15:51,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:15:51,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:15:51,699 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-08-05 11:15:51,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:51,865 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-05 11:15:51,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:15:51,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-08-05 11:15:51,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:51,867 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:15:51,867 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:15:51,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:15:51,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:15:51,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:15:51,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:15:51,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 11:15:51,872 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-08-05 11:15:51,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:51,872 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 11:15:51,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:15:51,873 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 11:15:51,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:15:51,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:51,873 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-08-05 11:15:51,874 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:51,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:51,874 INFO L82 PathProgramCache]: Analyzing trace with hash 834064621, now seen corresponding path program 2 times [2019-08-05 11:15:51,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:51,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:15:51,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:51,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 11:15:51,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:51,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:15:51,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:15:51,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:15:51,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:15:51,982 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-08-05 11:15:52,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:52,062 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-08-05 11:15:52,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:15:52,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 11:15:52,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:52,064 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:15:52,064 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:15:52,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:15:52,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:15:52,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:15:52,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:15:52,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 11:15:52,068 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-08-05 11:15:52,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:52,068 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 11:15:52,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:15:52,068 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 11:15:52,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:15:52,069 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:52,080 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-08-05 11:15:52,081 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:52,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:52,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1710742280, now seen corresponding path program 3 times [2019-08-05 11:15:52,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:52,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:15:52,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:52,246 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 11:15:52,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:52,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:15:52,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:15:52,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:15:52,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:15:52,248 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-08-05 11:15:52,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:52,399 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-05 11:15:52,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:15:52,400 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-05 11:15:52,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:52,400 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:15:52,400 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:15:52,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:15:52,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:15:52,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:15:52,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:15:52,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 11:15:52,404 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-08-05 11:15:52,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:52,405 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 11:15:52,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:15:52,405 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 11:15:52,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:15:52,406 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:52,406 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-08-05 11:15:52,406 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:52,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:52,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1786796531, now seen corresponding path program 4 times [2019-08-05 11:15:52,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:52,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:15:52,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:52,576 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 11:15:52,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:52,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:15:52,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:15:52,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:15:52,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:15:52,578 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-08-05 11:15:52,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:52,678 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-08-05 11:15:52,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:15:52,679 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-08-05 11:15:52,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:52,680 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:15:52,680 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:15:52,681 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:15:52,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:15:52,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:15:52,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:15:52,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-05 11:15:52,684 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-08-05 11:15:52,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:52,684 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-05 11:15:52,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:15:52,685 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-05 11:15:52,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:15:52,685 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:52,686 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-08-05 11:15:52,686 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:52,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:52,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1951443800, now seen corresponding path program 5 times [2019-08-05 11:15:52,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:52,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:15:52,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:52,833 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-08-05 11:15:52,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:52,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:15:52,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:15:52,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:15:52,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:15:52,835 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-08-05 11:15:52,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:52,970 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-08-05 11:15:52,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:15:52,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-08-05 11:15:52,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:52,971 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:15:52,971 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:15:52,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:15:52,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:15:52,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:15:52,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:15:52,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-08-05 11:15:52,976 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-08-05 11:15:52,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:52,977 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-08-05 11:15:52,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:15:52,977 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-08-05 11:15:52,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:15:52,978 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:52,978 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-08-05 11:15:52,978 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:52,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:52,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1718534957, now seen corresponding path program 6 times [2019-08-05 11:15:52,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:53,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:15:53,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-08-05 11:15:53,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:53,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:15:53,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:15:53,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:15:53,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:15:53,139 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-08-05 11:15:53,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:53,203 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-08-05 11:15:53,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:15:53,204 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-08-05 11:15:53,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:53,205 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:15:53,205 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:15:53,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:15:53,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:15:53,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 11:15:53,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:15:53,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-08-05 11:15:53,208 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-08-05 11:15:53,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:53,208 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-08-05 11:15:53,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:15:53,209 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-08-05 11:15:53,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:15:53,209 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:53,210 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-08-05 11:15:53,210 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:53,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:53,210 INFO L82 PathProgramCache]: Analyzing trace with hash 890513848, now seen corresponding path program 7 times [2019-08-05 11:15:53,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:53,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:15:53,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:53,658 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-08-05 11:15:53,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:53,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:15:53,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:15:53,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:15:53,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:15:53,660 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-08-05 11:15:53,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:53,704 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-08-05 11:15:53,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:15:53,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-08-05 11:15:53,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:53,705 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:15:53,705 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:15:53,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:15:53,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:15:53,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 11:15:53,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:15:53,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-08-05 11:15:53,710 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-08-05 11:15:53,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:53,710 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-08-05 11:15:53,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:15:53,710 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-08-05 11:15:53,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:15:53,711 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:53,711 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-08-05 11:15:53,711 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:53,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:53,712 INFO L82 PathProgramCache]: Analyzing trace with hash 2047486029, now seen corresponding path program 8 times [2019-08-05 11:15:53,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:53,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:15:53,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:53,879 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-08-05 11:15:53,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:53,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:15:53,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:15:53,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:15:53,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:15:53,881 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-08-05 11:15:53,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:53,971 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-08-05 11:15:53,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:15:53,971 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-08-05 11:15:53,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:53,972 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:15:53,973 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:15:53,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:15:53,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:15:53,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 11:15:53,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:15:53,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-08-05 11:15:53,977 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-08-05 11:15:53,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:53,977 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-08-05 11:15:53,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:15:53,978 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-08-05 11:15:53,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:15:53,979 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:53,979 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-08-05 11:15:53,979 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:53,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:53,980 INFO L82 PathProgramCache]: Analyzing trace with hash 292331544, now seen corresponding path program 9 times [2019-08-05 11:15:53,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:54,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:15:54,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:54,268 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-08-05 11:15:54,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:54,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:15:54,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:15:54,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:15:54,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:15:54,270 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-08-05 11:15:54,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:54,382 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-08-05 11:15:54,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:15:54,385 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-08-05 11:15:54,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:54,386 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:15:54,387 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:15:54,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:15:54,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:15:54,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 11:15:54,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:15:54,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-08-05 11:15:54,391 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-08-05 11:15:54,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:54,391 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-08-05 11:15:54,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:15:54,392 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-08-05 11:15:54,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:15:54,392 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:54,392 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-08-05 11:15:54,393 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:54,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:54,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1604856467, now seen corresponding path program 10 times [2019-08-05 11:15:54,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:15:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:15:54,750 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 11:15:54,781 INFO L202 PluginConnector]: Adding new model EasyArray2_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:15:54 BoogieIcfgContainer [2019-08-05 11:15:54,781 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:15:54,784 INFO L168 Benchmark]: Toolchain (without parser) took 4156.43 ms. Allocated memory was 141.0 MB in the beginning and 203.9 MB in the end (delta: 62.9 MB). Free memory was 109.3 MB in the beginning and 142.1 MB in the end (delta: -32.8 MB). Peak memory consumption was 30.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:54,785 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory was 110.6 MB in the beginning and 110.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 11:15:54,786 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.94 ms. Allocated memory is still 141.0 MB. Free memory was 109.3 MB in the beginning and 107.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:54,787 INFO L168 Benchmark]: Boogie Preprocessor took 28.07 ms. Allocated memory is still 141.0 MB. Free memory was 107.4 MB in the beginning and 106.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:54,788 INFO L168 Benchmark]: RCFGBuilder took 479.38 ms. Allocated memory is still 141.0 MB. Free memory was 106.1 MB in the beginning and 93.8 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:54,791 INFO L168 Benchmark]: TraceAbstraction took 3604.19 ms. Allocated memory was 141.0 MB in the beginning and 203.9 MB in the end (delta: 62.9 MB). Free memory was 93.3 MB in the beginning and 142.1 MB in the end (delta: -48.8 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:54,800 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 was 110.6 MB in the beginning and 110.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.94 ms. Allocated memory is still 141.0 MB. Free memory was 109.3 MB in the beginning and 107.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.07 ms. Allocated memory is still 141.0 MB. Free memory was 107.4 MB in the beginning and 106.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 479.38 ms. Allocated memory is still 141.0 MB. Free memory was 106.1 MB in the beginning and 93.8 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3604.19 ms. Allocated memory was 141.0 MB in the beginning and 203.9 MB in the end (delta: 62.9 MB). Free memory was 93.3 MB in the beginning and 142.1 MB in the end (delta: -48.8 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 36]: assertion can be violated assertion can be violated We found a FailurePath: [L13] arr[0] := 0; [L15] i := 0; VAL [i=0] [L16] COND TRUE i < 10 [L20] arr[i] := 10 - i; [L22] i := i + 1; VAL [i=1] [L16] COND TRUE i < 10 [L22] i := i + 1; VAL [i=2] [L16] COND TRUE i < 10 [L22] i := i + 1; VAL [i=3] [L16] COND TRUE i < 10 [L22] i := i + 1; VAL [i=4] [L16] COND TRUE i < 10 [L22] i := i + 1; VAL [i=5] [L16] COND TRUE i < 10 [L22] i := i + 1; VAL [i=6] [L16] COND TRUE i < 10 [L22] i := i + 1; VAL [i=7] [L16] COND TRUE i < 10 [L20] arr[i] := 10 - i; [L22] i := i + 1; VAL [i=8] [L16] COND TRUE i < 10 [L22] i := i + 1; VAL [i=9] [L16] COND TRUE i < 10 [L22] i := i + 1; VAL [i=10] [L16] COND FALSE !(i < 10) [L25] i := 0; [L26] max := -1; VAL [i=0, max=-1] [L27] COND TRUE i < 10 [L29] COND TRUE arr[i] > max [L31] max := arr[i]; [L33] i := i + 1; VAL [i=1, max=10] [L27] COND TRUE i < 10 [L29] COND FALSE !(arr[i] > max) [L33] i := i + 1; VAL [i=2, max=10] [L27] COND TRUE i < 10 [L29] COND FALSE !(arr[i] > max) [L33] i := i + 1; VAL [i=3, max=10] [L27] COND TRUE i < 10 [L29] COND TRUE arr[i] > max [L31] max := arr[i]; [L33] i := i + 1; VAL [i=4, max=11] [L27] COND TRUE i < 10 [L29] COND TRUE arr[i] > max [L31] max := arr[i]; [L33] i := i + 1; VAL [i=5, max=12] [L27] COND TRUE i < 10 [L29] COND TRUE arr[i] > max [L31] max := arr[i]; [L33] i := i + 1; VAL [i=6, max=13] [L27] COND TRUE i < 10 [L29] COND FALSE !(arr[i] > max) [L33] i := i + 1; VAL [i=7, max=13] [L27] COND TRUE i < 10 [L29] COND FALSE !(arr[i] > max) [L33] i := i + 1; VAL [i=8, max=13] [L27] COND TRUE i < 10 [L29] COND FALSE !(arr[i] > max) [L33] i := i + 1; VAL [i=9, max=13] [L27] COND TRUE i < 10 [L29] COND TRUE arr[i] > max [L31] max := arr[i]; [L33] i := i + 1; VAL [i=10, max=14] [L27] COND FALSE !(i < 10) VAL [i=10, max=14] [L36] assert max == 10; VAL [i=10, max=14] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. UNSAFE Result, 3.5s OverallTime, 11 OverallIterations, 10 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 41 SDtfs, 0 SDslu, 29 SDs, 0 SdLazy, 158 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=10, 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, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 3420 SizeOfPredicates, 0 NumberOfNonLiveVariables, 480 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 165/330 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...