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/reals/bball.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:30:29,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:30:29,463 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:30:29,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:30:29,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:30:29,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:30:29,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:30:29,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:30:29,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:30:29,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:30:29,490 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:30:29,491 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:30:29,492 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:30:29,493 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:30:29,494 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:30:29,495 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:30:29,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:30:29,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:30:29,508 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:30:29,510 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:30:29,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:30:29,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:30:29,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:30:29,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:30:29,520 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:30:29,520 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:30:29,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:30:29,521 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:30:29,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:30:29,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:30:29,522 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:30:29,523 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:30:29,524 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:30:29,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:30:29,527 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:30:29,527 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:30:29,528 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:30:29,528 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:30:29,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:30:29,529 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:30:29,530 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:30:29,567 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:30:29,582 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:30:29,586 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:30:29,588 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:30:29,589 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:30:29,589 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/reals/bball.bpl [2019-08-05 10:30:29,590 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/reals/bball.bpl' [2019-08-05 10:30:29,627 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:30:29,629 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:30:29,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:30:29,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:30:29,630 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:30:29,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "bball.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:29" (1/1) ... [2019-08-05 10:30:29,657 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "bball.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:29" (1/1) ... [2019-08-05 10:30:29,663 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:30:29,664 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:30:29,664 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:30:29,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:30:29,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:30:29,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:30:29,667 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:30:29,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "bball.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:29" (1/1) ... [2019-08-05 10:30:29,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "bball.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:29" (1/1) ... [2019-08-05 10:30:29,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "bball.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:29" (1/1) ... [2019-08-05 10:30:29,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "bball.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:29" (1/1) ... [2019-08-05 10:30:29,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "bball.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:29" (1/1) ... [2019-08-05 10:30:29,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "bball.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:29" (1/1) ... [2019-08-05 10:30:29,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "bball.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:29" (1/1) ... [2019-08-05 10:30:29,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:30:29,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:30:29,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:30:29,692 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:30:29,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "bball.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:29" (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 10:30:29,769 INFO L124 BoogieDeclarations]: Specification and implementation of procedure BouncingBallExample given in one single declaration [2019-08-05 10:30:29,769 INFO L130 BoogieDeclarations]: Found specification of procedure BouncingBallExample [2019-08-05 10:30:29,769 INFO L138 BoogieDeclarations]: Found implementation of procedure BouncingBallExample [2019-08-05 10:30:30,254 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:30:30,254 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:30:30,255 INFO L202 PluginConnector]: Adding new model bball.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:30:30 BoogieIcfgContainer [2019-08-05 10:30:30,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:30:30,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:30:30,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:30:30,260 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:30:30,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bball.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:29" (1/2) ... [2019-08-05 10:30:30,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b593276 and model type bball.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:30:30, skipping insertion in model container [2019-08-05 10:30:30,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "bball.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:30:30" (2/2) ... [2019-08-05 10:30:30,264 INFO L109 eAbstractionObserver]: Analyzing ICFG bball.bpl [2019-08-05 10:30:30,273 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:30:30,290 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:30:30,309 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:30:30,335 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:30:30,336 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:30:30,337 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:30:30,337 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:30:30,337 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:30:30,337 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:30:30,337 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:30:30,338 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:30:30,338 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:30:30,352 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:30:30,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:30:30,360 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:30,361 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:30:30,364 INFO L418 AbstractCegarLoop]: === Iteration 1 === [BouncingBallExampleErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:30:30,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:30,370 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-08-05 10:30:30,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:30,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:30:30,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:30,483 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 10:30:30,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:30:30,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:30:30,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:30:30,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:30:30,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:30:30,505 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:30:30,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:30,584 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:30:30,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:30:30,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:30:30,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:30,597 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:30:30,597 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:30:30,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:30:30,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:30:30,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 5. [2019-08-05 10:30:30,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:30:30,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:30:30,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 2 [2019-08-05 10:30:30,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:30,631 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:30:30,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:30:30,631 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:30:30,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:30:30,632 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:30,632 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:30:30,633 INFO L418 AbstractCegarLoop]: === Iteration 2 === [BouncingBallExampleErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:30:30,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:30,633 INFO L82 PathProgramCache]: Analyzing trace with hash 927522, now seen corresponding path program 1 times [2019-08-05 10:30:30,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:30,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:30:30,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:30,736 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:30,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:30,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:30,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 10:30:30,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:30:30,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:30:30,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:30:30,827 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:30:30,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:30,957 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:30:30,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:30:30,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:30:30,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:30,958 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:30:30,958 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:30:30,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 10:30:30,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:30:30,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-08-05 10:30:30,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:30:30,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:30:30,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-08-05 10:30:30,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:30,963 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:30:30,963 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:30:30,963 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:30:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:30:30,964 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:30,964 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1] [2019-08-05 10:30:30,964 INFO L418 AbstractCegarLoop]: === Iteration 3 === [BouncingBallExampleErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:30:30,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:30,965 INFO L82 PathProgramCache]: Analyzing trace with hash 891350721, now seen corresponding path program 2 times [2019-08-05 10:30:30,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:31,004 WARN L254 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:30:31,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:31,114 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:31,117 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:31,120 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:31,313 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 7 [2019-08-05 10:30:31,326 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:31,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:31,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:31,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:30:31,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:30:31,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:30:31,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:30:31,408 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-08-05 10:30:31,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:31,470 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:30:31,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:30:31,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 10:30:31,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:31,471 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:30:31,471 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:30:31,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:30:31,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:30:31,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 10:30:31,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:30:31,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:30:31,476 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-08-05 10:30:31,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:31,476 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:30:31,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:30:31,476 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:30:31,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:30:31,477 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:31,477 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1] [2019-08-05 10:30:31,477 INFO L418 AbstractCegarLoop]: === Iteration 4 === [BouncingBallExampleErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:30:31,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:31,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1889553056, now seen corresponding path program 3 times [2019-08-05 10:30:31,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:31,546 WARN L254 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:30:31,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:31,584 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:31,587 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:31,588 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:31,771 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 7 [2019-08-05 10:30:31,787 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:31,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:31,792 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:31,797 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:31,804 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:31,806 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:31,810 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:31,984 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 7 [2019-08-05 10:30:32,030 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:32,082 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:32,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:32,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:30:32,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:30:32,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:30:32,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:30:32,084 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2019-08-05 10:30:32,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:32,203 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:30:32,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:30:32,207 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-08-05 10:30:32,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:32,208 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:30:32,208 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:30:32,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:30:32,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:30:32,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-08-05 10:30:32,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:30:32,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:30:32,212 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-08-05 10:30:32,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:32,212 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:30:32,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:30:32,212 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:30:32,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:30:32,213 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:32,213 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1] [2019-08-05 10:30:32,214 INFO L418 AbstractCegarLoop]: === Iteration 5 === [BouncingBallExampleErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:30:32,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:32,214 INFO L82 PathProgramCache]: Analyzing trace with hash -910677313, now seen corresponding path program 4 times [2019-08-05 10:30:32,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:32,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:32,268 WARN L254 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:30:32,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:32,301 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:32,304 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:32,355 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:32,515 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 25 [2019-08-05 10:30:32,547 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:32,548 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:32,549 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:32,693 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 8 [2019-08-05 10:30:32,696 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:32,918 WARN L188 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 12 [2019-08-05 10:30:32,920 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:32,921 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:32,923 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:32,992 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:33,044 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:33,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:33,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:30:33,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:30:33,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:30:33,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:30:33,046 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 7 states. [2019-08-05 10:30:33,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:33,087 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:30:33,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:30:33,088 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-08-05 10:30:33,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:33,089 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:30:33,089 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:30:33,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:30:33,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:30:33,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-08-05 10:30:33,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:30:33,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:30:33,094 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-08-05 10:30:33,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:33,094 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:30:33,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:30:33,094 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:30:33,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:30:33,095 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:33,095 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1] [2019-08-05 10:30:33,095 INFO L418 AbstractCegarLoop]: === Iteration 6 === [BouncingBallExampleErr0ASSERT_VIOLATIONINVARIANTandASSERT]=== [2019-08-05 10:30:33,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:33,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1012432670, now seen corresponding path program 5 times [2019-08-05 10:30:33,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:30:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:30:33,286 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 10:30:33,322 INFO L202 PluginConnector]: Adding new model bball.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:30:33 BoogieIcfgContainer [2019-08-05 10:30:33,322 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:30:33,324 INFO L168 Benchmark]: Toolchain (without parser) took 3695.32 ms. Allocated memory was 135.3 MB in the beginning and 198.2 MB in the end (delta: 62.9 MB). Free memory was 108.1 MB in the beginning and 173.9 MB in the end (delta: -65.8 MB). Peak memory consumption was 96.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:33,326 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 135.3 MB. Free memory was 109.4 MB in the beginning and 109.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-08-05 10:30:33,327 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.11 ms. Allocated memory is still 135.3 MB. Free memory was 108.1 MB in the beginning and 106.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:33,329 INFO L168 Benchmark]: Boogie Preprocessor took 24.66 ms. Allocated memory is still 135.3 MB. Free memory was 106.2 MB in the beginning and 105.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:33,330 INFO L168 Benchmark]: RCFGBuilder took 564.05 ms. Allocated memory is still 135.3 MB. Free memory was 104.9 MB in the beginning and 90.5 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:33,332 INFO L168 Benchmark]: TraceAbstraction took 3065.01 ms. Allocated memory was 135.3 MB in the beginning and 198.2 MB in the end (delta: 62.9 MB). Free memory was 90.0 MB in the beginning and 173.9 MB in the end (delta: -83.8 MB). Peak memory consumption was 78.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:33,336 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.20 ms. Allocated memory is still 135.3 MB. Free memory was 109.4 MB in the beginning and 109.2 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.11 ms. Allocated memory is still 135.3 MB. Free memory was 108.1 MB in the beginning and 106.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.66 ms. Allocated memory is still 135.3 MB. Free memory was 106.2 MB in the beginning and 105.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 564.05 ms. Allocated memory is still 135.3 MB. Free memory was 104.9 MB in the beginning and 90.5 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3065.01 ms. Allocated memory was 135.3 MB in the beginning and 198.2 MB in the end (delta: 62.9 MB). Free memory was 90.0 MB in the beginning and 173.9 MB in the end (delta: -83.8 MB). Peak memory consumption was 78.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 8]: loop invariant can be violated and assertion can be violated loop invariant can be violated and assertion can be violated We found a FailurePath: [L4] assume x >= 10.0 && x <= 10.2 && v == 0.0; VAL [v=0.0, x=10.0] [L8] invariant x >= 1.0; VAL [v=0.0, x=10.0] [L10] x_old := x; [L11] x_new := x - v; [L13] assume x_new >= 0.0; [L15] havoc x_tmp; [L17] COND FALSE !(x_new > x_old) [L21] assume x_tmp <= x_old && x_tmp >= x_new; [L23] x := x_tmp; [L25] v_old := v; [L26] v_new := v + 1.0; [L29] havoc v_tmp; [L31] COND TRUE v_new > v_old [L33] assume v_tmp >= v_old && v_tmp <= v_new; [L37] v := v_tmp; [L39] COND FALSE !(x == 0.0) VAL [v=1.0, v_new=1.0, v_old=0.0, v_tmp=1.0, x=10.0, x_new=10.0, x_old=10.0, x_tmp=10.0] [L8] invariant x >= 1.0; VAL [v=1.0, v_new=1.0, v_old=0.0, v_tmp=1.0, x=10.0, x_new=10.0, x_old=10.0, x_tmp=10.0] [L10] x_old := x; [L11] x_new := x - v; [L13] assume x_new >= 0.0; [L15] havoc x_tmp; [L17] COND FALSE !(x_new > x_old) [L21] assume x_tmp <= x_old && x_tmp >= x_new; [L23] x := x_tmp; [L25] v_old := v; [L26] v_new := v + 1.0; [L29] havoc v_tmp; [L31] COND TRUE v_new > v_old [L33] assume v_tmp >= v_old && v_tmp <= v_new; [L37] v := v_tmp; [L39] COND FALSE !(x == 0.0) VAL [v=2.0, v_new=2.0, v_old=1.0, v_tmp=2.0, x=37/4, x_new=9.0, x_old=10.0, x_tmp=37/4] [L8] invariant x >= 1.0; VAL [v=2.0, v_new=2.0, v_old=1.0, v_tmp=2.0, x=37/4, x_new=9.0, x_old=10.0, x_tmp=37/4] [L10] x_old := x; [L11] x_new := x - v; [L13] assume x_new >= 0.0; [L15] havoc x_tmp; [L17] COND FALSE !(x_new > x_old) [L21] assume x_tmp <= x_old && x_tmp >= x_new; [L23] x := x_tmp; [L25] v_old := v; [L26] v_new := v + 1.0; [L29] havoc v_tmp; [L31] COND TRUE v_new > v_old [L33] assume v_tmp >= v_old && v_tmp <= v_new; [L37] v := v_tmp; [L39] COND FALSE !(x == 0.0) VAL [v=3.0, v_new=3.0, v_old=2.0, v_tmp=3.0, x=15/2, x_new=29/4, x_old=37/4, x_tmp=15/2] [L8] invariant x >= 1.0; VAL [v=3.0, v_new=3.0, v_old=2.0, v_tmp=3.0, x=15/2, x_new=29/4, x_old=37/4, x_tmp=15/2] [L10] x_old := x; [L11] x_new := x - v; [L13] assume x_new >= 0.0; [L15] havoc x_tmp; [L17] COND FALSE !(x_new > x_old) [L21] assume x_tmp <= x_old && x_tmp >= x_new; [L23] x := x_tmp; [L25] v_old := v; [L26] v_new := v + 1.0; [L29] havoc v_tmp; [L31] COND TRUE v_new > v_old [L33] assume v_tmp >= v_old && v_tmp <= v_new; [L37] v := v_tmp; [L39] COND FALSE !(x == 0.0) VAL [v=15/4, v_new=4.0, v_old=3.0, v_tmp=15/4, x=9/2, x_new=9/2, x_old=15/2, x_tmp=9/2] [L8] invariant x >= 1.0; VAL [v=15/4, v_new=4.0, v_old=3.0, v_tmp=15/4, x=9/2, x_new=9/2, x_old=15/2, x_tmp=9/2] [L10] x_old := x; [L11] x_new := x - v; [L13] assume x_new >= 0.0; [L15] havoc x_tmp; [L17] COND FALSE !(x_new > x_old) [L21] assume x_tmp <= x_old && x_tmp >= x_new; [L23] x := x_tmp; [L25] v_old := v; [L26] v_new := v + 1.0; [L29] havoc v_tmp; [L31] COND TRUE v_new > v_old [L33] assume v_tmp >= v_old && v_tmp <= v_new; [L37] v := v_tmp; [L39] COND FALSE !(x == 0.0) VAL [v=19/4, v_new=19/4, v_old=15/4, v_tmp=19/4, x=3/4, x_new=3/4, x_old=9/2, x_tmp=3/4] [L8] invariant x >= 1.0; VAL [v=19/4, v_new=19/4, v_old=15/4, v_tmp=19/4, x=3/4, x_new=3/4, x_old=9/2, x_tmp=3/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. UNSAFE Result, 2.9s OverallTime, 6 OverallIterations, 5 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11 SDtfs, 16 SDslu, 1 SDs, 0 SdLazy, 48 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=5, 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, 5 MinimizatonAttempts, 5 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 1109 SizeOfPredicates, 48 NumberOfNonLiveVariables, 185 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/30 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...