java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/reals/growfall.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:30:21,871 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:30:21,873 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:30:21,885 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:30:21,886 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:30:21,887 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:30:21,888 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:30:21,890 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:30:21,892 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:30:21,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:30:21,893 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:30:21,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:30:21,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:30:21,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:30:21,896 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:30:21,897 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:30:21,898 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:30:21,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:30:21,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:30:21,903 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:30:21,905 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:30:21,907 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:30:21,908 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:30:21,909 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:30:21,911 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:30:21,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:30:21,912 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:30:21,913 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:30:21,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:30:21,914 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:30:21,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:30:21,915 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:30:21,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:30:21,917 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:30:21,918 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:30:21,918 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:30:21,919 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:30:21,919 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:30:21,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:30:21,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:30:21,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:30:21,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:30:21,975 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:30:21,979 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:30:21,981 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:30:21,982 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:30:21,983 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/reals/growfall.bpl [2019-08-05 10:30:21,983 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/reals/growfall.bpl' [2019-08-05 10:30:22,017 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:30:22,019 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:30:22,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:30:22,020 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:30:22,020 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:30:22,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "growfall.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:22" (1/1) ... [2019-08-05 10:30:22,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "growfall.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:22" (1/1) ... [2019-08-05 10:30:22,052 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:30:22,052 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:30:22,052 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:30:22,055 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:30:22,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:30:22,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:30:22,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:30:22,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "growfall.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:22" (1/1) ... [2019-08-05 10:30:22,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "growfall.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:22" (1/1) ... [2019-08-05 10:30:22,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "growfall.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:22" (1/1) ... [2019-08-05 10:30:22,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "growfall.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:22" (1/1) ... [2019-08-05 10:30:22,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "growfall.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:22" (1/1) ... [2019-08-05 10:30:22,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "growfall.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:22" (1/1) ... [2019-08-05 10:30:22,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "growfall.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:22" (1/1) ... [2019-08-05 10:30:22,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:30:22,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:30:22,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:30:22,076 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:30:22,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "growfall.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:30:22,140 INFO L124 BoogieDeclarations]: Specification and implementation of procedure growfallExample given in one single declaration [2019-08-05 10:30:22,141 INFO L130 BoogieDeclarations]: Found specification of procedure growfallExample [2019-08-05 10:30:22,141 INFO L138 BoogieDeclarations]: Found implementation of procedure growfallExample [2019-08-05 10:30:22,482 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:30:22,483 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:30:22,484 INFO L202 PluginConnector]: Adding new model growfall.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:30:22 BoogieIcfgContainer [2019-08-05 10:30:22,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:30:22,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:30:22,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:30:22,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:30:22,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "growfall.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:22" (1/2) ... [2019-08-05 10:30:22,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d52f63a and model type growfall.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:30:22, skipping insertion in model container [2019-08-05 10:30:22,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "growfall.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:30:22" (2/2) ... [2019-08-05 10:30:22,492 INFO L109 eAbstractionObserver]: Analyzing ICFG growfall.bpl [2019-08-05 10:30:22,504 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:30:22,512 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:30:22,528 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:30:22,555 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:30:22,556 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:30:22,556 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:30:22,556 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:30:22,556 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:30:22,556 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:30:22,557 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:30:22,557 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:30:22,557 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:30:22,569 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-05 10:30:22,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:30:22,577 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:22,578 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:30:22,581 INFO L418 AbstractCegarLoop]: === Iteration 1 === [growfallExampleErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:22,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:22,589 INFO L82 PathProgramCache]: Analyzing trace with hash 925773, now seen corresponding path program 1 times [2019-08-05 10:30:22,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:22,683 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:30:22,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:22,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:22,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:30:22,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:30:22,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:30:22,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:30:22,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:30:22,909 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 4 states. [2019-08-05 10:30:23,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:23,029 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2019-08-05 10:30:23,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:30:23,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:30:23,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:23,041 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:30:23,042 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:30:23,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:30:23,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:30:23,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-08-05 10:30:23,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:30:23,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2019-08-05 10:30:23,076 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 4 [2019-08-05 10:30:23,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:23,076 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-08-05 10:30:23,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:30:23,076 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 13 transitions. [2019-08-05 10:30:23,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:30:23,077 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:23,077 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 10:30:23,078 INFO L418 AbstractCegarLoop]: === Iteration 2 === [growfallExampleErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:23,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:23,078 INFO L82 PathProgramCache]: Analyzing trace with hash 889501930, now seen corresponding path program 1 times [2019-08-05 10:30:23,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:23,104 WARN L254 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:30:23,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:23,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:23,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:30:23,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:30:23,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:30:23,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:30:23,263 INFO L87 Difference]: Start difference. First operand 9 states and 13 transitions. Second operand 5 states. [2019-08-05 10:30:23,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:23,408 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2019-08-05 10:30:23,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:30:23,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 10:30:23,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:23,409 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:30:23,409 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:30:23,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:30:23,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:30:23,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 9. [2019-08-05 10:30:23,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:30:23,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2019-08-05 10:30:23,413 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 6 [2019-08-05 10:30:23,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:23,414 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-08-05 10:30:23,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:30:23,414 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 13 transitions. [2019-08-05 10:30:23,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:30:23,415 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:23,415 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:30:23,415 INFO L418 AbstractCegarLoop]: === Iteration 3 === [growfallExampleErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:23,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:23,416 INFO L82 PathProgramCache]: Analyzing trace with hash 889600231, now seen corresponding path program 1 times [2019-08-05 10:30:23,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:23,451 WARN L254 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:30:23,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:23,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:23,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:30:23,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 10:30:23,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:30:23,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:30:23,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:30:23,764 INFO L87 Difference]: Start difference. First operand 9 states and 13 transitions. Second operand 6 states. [2019-08-05 10:30:23,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:23,935 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2019-08-05 10:30:23,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:30:23,936 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:30:23,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:23,937 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:30:23,937 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:30:23,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:30:23,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:30:23,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2019-08-05 10:30:23,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:30:23,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2019-08-05 10:30:23,941 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 6 [2019-08-05 10:30:23,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:23,942 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-08-05 10:30:23,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:30:23,942 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 19 transitions. [2019-08-05 10:30:23,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:30:23,943 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:23,943 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:23,943 INFO L418 AbstractCegarLoop]: === Iteration 4 === [growfallExampleErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:23,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:23,944 INFO L82 PathProgramCache]: Analyzing trace with hash 112795204, now seen corresponding path program 1 times [2019-08-05 10:30:23,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:23,976 WARN L254 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:30:23,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:24,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:24,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:24,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:30:24,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:30:24,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:30:24,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:30:24,374 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. Second operand 7 states. [2019-08-05 10:30:24,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:24,520 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2019-08-05 10:30:24,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:30:24,528 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-08-05 10:30:24,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:24,529 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:30:24,530 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:30:24,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:30:24,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:30:24,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 11. [2019-08-05 10:30:24,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:30:24,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-08-05 10:30:24,535 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 16 transitions. Word has length 8 [2019-08-05 10:30:24,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:24,535 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-08-05 10:30:24,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:30:24,535 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 16 transitions. [2019-08-05 10:30:24,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:30:24,536 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:24,536 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:24,537 INFO L418 AbstractCegarLoop]: === Iteration 5 === [growfallExampleErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:24,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:24,537 INFO L82 PathProgramCache]: Analyzing trace with hash 207253537, now seen corresponding path program 1 times [2019-08-05 10:30:24,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:24,583 WARN L254 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:30:24,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:25,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:25,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:25,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:30:25,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:30:25,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:30:25,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:30:25,020 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand 8 states. [2019-08-05 10:30:25,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:25,149 INFO L93 Difference]: Finished difference Result 24 states and 33 transitions. [2019-08-05 10:30:25,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:30:25,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:30:25,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:25,152 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:30:25,152 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:30:25,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:30:25,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:30:25,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2019-08-05 10:30:25,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:30:25,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2019-08-05 10:30:25,156 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 25 transitions. Word has length 8 [2019-08-05 10:30:25,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:25,157 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-08-05 10:30:25,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:30:25,157 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 25 transitions. [2019-08-05 10:30:25,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:30:25,158 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:25,158 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:25,158 INFO L418 AbstractCegarLoop]: === Iteration 6 === [growfallExampleErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:25,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:25,159 INFO L82 PathProgramCache]: Analyzing trace with hash 207173092, now seen corresponding path program 1 times [2019-08-05 10:30:25,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:25,178 WARN L254 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:30:25,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:25,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:25,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:25,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:30:25,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:30:25,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:30:25,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:30:25,350 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. Second operand 7 states. [2019-08-05 10:30:25,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:25,454 INFO L93 Difference]: Finished difference Result 25 states and 35 transitions. [2019-08-05 10:30:25,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:30:25,456 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-08-05 10:30:25,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:25,458 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:30:25,459 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:30:25,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:30:25,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:30:25,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-08-05 10:30:25,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:30:25,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2019-08-05 10:30:25,464 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 8 [2019-08-05 10:30:25,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:25,465 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2019-08-05 10:30:25,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:30:25,465 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2019-08-05 10:30:25,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:30:25,466 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:25,466 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:25,466 INFO L418 AbstractCegarLoop]: === Iteration 7 === [growfallExampleErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:25,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:25,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1021932094, now seen corresponding path program 1 times [2019-08-05 10:30:25,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:25,492 WARN L254 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:30:25,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:25,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:25,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:30:25,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:30:25,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:30:25,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:30:25,663 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 9 states. [2019-08-05 10:30:25,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:25,805 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. [2019-08-05 10:30:25,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:30:25,805 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-08-05 10:30:25,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:25,807 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:30:25,807 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:30:25,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:30:25,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:30:25,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2019-08-05 10:30:25,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:30:25,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2019-08-05 10:30:25,812 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 25 transitions. Word has length 10 [2019-08-05 10:30:25,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:25,812 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-08-05 10:30:25,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:30:25,812 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 25 transitions. [2019-08-05 10:30:25,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:30:25,813 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:25,813 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:25,813 INFO L418 AbstractCegarLoop]: === Iteration 8 === [growfallExampleErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:25,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:25,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1021851649, now seen corresponding path program 1 times [2019-08-05 10:30:25,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:25,834 WARN L254 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:30:25,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:26,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:26,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:26,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:30:26,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:30:26,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:30:26,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:30:26,011 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. Second operand 8 states. [2019-08-05 10:30:26,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:26,174 INFO L93 Difference]: Finished difference Result 26 states and 37 transitions. [2019-08-05 10:30:26,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:30:26,174 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-08-05 10:30:26,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:26,175 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:30:26,175 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:30:26,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:30:26,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:30:26,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2019-08-05 10:30:26,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:30:26,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2019-08-05 10:30:26,181 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 25 transitions. Word has length 10 [2019-08-05 10:30:26,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:26,181 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 25 transitions. [2019-08-05 10:30:26,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:30:26,181 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 25 transitions. [2019-08-05 10:30:26,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:30:26,182 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:26,182 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:26,182 INFO L418 AbstractCegarLoop]: === Iteration 9 === [growfallExampleErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:26,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:26,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1524769246, now seen corresponding path program 1 times [2019-08-05 10:30:26,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:26,201 WARN L254 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:30:26,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:26,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:26,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:26,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:30:26,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:30:26,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:30:26,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:30:26,405 INFO L87 Difference]: Start difference. First operand 17 states and 25 transitions. Second operand 9 states. [2019-08-05 10:30:26,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:26,503 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2019-08-05 10:30:26,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:30:26,504 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-08-05 10:30:26,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:26,505 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:30:26,505 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:30:26,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:30:26,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:30:26,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2019-08-05 10:30:26,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:30:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2019-08-05 10:30:26,510 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 40 transitions. Word has length 10 [2019-08-05 10:30:26,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:26,511 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 40 transitions. [2019-08-05 10:30:26,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:30:26,511 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 40 transitions. [2019-08-05 10:30:26,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:30:26,511 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:26,512 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:30:26,512 INFO L418 AbstractCegarLoop]: === Iteration 10 === [growfallExampleErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:26,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:26,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1548152645, now seen corresponding path program 1 times [2019-08-05 10:30:26,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:26,533 WARN L254 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:30:26,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:26,938 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:30:26,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:30:26,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:30:26,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:30:26,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:30:26,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:30:26,940 INFO L87 Difference]: Start difference. First operand 27 states and 40 transitions. Second operand 10 states. [2019-08-05 10:30:27,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:27,021 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2019-08-05 10:30:27,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:30:27,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-08-05 10:30:27,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:27,022 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:30:27,022 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:30:27,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:30:27,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:30:27,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:30:27,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:30:27,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:30:27,024 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2019-08-05 10:30:27,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:27,024 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:30:27,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:30:27,024 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:30:27,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:30:27,029 INFO L202 PluginConnector]: Adding new model growfall.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:30:27 BoogieIcfgContainer [2019-08-05 10:30:27,029 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:30:27,031 INFO L168 Benchmark]: Toolchain (without parser) took 5011.18 ms. Allocated memory was 141.0 MB in the beginning and 203.9 MB in the end (delta: 62.9 MB). Free memory was 110.5 MB in the beginning and 93.2 MB in the end (delta: 17.3 MB). Peak memory consumption was 80.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:27,033 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 141.0 MB. Free memory was 111.8 MB in the beginning and 111.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:30:27,034 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.17 ms. Allocated memory is still 141.0 MB. Free memory was 110.5 MB in the beginning and 108.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:27,035 INFO L168 Benchmark]: Boogie Preprocessor took 20.15 ms. Allocated memory is still 141.0 MB. Free memory was 108.7 MB in the beginning and 107.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:27,037 INFO L168 Benchmark]: RCFGBuilder took 408.32 ms. Allocated memory is still 141.0 MB. Free memory was 107.4 MB in the beginning and 97.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:27,040 INFO L168 Benchmark]: TraceAbstraction took 4543.17 ms. Allocated memory was 141.0 MB in the beginning and 203.9 MB in the end (delta: 62.9 MB). Free memory was 97.0 MB in the beginning and 93.2 MB in the end (delta: 3.8 MB). Peak memory consumption was 66.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:27,046 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.22 ms. Allocated memory is still 141.0 MB. Free memory was 111.8 MB in the beginning and 111.6 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 35.17 ms. Allocated memory is still 141.0 MB. Free memory was 110.5 MB in the beginning and 108.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.15 ms. Allocated memory is still 141.0 MB. Free memory was 108.7 MB in the beginning and 107.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 408.32 ms. Allocated memory is still 141.0 MB. Free memory was 107.4 MB in the beginning and 97.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4543.17 ms. Allocated memory was 141.0 MB in the beginning and 203.9 MB in the end (delta: 62.9 MB). Free memory was 97.0 MB in the beginning and 93.2 MB in the end (delta: 3.8 MB). Peak memory consumption was 66.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 59]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. SAFE Result, 4.4s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 66 SDtfs, 53 SDslu, 185 SDs, 0 SdLazy, 235 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 49 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 5502 SizeOfPredicates, 124 NumberOfNonLiveVariables, 528 ConjunctsInSsa, 373 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 0/30 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...