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/regression/non_con/recursive-easy-4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:13:57,081 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:13:57,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:13:57,096 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:13:57,096 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:13:57,097 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:13:57,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:13:57,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:13:57,102 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:13:57,103 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:13:57,104 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:13:57,104 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:13:57,104 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:13:57,105 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:13:57,106 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:13:57,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:13:57,108 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:13:57,109 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:13:57,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:13:57,113 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:13:57,114 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:13:57,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:13:57,116 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:13:57,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:13:57,120 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:13:57,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:13:57,121 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:13:57,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:13:57,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:13:57,124 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:13:57,124 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:13:57,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:13:57,129 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:13:57,130 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:13:57,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:13:57,131 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:13:57,133 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:13:57,133 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:13:57,133 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:13:57,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:13:57,136 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:13:57,184 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:13:57,200 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:13:57,206 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:13:57,208 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:13:57,208 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:13:57,210 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/non_con/recursive-easy-4.bpl [2019-08-05 11:13:57,210 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/non_con/recursive-easy-4.bpl' [2019-08-05 11:13:57,244 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:13:57,247 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:13:57,248 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:13:57,248 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:13:57,248 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:13:57,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "recursive-easy-4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:57" (1/1) ... [2019-08-05 11:13:57,277 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "recursive-easy-4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:57" (1/1) ... [2019-08-05 11:13:57,289 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:13:57,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:13:57,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:13:57,290 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:13:57,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "recursive-easy-4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:57" (1/1) ... [2019-08-05 11:13:57,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "recursive-easy-4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:57" (1/1) ... [2019-08-05 11:13:57,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "recursive-easy-4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:57" (1/1) ... [2019-08-05 11:13:57,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "recursive-easy-4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:57" (1/1) ... [2019-08-05 11:13:57,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "recursive-easy-4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:57" (1/1) ... [2019-08-05 11:13:57,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "recursive-easy-4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:57" (1/1) ... [2019-08-05 11:13:57,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "recursive-easy-4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:57" (1/1) ... [2019-08-05 11:13:57,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:13:57,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:13:57,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:13:57,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:13:57,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "recursive-easy-4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:57" (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:13:57,379 INFO L124 BoogieDeclarations]: Specification and implementation of procedure foo given in one single declaration [2019-08-05 11:13:57,379 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-08-05 11:13:57,379 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-08-05 11:13:57,379 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:13:57,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:13:57,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:13:57,584 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:13:57,585 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:13:57,586 INFO L202 PluginConnector]: Adding new model recursive-easy-4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:13:57 BoogieIcfgContainer [2019-08-05 11:13:57,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:13:57,588 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:13:57,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:13:57,591 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:13:57,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "recursive-easy-4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:57" (1/2) ... [2019-08-05 11:13:57,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715596c9 and model type recursive-easy-4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:13:57, skipping insertion in model container [2019-08-05 11:13:57,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "recursive-easy-4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:13:57" (2/2) ... [2019-08-05 11:13:57,594 INFO L109 eAbstractionObserver]: Analyzing ICFG recursive-easy-4.bpl [2019-08-05 11:13:57,604 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:13:57,613 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 11:13:57,632 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 11:13:57,658 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:13:57,659 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:13:57,659 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:13:57,660 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:13:57,660 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:13:57,660 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:13:57,660 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:13:57,660 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:13:57,661 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:13:57,675 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2019-08-05 11:13:57,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:13:57,687 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:57,688 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:13:57,692 INFO L418 AbstractCegarLoop]: === Iteration 1 === [fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:57,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:57,699 INFO L82 PathProgramCache]: Analyzing trace with hash 43623211, now seen corresponding path program 1 times [2019-08-05 11:13:57,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:57,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:13:57,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:57,833 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:13:57,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:13:57,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:13:57,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:13:57,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:13:57,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:13:57,857 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2019-08-05 11:13:57,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:57,972 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-08-05 11:13:57,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:13:57,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 11:13:57,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:57,988 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:13:57,988 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:13:57,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:13:58,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:13:58,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:13:58,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:13:58,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 11:13:58,057 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 5 [2019-08-05 11:13:58,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:58,061 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 11:13:58,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:13:58,062 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 11:13:58,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:13:58,063 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:58,063 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2019-08-05 11:13:58,063 INFO L418 AbstractCegarLoop]: === Iteration 2 === [fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:58,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:58,064 INFO L82 PathProgramCache]: Analyzing trace with hash -249805570, now seen corresponding path program 1 times [2019-08-05 11:13:58,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:58,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:13:58,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:58,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 11:13:58,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:13:58,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:13:58,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:13:58,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:13:58,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:13:58,410 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 5 states. [2019-08-05 11:13:58,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:58,500 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-08-05 11:13:58,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:13:58,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-08-05 11:13:58,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:58,503 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:13:58,504 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:13:58,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:13:58,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:13:58,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:13:58,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:13:58,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 11:13:58,509 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2019-08-05 11:13:58,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:58,510 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 11:13:58,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:13:58,510 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 11:13:58,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:13:58,511 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:58,511 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:13:58,511 INFO L418 AbstractCegarLoop]: === Iteration 3 === [fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:58,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:58,512 INFO L82 PathProgramCache]: Analyzing trace with hash 852630928, now seen corresponding path program 1 times [2019-08-05 11:13:58,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:58,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:13:58,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:58,561 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:13:58,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:58,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:13:58,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:13:58,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:13:58,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:13:58,563 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 4 states. [2019-08-05 11:13:58,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:58,600 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-08-05 11:13:58,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:13:58,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-08-05 11:13:58,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:58,603 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:13:58,603 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:13:58,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:13:58,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:13:58,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:13:58,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:13:58,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-08-05 11:13:58,609 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-08-05 11:13:58,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:58,609 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-08-05 11:13:58,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:13:58,610 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-08-05 11:13:58,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:13:58,611 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:58,611 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:13:58,611 INFO L418 AbstractCegarLoop]: === Iteration 4 === [fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:58,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:58,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1788890717, now seen corresponding path program 2 times [2019-08-05 11:13:58,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:58,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:13:58,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:58,732 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 11:13:58,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:58,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:13:58,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:13:58,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:13:58,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:13:58,734 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2019-08-05 11:13:58,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:58,888 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-08-05 11:13:58,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:13:58,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-08-05 11:13:58,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:58,891 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:13:58,891 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:13:58,892 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:13:58,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:13:58,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:13:58,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:13:58,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-08-05 11:13:58,901 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-08-05 11:13:58,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:58,901 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-08-05 11:13:58,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:13:58,902 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-08-05 11:13:58,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:13:58,902 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:58,903 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:58,903 INFO L418 AbstractCegarLoop]: === Iteration 5 === [fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:58,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:58,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1776354536, now seen corresponding path program 3 times [2019-08-05 11:13:58,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:58,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:13:58,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:59,137 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-08-05 11:13:59,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:59,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:13:59,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:13:59,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:13:59,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:13:59,141 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 6 states. [2019-08-05 11:13:59,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:59,261 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-08-05 11:13:59,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:13:59,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-08-05 11:13:59,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:59,263 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:13:59,263 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:13:59,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 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:13:59,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:13:59,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:13:59,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:13:59,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-08-05 11:13:59,269 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 20 [2019-08-05 11:13:59,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:59,270 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-08-05 11:13:59,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:13:59,270 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-08-05 11:13:59,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:13:59,271 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:59,271 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:59,272 INFO L418 AbstractCegarLoop]: === Iteration 6 === [fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:59,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:59,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1805895707, now seen corresponding path program 4 times [2019-08-05 11:13:59,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:59,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:13:59,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:59,401 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-08-05 11:13:59,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:59,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:13:59,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:13:59,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:13:59,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:13:59,404 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 7 states. [2019-08-05 11:13:59,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:59,527 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-08-05 11:13:59,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:13:59,528 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-08-05 11:13:59,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:59,530 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:13:59,530 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:13:59,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:13:59,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:13:59,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 11:13:59,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:13:59,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-08-05 11:13:59,537 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 25 [2019-08-05 11:13:59,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:59,538 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-08-05 11:13:59,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:13:59,538 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-08-05 11:13:59,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:13:59,539 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:59,540 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:13:59,540 INFO L418 AbstractCegarLoop]: === Iteration 7 === [fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:59,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:59,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1883893600, now seen corresponding path program 5 times [2019-08-05 11:13:59,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:59,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:13:59,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:59,742 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-08-05 11:13:59,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:59,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:13:59,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:13:59,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:13:59,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:13:59,744 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 8 states. [2019-08-05 11:13:59,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:59,817 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-08-05 11:13:59,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:13:59,819 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-08-05 11:13:59,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:59,820 INFO L225 Difference]: With dead ends: 26 [2019-08-05 11:13:59,820 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 11:13:59,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 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:13:59,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 11:13:59,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 11:13:59,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:13:59,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-08-05 11:13:59,827 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 30 [2019-08-05 11:13:59,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:59,827 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-08-05 11:13:59,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:13:59,828 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-08-05 11:13:59,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 11:13:59,829 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:59,829 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1] [2019-08-05 11:13:59,830 INFO L418 AbstractCegarLoop]: === Iteration 8 === [fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:59,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:59,830 INFO L82 PathProgramCache]: Analyzing trace with hash -147495277, now seen corresponding path program 6 times [2019-08-05 11:13:59,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:59,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:13:59,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:59,987 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-08-05 11:13:59,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:59,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:13:59,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:13:59,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:13:59,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:13:59,989 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 9 states. [2019-08-05 11:14:00,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:00,236 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-08-05 11:14:00,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:14:00,236 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-08-05 11:14:00,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:00,238 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:14:00,238 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:14:00,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:00,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:14:00,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 11:14:00,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:14:00,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-08-05 11:14:00,244 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 35 [2019-08-05 11:14:00,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:00,244 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-08-05 11:14:00,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:14:00,244 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-08-05 11:14:00,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:14:00,246 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:00,246 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1] [2019-08-05 11:14:00,246 INFO L418 AbstractCegarLoop]: === Iteration 9 === [fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:00,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:00,247 INFO L82 PathProgramCache]: Analyzing trace with hash -200810968, now seen corresponding path program 7 times [2019-08-05 11:14:00,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:00,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:14:00,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:00,532 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-08-05 11:14:00,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:00,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:14:00,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:14:00,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:14:00,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:14:00,538 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 10 states. [2019-08-05 11:14:00,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:00,604 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-08-05 11:14:00,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:14:00,605 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2019-08-05 11:14:00,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:00,606 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:14:00,606 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:14:00,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:14:00,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:14:00,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 11:14:00,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:14:00,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-08-05 11:14:00,613 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 40 [2019-08-05 11:14:00,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:00,614 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-08-05 11:14:00,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:14:00,614 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-08-05 11:14:00,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 11:14:00,616 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:00,616 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1] [2019-08-05 11:14:00,616 INFO L418 AbstractCegarLoop]: === Iteration 10 === [fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:00,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:00,617 INFO L82 PathProgramCache]: Analyzing trace with hash 2070154507, now seen corresponding path program 8 times [2019-08-05 11:14:00,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:00,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:14:00,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:00,793 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 11:14:00,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:00,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:14:00,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:14:00,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:14:00,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:14:00,795 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 11 states. [2019-08-05 11:14:00,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:00,930 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-08-05 11:14:00,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:14:00,931 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2019-08-05 11:14:00,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:00,932 INFO L225 Difference]: With dead ends: 35 [2019-08-05 11:14:00,932 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 11:14:00,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 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:14:00,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 11:14:00,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 11:14:00,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:14:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-08-05 11:14:00,938 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 45 [2019-08-05 11:14:00,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:00,939 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-08-05 11:14:00,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:14:00,939 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-08-05 11:14:00,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:14:00,940 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:00,941 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1] [2019-08-05 11:14:00,941 INFO L418 AbstractCegarLoop]: === Iteration 11 === [fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:00,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:00,941 INFO L82 PathProgramCache]: Analyzing trace with hash 168092592, now seen corresponding path program 9 times [2019-08-05 11:14:00,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:00,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:14:00,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:01,115 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-08-05 11:14:01,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:01,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:14:01,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:14:01,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:14:01,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:14:01,117 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 12 states. [2019-08-05 11:14:01,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:01,211 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-08-05 11:14:01,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:14:01,213 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-08-05 11:14:01,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:01,215 INFO L225 Difference]: With dead ends: 38 [2019-08-05 11:14:01,215 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 11:14:01,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:14:01,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 11:14:01,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 11:14:01,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 11:14:01,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-08-05 11:14:01,222 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 50 [2019-08-05 11:14:01,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:01,222 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-08-05 11:14:01,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:14:01,222 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-08-05 11:14:01,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 11:14:01,224 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:01,224 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1] [2019-08-05 11:14:01,224 INFO L418 AbstractCegarLoop]: === Iteration 12 === [fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:01,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:01,224 INFO L82 PathProgramCache]: Analyzing trace with hash -2063647869, now seen corresponding path program 10 times [2019-08-05 11:14:01,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:01,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:14:01,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:01,718 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-08-05 11:14:01,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:01,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:14:01,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:14:01,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:14:01,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:14:01,720 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 15 states. [2019-08-05 11:14:01,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:01,937 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-08-05 11:14:01,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:14:01,937 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-08-05 11:14:01,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:01,939 INFO L225 Difference]: With dead ends: 42 [2019-08-05 11:14:01,939 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 11:14:01,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:14:01,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 11:14:01,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 11:14:01,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:14:01,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-08-05 11:14:01,945 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 55 [2019-08-05 11:14:01,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:01,946 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-08-05 11:14:01,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:14:01,946 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-08-05 11:14:01,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 11:14:01,948 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:01,948 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 1, 1, 1, 1] [2019-08-05 11:14:01,948 INFO L418 AbstractCegarLoop]: === Iteration 13 === [fooErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:01,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:01,949 INFO L82 PathProgramCache]: Analyzing trace with hash 320708920, now seen corresponding path program 11 times [2019-08-05 11:14:01,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:01,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:14:01,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:02,366 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-08-05 11:14:02,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:14:02,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-08-05 11:14:02,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:14:02,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:14:02,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:14:02,368 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 13 states. [2019-08-05 11:14:02,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:02,828 INFO L93 Difference]: Finished difference Result 57 states and 121 transitions. [2019-08-05 11:14:02,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:14:02,829 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-08-05 11:14:02,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:02,830 INFO L225 Difference]: With dead ends: 57 [2019-08-05 11:14:02,830 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:14:02,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:14:02,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:14:02,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:14:02,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:14:02,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:14:02,832 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2019-08-05 11:14:02,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:02,832 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:14:02,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:14:02,832 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:14:02,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:14:02,837 INFO L202 PluginConnector]: Adding new model recursive-easy-4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:14:02 BoogieIcfgContainer [2019-08-05 11:14:02,837 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:14:02,840 INFO L168 Benchmark]: Toolchain (without parser) took 5593.23 ms. Allocated memory was 133.2 MB in the beginning and 236.5 MB in the end (delta: 103.3 MB). Free memory was 110.8 MB in the beginning and 204.5 MB in the end (delta: -93.7 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:02,841 INFO L168 Benchmark]: Boogie PL CUP Parser took 1.07 ms. Allocated memory is still 133.2 MB. Free memory was 112.0 MB in the beginning and 111.8 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:14:02,842 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.20 ms. Allocated memory is still 133.2 MB. Free memory was 110.8 MB in the beginning and 109.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:02,843 INFO L168 Benchmark]: Boogie Preprocessor took 22.72 ms. Allocated memory is still 133.2 MB. Free memory was 109.1 MB in the beginning and 108.0 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:02,844 INFO L168 Benchmark]: RCFGBuilder took 273.94 ms. Allocated memory is still 133.2 MB. Free memory was 107.8 MB in the beginning and 98.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:02,845 INFO L168 Benchmark]: TraceAbstraction took 5249.67 ms. Allocated memory was 133.2 MB in the beginning and 236.5 MB in the end (delta: 103.3 MB). Free memory was 98.1 MB in the beginning and 204.5 MB in the end (delta: -106.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:14:02,849 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 1.07 ms. Allocated memory is still 133.2 MB. Free memory was 112.0 MB in the beginning and 111.8 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 41.20 ms. Allocated memory is still 133.2 MB. Free memory was 110.8 MB in the beginning and 109.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.72 ms. Allocated memory is still 133.2 MB. Free memory was 109.1 MB in the beginning and 108.0 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 273.94 ms. Allocated memory is still 133.2 MB. Free memory was 107.8 MB in the beginning and 98.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5249.67 ms. Allocated memory was 133.2 MB in the beginning and 236.5 MB in the end (delta: 103.3 MB). Free memory was 98.1 MB in the beginning and 204.5 MB in the end (delta: -106.4 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 7]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 2 error locations. SAFE Result, 5.1s OverallTime, 13 OverallIterations, 12 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 103 SDtfs, 26 SDslu, 152 SDs, 0 SdLazy, 496 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 388 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=12, 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.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 399 NumberOfCodeBlocks, 399 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 386 ConstructedInterpolants, 0 QuantifiedInterpolants, 44816 SizeOfPredicates, 1 NumberOfNonLiveVariables, 773 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 697/1302 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...