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/EasyRecursive_incorrect.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:15:24,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:15:24,164 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:15:24,179 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:15:24,180 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:15:24,181 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:15:24,182 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:15:24,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:15:24,187 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:15:24,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:15:24,190 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:15:24,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:15:24,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:15:24,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:15:24,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:15:24,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:15:24,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:15:24,202 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:15:24,204 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:15:24,212 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:15:24,214 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:15:24,215 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:15:24,216 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:15:24,217 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:15:24,219 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:15:24,220 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:15:24,220 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:15:24,221 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:15:24,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:15:24,222 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:15:24,222 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:15:24,223 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:15:24,224 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:15:24,225 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:15:24,226 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:15:24,226 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:15:24,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:15:24,227 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:15:24,227 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:15:24,228 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:15:24,229 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:15:24,261 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:15:24,277 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:15:24,279 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:15:24,281 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:15:24,281 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:15:24,282 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/EasyRecursive_incorrect.bpl [2019-08-05 11:15:24,283 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/EasyRecursive_incorrect.bpl' [2019-08-05 11:15:24,314 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:15:24,316 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:15:24,317 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:15:24,317 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:15:24,317 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:15:24,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "EasyRecursive_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:24" (1/1) ... [2019-08-05 11:15:24,345 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "EasyRecursive_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:24" (1/1) ... [2019-08-05 11:15:24,351 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:15:24,352 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:15:24,352 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:15:24,354 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:15:24,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:15:24,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:15:24,355 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:15:24,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "EasyRecursive_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:24" (1/1) ... [2019-08-05 11:15:24,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "EasyRecursive_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:24" (1/1) ... [2019-08-05 11:15:24,369 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "EasyRecursive_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:24" (1/1) ... [2019-08-05 11:15:24,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "EasyRecursive_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:24" (1/1) ... [2019-08-05 11:15:24,372 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "EasyRecursive_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:24" (1/1) ... [2019-08-05 11:15:24,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "EasyRecursive_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:24" (1/1) ... [2019-08-05 11:15:24,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "EasyRecursive_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:24" (1/1) ... [2019-08-05 11:15:24,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:15:24,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:15:24,380 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:15:24,381 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:15:24,382 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "EasyRecursive_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:24" (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:24,456 INFO L124 BoogieDeclarations]: Specification and implementation of procedure add given in one single declaration [2019-08-05 11:15:24,456 INFO L130 BoogieDeclarations]: Found specification of procedure add [2019-08-05 11:15:24,456 INFO L138 BoogieDeclarations]: Found implementation of procedure add [2019-08-05 11:15:24,457 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:15:24,457 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:15:24,457 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:15:24,751 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:15:24,751 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:15:24,752 INFO L202 PluginConnector]: Adding new model EasyRecursive_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:15:24 BoogieIcfgContainer [2019-08-05 11:15:24,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:15:24,755 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:15:24,755 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:15:24,758 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:15:24,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "EasyRecursive_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:24" (1/2) ... [2019-08-05 11:15:24,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b906334 and model type EasyRecursive_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:15:24, skipping insertion in model container [2019-08-05 11:15:24,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "EasyRecursive_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:15:24" (2/2) ... [2019-08-05 11:15:24,761 INFO L109 eAbstractionObserver]: Analyzing ICFG EasyRecursive_incorrect.bpl [2019-08-05 11:15:24,771 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:15:24,778 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:15:24,794 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:15:24,818 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:15:24,819 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:15:24,819 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:15:24,819 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:15:24,819 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:15:24,820 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:15:24,820 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:15:24,820 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:15:24,820 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:15:24,834 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-08-05 11:15:24,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:15:24,850 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:24,851 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:15:24,853 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:24,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:24,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1946389013, now seen corresponding path program 1 times [2019-08-05 11:15:24,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:24,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:15:24,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:24,994 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:24,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:15:24,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:15:25,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:15:25,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:15:25,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:15:25,018 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-08-05 11:15:25,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:25,138 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2019-08-05 11:15:25,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:15:25,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-08-05 11:15:25,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:25,155 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:15:25,155 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:15:25,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:15:25,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:15:25,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:15:25,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:15:25,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-08-05 11:15:25,218 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 7 [2019-08-05 11:15:25,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:25,219 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-08-05 11:15:25,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:15:25,219 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-08-05 11:15:25,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:15:25,222 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:25,222 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:15:25,223 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:25,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:25,223 INFO L82 PathProgramCache]: Analyzing trace with hash 420527133, now seen corresponding path program 1 times [2019-08-05 11:15:25,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:25,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:15:25,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:25,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:15:25,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:25,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:15:25,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:15:25,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:15:25,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:15:25,392 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 4 states. [2019-08-05 11:15:25,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:25,666 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2019-08-05 11:15:25,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:15:25,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-08-05 11:15:25,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:25,668 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:15:25,668 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:15:25,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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:25,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:15:25,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:15:25,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:15:25,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-08-05 11:15:25,676 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 11 [2019-08-05 11:15:25,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:25,676 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-08-05 11:15:25,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:15:25,677 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2019-08-05 11:15:25,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:15:25,678 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:25,678 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 11:15:25,678 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:25,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:25,679 INFO L82 PathProgramCache]: Analyzing trace with hash -7967579, now seen corresponding path program 2 times [2019-08-05 11:15:25,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:25,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:15:25,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:25,801 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 11:15:25,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:25,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:15:25,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:15:25,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:15:25,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:15:25,803 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand 5 states. [2019-08-05 11:15:25,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:25,965 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2019-08-05 11:15:25,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:15:25,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-08-05 11:15:25,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:25,967 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:15:25,967 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:15:25,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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:25,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:15:25,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 11:15:25,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:15:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-08-05 11:15:25,974 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 15 [2019-08-05 11:15:25,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:25,975 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-08-05 11:15:25,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:15:25,975 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2019-08-05 11:15:25,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:15:25,976 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:25,977 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-08-05 11:15:25,977 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:25,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:25,977 INFO L82 PathProgramCache]: Analyzing trace with hash -186991699, now seen corresponding path program 3 times [2019-08-05 11:15:25,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:15:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:15:26,032 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 11:15:26,053 INFO L202 PluginConnector]: Adding new model EasyRecursive_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:15:26 BoogieIcfgContainer [2019-08-05 11:15:26,053 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:15:26,056 INFO L168 Benchmark]: Toolchain (without parser) took 1739.60 ms. Allocated memory was 132.6 MB in the beginning and 171.4 MB in the end (delta: 38.8 MB). Free memory was 110.1 MB in the beginning and 142.2 MB in the end (delta: -32.1 MB). Peak memory consumption was 6.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:26,058 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 132.6 MB. Free memory was 111.4 MB in the beginning and 111.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:15:26,060 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.42 ms. Allocated memory is still 132.6 MB. Free memory was 110.1 MB in the beginning and 108.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:26,061 INFO L168 Benchmark]: Boogie Preprocessor took 23.66 ms. Allocated memory is still 132.6 MB. Free memory was 108.3 MB in the beginning and 107.2 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:26,064 INFO L168 Benchmark]: RCFGBuilder took 373.37 ms. Allocated memory is still 132.6 MB. Free memory was 107.0 MB in the beginning and 97.2 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:26,066 INFO L168 Benchmark]: TraceAbstraction took 1298.52 ms. Allocated memory was 132.6 MB in the beginning and 171.4 MB in the end (delta: 38.8 MB). Free memory was 97.0 MB in the beginning and 142.2 MB in the end (delta: -45.2 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:15:26,074 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.25 ms. Allocated memory is still 132.6 MB. Free memory was 111.4 MB in the beginning and 111.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.42 ms. Allocated memory is still 132.6 MB. Free memory was 110.1 MB in the beginning and 108.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.66 ms. Allocated memory is still 132.6 MB. Free memory was 108.3 MB in the beginning and 107.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 373.37 ms. Allocated memory is still 132.6 MB. Free memory was 107.0 MB in the beginning and 97.2 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1298.52 ms. Allocated memory was 132.6 MB in the beginning and 171.4 MB in the end (delta: 38.8 MB). Free memory was 97.0 MB in the beginning and 142.2 MB in the end (delta: -45.2 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L13] z := 4; VAL [z=4] [L15] CALL call z := add(4, 3); VAL [a=4, b=3] [L22] COND TRUE b > 0 VAL [a=4, b=3] [L24] CALL call res := add(a + 1, b - 1); VAL [a=5, b=2] [L22] COND TRUE b > 0 VAL [a=5, b=2] [L24] CALL call res := add(a + 1, b - 1); VAL [a=6, b=1] [L22] COND TRUE b > 0 VAL [a=6, b=1] [L24] CALL call res := add(a + 1, b - 1); VAL [a=7, b=0] [L22] COND FALSE !(b > 0) VAL [a=7, b=0] [L26] COND FALSE !(b < 0) [L32] res := a; VAL [a=7, b=0, res=7] [L24] RET call res := add(a + 1, b - 1); VAL [a=6, b=1, res=7] [L24] RET call res := add(a + 1, b - 1); VAL [a=5, b=2, res=7] [L24] RET call res := add(a + 1, b - 1); VAL [a=4, b=3, res=7] [L15] RET call z := add(4, 3); VAL [z=7] [L17] assert z == 4; VAL [z=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 11 locations, 1 error locations. UNSAFE Result, 1.2s OverallTime, 4 OverallIterations, 4 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 30 SDtfs, 9 SDslu, 19 SDs, 0 SdLazy, 45 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=3, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 30 ConstructedInterpolants, 0 QuantifiedInterpolants, 664 SizeOfPredicates, 0 NumberOfNonLiveVariables, 84 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 5/13 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...