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/all/recursive-easy-3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:13:26,920 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:13:26,922 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:13:26,934 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:13:26,934 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:13:26,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:13:26,937 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:13:26,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:13:26,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:13:26,942 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:13:26,943 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:13:26,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:13:26,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:13:26,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:13:26,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:13:26,947 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:13:26,948 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:13:26,949 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:13:26,951 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:13:26,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:13:26,955 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:13:26,956 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:13:26,957 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:13:26,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:13:26,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:13:26,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:13:26,961 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:13:26,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:13:26,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:13:26,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:13:26,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:13:26,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:13:26,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:13:26,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:13:26,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:13:26,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:13:26,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:13:26,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:13:26,969 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:13:26,970 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:13:26,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:13:27,001 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:13:27,019 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:13:27,023 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:13:27,025 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:13:27,026 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:13:27,027 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/all/recursive-easy-3.bpl [2019-08-05 11:13:27,027 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/all/recursive-easy-3.bpl' [2019-08-05 11:13:27,064 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:13:27,066 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:13:27,067 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:13:27,067 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:13:27,067 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:13:27,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "recursive-easy-3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:27" (1/1) ... [2019-08-05 11:13:27,096 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "recursive-easy-3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:27" (1/1) ... [2019-08-05 11:13:27,107 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:13:27,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:13:27,108 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:13:27,108 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:13:27,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "recursive-easy-3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:27" (1/1) ... [2019-08-05 11:13:27,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "recursive-easy-3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:27" (1/1) ... [2019-08-05 11:13:27,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "recursive-easy-3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:27" (1/1) ... [2019-08-05 11:13:27,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "recursive-easy-3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:27" (1/1) ... [2019-08-05 11:13:27,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "recursive-easy-3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:27" (1/1) ... [2019-08-05 11:13:27,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "recursive-easy-3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:27" (1/1) ... [2019-08-05 11:13:27,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "recursive-easy-3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:27" (1/1) ... [2019-08-05 11:13:27,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:13:27,132 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:13:27,132 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:13:27,132 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:13:27,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "recursive-easy-3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:27" (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:27,207 INFO L124 BoogieDeclarations]: Specification and implementation of procedure subToZero given in one single declaration [2019-08-05 11:13:27,208 INFO L130 BoogieDeclarations]: Found specification of procedure subToZero [2019-08-05 11:13:27,208 INFO L138 BoogieDeclarations]: Found implementation of procedure subToZero [2019-08-05 11:13:27,208 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:13:27,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:13:27,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:13:27,400 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:13:27,400 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:13:27,403 INFO L202 PluginConnector]: Adding new model recursive-easy-3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:13:27 BoogieIcfgContainer [2019-08-05 11:13:27,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:13:27,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:13:27,405 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:13:27,410 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:13:27,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "recursive-easy-3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:27" (1/2) ... [2019-08-05 11:13:27,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f7fd79 and model type recursive-easy-3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:13:27, skipping insertion in model container [2019-08-05 11:13:27,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "recursive-easy-3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:13:27" (2/2) ... [2019-08-05 11:13:27,416 INFO L109 eAbstractionObserver]: Analyzing ICFG recursive-easy-3.bpl [2019-08-05 11:13:27,426 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:13:27,437 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:13:27,456 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:13:27,488 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:13:27,489 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:13:27,489 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:13:27,490 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:13:27,490 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:13:27,490 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:13:27,490 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:13:27,490 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:13:27,491 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:13:27,506 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-08-05 11:13:27,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:13:27,516 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:27,517 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:13:27,519 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:27,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:27,524 INFO L82 PathProgramCache]: Analyzing trace with hash 46247798, now seen corresponding path program 1 times [2019-08-05 11:13:27,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:27,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:13:27,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:27,666 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:27,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:13:27,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:13:27,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:13:27,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:13:27,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:13:27,692 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-08-05 11:13:27,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:27,787 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-08-05 11:13:27,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:13:27,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-08-05 11:13:27,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:27,806 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:13:27,806 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:13:27,809 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:27,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:13:27,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:13:27,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:13:27,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-08-05 11:13:27,870 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2019-08-05 11:13:27,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:27,871 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-08-05 11:13:27,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:13:27,871 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-08-05 11:13:27,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:13:27,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:27,873 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:13:27,874 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:27,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:27,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1435372337, now seen corresponding path program 1 times [2019-08-05 11:13:27,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:27,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:13:27,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:27,926 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:27,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:13:27,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:13:27,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:13:27,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:13:27,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:13:27,929 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 3 states. [2019-08-05 11:13:27,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:27,965 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-08-05 11:13:27,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:13:27,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-08-05 11:13:27,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:27,968 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:13:27,969 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:13:27,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:27,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:13:27,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 11:13:27,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:13:27,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-08-05 11:13:27,976 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2019-08-05 11:13:27,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:27,976 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-08-05 11:13:27,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:13:27,977 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2019-08-05 11:13:27,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:13:27,977 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:27,978 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:13:27,978 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:27,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:27,978 INFO L82 PathProgramCache]: Analyzing trace with hash -496442973, now seen corresponding path program 1 times [2019-08-05 11:13:27,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:27,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:13:27,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:28,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 11:13:28,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:28,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:13:28,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:13:28,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:13:28,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:13:28,055 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 4 states. [2019-08-05 11:13:28,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:28,133 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-08-05 11:13:28,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:13:28,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-08-05 11:13:28,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:28,136 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:13:28,136 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:13:28,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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:28,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:13:28,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:13:28,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:13:28,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-08-05 11:13:28,141 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 11 [2019-08-05 11:13:28,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:28,142 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-08-05 11:13:28,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:13:28,142 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-08-05 11:13:28,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:13:28,143 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:28,143 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1] [2019-08-05 11:13:28,143 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:28,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:28,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1819716187, now seen corresponding path program 2 times [2019-08-05 11:13:28,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:28,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:13:28,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:28,260 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-08-05 11:13:28,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:28,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:13:28,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:13:28,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:13:28,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:13:28,268 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 5 states. [2019-08-05 11:13:28,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:28,306 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2019-08-05 11:13:28,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:13:28,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-08-05 11:13:28,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:28,308 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:13:28,309 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:13:28,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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:28,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:13:28,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:13:28,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:13:28,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-08-05 11:13:28,328 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 16 [2019-08-05 11:13:28,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:28,329 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-08-05 11:13:28,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:13:28,330 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-08-05 11:13:28,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:13:28,331 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:28,331 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1] [2019-08-05 11:13:28,331 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:28,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:28,332 INFO L82 PathProgramCache]: Analyzing trace with hash -819975913, now seen corresponding path program 3 times [2019-08-05 11:13:28,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:28,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:13:28,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:28,486 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-08-05 11:13:28,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:28,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:13:28,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:13:28,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:13:28,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:13:28,488 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 6 states. [2019-08-05 11:13:28,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:28,581 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-08-05 11:13:28,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:13:28,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-08-05 11:13:28,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:28,583 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:13:28,584 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:13:28,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 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:28,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:13:28,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:13:28,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:13:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-08-05 11:13:28,589 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 21 [2019-08-05 11:13:28,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:28,589 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-08-05 11:13:28,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:13:28,589 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-08-05 11:13:28,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:13:28,590 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:28,591 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1] [2019-08-05 11:13:28,591 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:28,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:28,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1083573785, now seen corresponding path program 4 times [2019-08-05 11:13:28,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:28,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:13:28,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:28,878 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-08-05 11:13:28,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:28,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:13:28,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:13:28,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:13:28,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:13:28,880 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 7 states. [2019-08-05 11:13:28,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:28,926 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-08-05 11:13:28,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:13:28,926 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-08-05 11:13:28,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:28,927 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:13:28,928 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:13:28,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:13:28,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:13:28,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 11:13:28,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:13:28,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-08-05 11:13:28,933 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 26 [2019-08-05 11:13:28,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:28,934 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-08-05 11:13:28,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:13:28,934 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-08-05 11:13:28,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:13:28,935 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:28,936 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1] [2019-08-05 11:13:28,936 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:28,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:28,936 INFO L82 PathProgramCache]: Analyzing trace with hash -197994869, now seen corresponding path program 5 times [2019-08-05 11:13:28,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:28,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:13:28,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:29,102 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-08-05 11:13:29,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:29,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:13:29,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:13:29,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:13:29,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:13:29,106 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 8 states. [2019-08-05 11:13:29,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:29,230 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-08-05 11:13:29,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:13:29,234 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-08-05 11:13:29,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:29,236 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:13:29,237 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:13:29,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 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:29,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:13:29,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:13:29,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:13:29,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-08-05 11:13:29,242 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 31 [2019-08-05 11:13:29,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:29,243 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-08-05 11:13:29,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:13:29,243 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-08-05 11:13:29,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:13:29,244 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:29,244 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1] [2019-08-05 11:13:29,245 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:29,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:29,245 INFO L82 PathProgramCache]: Analyzing trace with hash -270459763, now seen corresponding path program 6 times [2019-08-05 11:13:29,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:29,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:13:29,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:29,434 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-08-05 11:13:29,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:29,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:13:29,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:13:29,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:13:29,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:13:29,436 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 9 states. [2019-08-05 11:13:29,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:29,481 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-08-05 11:13:29,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:13:29,484 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-08-05 11:13:29,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:29,485 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:13:29,485 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:13:29,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 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:13:29,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:13:29,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 11:13:29,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:13:29,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-08-05 11:13:29,490 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 36 [2019-08-05 11:13:29,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:29,491 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-08-05 11:13:29,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:13:29,491 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-08-05 11:13:29,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 11:13:29,492 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:29,493 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1] [2019-08-05 11:13:29,493 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:29,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:29,493 INFO L82 PathProgramCache]: Analyzing trace with hash -718411265, now seen corresponding path program 7 times [2019-08-05 11:13:29,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:29,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:13:29,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:29,764 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-08-05 11:13:29,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:29,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:13:29,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:13:29,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:13:29,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:13:29,766 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 10 states. [2019-08-05 11:13:29,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:29,996 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-08-05 11:13:29,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:13:29,997 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2019-08-05 11:13:29,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:29,998 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:13:29,998 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:13:29,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 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:13:29,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:13:30,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 11:13:30,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:13:30,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-08-05 11:13:30,003 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 41 [2019-08-05 11:13:30,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:30,004 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-08-05 11:13:30,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:13:30,004 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-08-05 11:13:30,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:13:30,006 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:30,006 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 1, 1, 1, 1] [2019-08-05 11:13:30,006 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:30,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:30,006 INFO L82 PathProgramCache]: Analyzing trace with hash 840407297, now seen corresponding path program 8 times [2019-08-05 11:13:30,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:30,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:13:30,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:30,191 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-08-05 11:13:30,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:30,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:13:30,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:13:30,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:13:30,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:13:30,194 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 11 states. [2019-08-05 11:13:30,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:30,270 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-08-05 11:13:30,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:13:30,270 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 46 [2019-08-05 11:13:30,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:30,272 INFO L225 Difference]: With dead ends: 26 [2019-08-05 11:13:30,272 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 11:13:30,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 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:13:30,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 11:13:30,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 11:13:30,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:13:30,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-08-05 11:13:30,277 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 46 [2019-08-05 11:13:30,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:30,278 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-08-05 11:13:30,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:13:30,278 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-08-05 11:13:30,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 11:13:30,280 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:30,280 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 1, 1, 1, 1] [2019-08-05 11:13:30,280 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:30,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:30,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1960942733, now seen corresponding path program 9 times [2019-08-05 11:13:30,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:30,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:13:30,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:30,559 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-08-05 11:13:30,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:30,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:13:30,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:13:30,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:13:30,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:13:30,561 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 12 states. [2019-08-05 11:13:30,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:30,614 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-08-05 11:13:30,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:13:30,615 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-08-05 11:13:30,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:30,616 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:13:30,616 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:13:30,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:13:30,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:13:30,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 11:13:30,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:13:30,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-08-05 11:13:30,621 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 51 [2019-08-05 11:13:30,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:30,622 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-08-05 11:13:30,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:13:30,622 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-08-05 11:13:30,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 11:13:30,623 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:30,623 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1] [2019-08-05 11:13:30,624 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:30,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:30,624 INFO L82 PathProgramCache]: Analyzing trace with hash -714704011, now seen corresponding path program 10 times [2019-08-05 11:13:30,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:30,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:13:30,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:30,866 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-08-05 11:13:30,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:30,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:13:30,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:13:30,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:13:30,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:13:30,868 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 13 states. [2019-08-05 11:13:30,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:30,936 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-08-05 11:13:30,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:13:30,937 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-08-05 11:13:30,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:30,938 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:13:30,938 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:13:30,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:13:30,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:13:30,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 11:13:30,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:13:30,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-08-05 11:13:30,943 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 56 [2019-08-05 11:13:30,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:30,944 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-08-05 11:13:30,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:13:30,944 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-08-05 11:13:30,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 11:13:30,945 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:30,945 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 1, 1, 1, 1] [2019-08-05 11:13:30,945 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:30,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:30,946 INFO L82 PathProgramCache]: Analyzing trace with hash 76628711, now seen corresponding path program 11 times [2019-08-05 11:13:30,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:30,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:13:30,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:31,176 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-08-05 11:13:31,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:31,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:13:31,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:13:31,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:13:31,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:13:31,178 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 14 states. [2019-08-05 11:13:31,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:31,233 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-08-05 11:13:31,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:13:31,233 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 61 [2019-08-05 11:13:31,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:31,235 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:13:31,235 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:13:31,235 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:13:31,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:13:31,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 11:13:31,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:13:31,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-08-05 11:13:31,245 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 61 [2019-08-05 11:13:31,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:31,245 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-08-05 11:13:31,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:13:31,245 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-08-05 11:13:31,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 11:13:31,246 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:31,246 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 1, 1, 1, 1] [2019-08-05 11:13:31,247 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:31,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:31,247 INFO L82 PathProgramCache]: Analyzing trace with hash 628802537, now seen corresponding path program 12 times [2019-08-05 11:13:31,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:31,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:13:31,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:31,584 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-08-05 11:13:31,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:31,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:13:31,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:13:31,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:13:31,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:13:31,586 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 15 states. [2019-08-05 11:13:31,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:31,736 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2019-08-05 11:13:31,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:13:31,737 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-08-05 11:13:31,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:31,738 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:13:31,738 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:13:31,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:13:31,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:13:31,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 11:13:31,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:13:31,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-08-05 11:13:31,744 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 66 [2019-08-05 11:13:31,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:31,744 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-08-05 11:13:31,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:13:31,745 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-08-05 11:13:31,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 11:13:31,746 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:31,746 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 1, 1, 1, 1] [2019-08-05 11:13:31,746 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:31,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:31,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1167296603, now seen corresponding path program 13 times [2019-08-05 11:13:31,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:31,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:13:31,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:32,070 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-08-05 11:13:32,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:32,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:13:32,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:13:32,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:13:32,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:13:32,072 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 16 states. [2019-08-05 11:13:32,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:32,129 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-08-05 11:13:32,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:13:32,129 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 71 [2019-08-05 11:13:32,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:32,130 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:13:32,131 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:13:32,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:13:32,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:13:32,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 11:13:32,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:13:32,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-08-05 11:13:32,136 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 71 [2019-08-05 11:13:32,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:32,137 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-08-05 11:13:32,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:13:32,137 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-08-05 11:13:32,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 11:13:32,138 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:32,138 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 1, 1, 1, 1] [2019-08-05 11:13:32,138 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:32,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:32,139 INFO L82 PathProgramCache]: Analyzing trace with hash 729903709, now seen corresponding path program 14 times [2019-08-05 11:13:32,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:32,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:13:32,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:32,353 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-08-05 11:13:32,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:32,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:13:32,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:13:32,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:13:32,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:13:32,354 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 17 states. [2019-08-05 11:13:32,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:32,414 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-08-05 11:13:32,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:13:32,415 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2019-08-05 11:13:32,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:32,416 INFO L225 Difference]: With dead ends: 38 [2019-08-05 11:13:32,416 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 11:13:32,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:13:32,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 11:13:32,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 11:13:32,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 11:13:32,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-08-05 11:13:32,422 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 76 [2019-08-05 11:13:32,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:32,423 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-08-05 11:13:32,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:13:32,423 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-08-05 11:13:32,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 11:13:32,424 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:32,424 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 1, 1, 1, 1] [2019-08-05 11:13:32,424 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:32,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:32,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1481493553, now seen corresponding path program 15 times [2019-08-05 11:13:32,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:32,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:13:32,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:32,742 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-08-05 11:13:32,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:32,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:13:32,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:13:32,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:13:32,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:13:32,744 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 18 states. [2019-08-05 11:13:32,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:32,795 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2019-08-05 11:13:32,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:13:32,795 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 81 [2019-08-05 11:13:32,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:32,797 INFO L225 Difference]: With dead ends: 40 [2019-08-05 11:13:32,797 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 11:13:32,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:13:32,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 11:13:32,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 11:13:32,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 11:13:32,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-08-05 11:13:32,802 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 81 [2019-08-05 11:13:32,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:32,803 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-08-05 11:13:32,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:13:32,803 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-08-05 11:13:32,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 11:13:32,804 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:32,804 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 1, 1, 1, 1] [2019-08-05 11:13:32,805 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:32,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:32,805 INFO L82 PathProgramCache]: Analyzing trace with hash -299399471, now seen corresponding path program 16 times [2019-08-05 11:13:32,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:32,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:13:32,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:33,460 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-08-05 11:13:33,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:33,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:13:33,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:13:33,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:13:33,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:13:33,462 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 19 states. [2019-08-05 11:13:33,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:33,512 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-08-05 11:13:33,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:13:33,515 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 86 [2019-08-05 11:13:33,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:33,516 INFO L225 Difference]: With dead ends: 42 [2019-08-05 11:13:33,516 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 11:13:33,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:13:33,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 11:13:33,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 11:13:33,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 11:13:33,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-08-05 11:13:33,522 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 86 [2019-08-05 11:13:33,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:33,522 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-08-05 11:13:33,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:13:33,522 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-08-05 11:13:33,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 11:13:33,523 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:33,524 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 1, 1, 1, 1] [2019-08-05 11:13:33,524 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:33,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:33,524 INFO L82 PathProgramCache]: Analyzing trace with hash 435832131, now seen corresponding path program 17 times [2019-08-05 11:13:33,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:33,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:13:33,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:33,866 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-08-05 11:13:33,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:33,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:13:33,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:13:33,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:13:33,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:13:33,868 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 20 states. [2019-08-05 11:13:33,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:33,927 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-08-05 11:13:33,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:13:33,929 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 91 [2019-08-05 11:13:33,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:33,930 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:13:33,930 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:13:33,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:13:33,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:13:33,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 11:13:33,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 11:13:33,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-08-05 11:13:33,936 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 91 [2019-08-05 11:13:33,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:33,936 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-08-05 11:13:33,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:13:33,936 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-08-05 11:13:33,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 11:13:33,938 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:33,938 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 1, 1, 1, 1] [2019-08-05 11:13:33,938 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:33,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:33,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1315307195, now seen corresponding path program 18 times [2019-08-05 11:13:33,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:33,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:13:33,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:34,332 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-08-05 11:13:34,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:34,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:13:34,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:13:34,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:13:34,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:34,334 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 21 states. [2019-08-05 11:13:34,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:34,386 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2019-08-05 11:13:34,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:13:34,387 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 96 [2019-08-05 11:13:34,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:34,388 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:13:34,389 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:13:34,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:13:34,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:13:34,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 11:13:34,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 11:13:34,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-08-05 11:13:34,394 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 96 [2019-08-05 11:13:34,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:34,395 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-08-05 11:13:34,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:13:34,395 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-08-05 11:13:34,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 11:13:34,396 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:34,396 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 1, 1, 1, 1] [2019-08-05 11:13:34,396 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:34,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:34,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1626913975, now seen corresponding path program 19 times [2019-08-05 11:13:34,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:34,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:13:34,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:34,736 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-08-05 11:13:34,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:34,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:13:34,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:13:34,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:13:34,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:13:34,738 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 22 states. [2019-08-05 11:13:34,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:34,819 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-08-05 11:13:34,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:13:34,820 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 101 [2019-08-05 11:13:34,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:34,821 INFO L225 Difference]: With dead ends: 48 [2019-08-05 11:13:34,821 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 11:13:34,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:13:34,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 11:13:34,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 11:13:34,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 11:13:34,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-08-05 11:13:34,826 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 101 [2019-08-05 11:13:34,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:34,826 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-08-05 11:13:34,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:13:34,826 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-08-05 11:13:34,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 11:13:34,827 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:34,827 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 1, 1, 1, 1] [2019-08-05 11:13:34,828 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:34,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:34,828 INFO L82 PathProgramCache]: Analyzing trace with hash 931520953, now seen corresponding path program 20 times [2019-08-05 11:13:34,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:34,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:13:34,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:35,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-08-05 11:13:35,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:35,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:13:35,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:13:35,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:13:35,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:35,405 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 23 states. [2019-08-05 11:13:35,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:35,553 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2019-08-05 11:13:35,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:13:35,555 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 106 [2019-08-05 11:13:35,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:35,557 INFO L225 Difference]: With dead ends: 50 [2019-08-05 11:13:35,557 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 11:13:35,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:13:35,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 11:13:35,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 11:13:35,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 11:13:35,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-08-05 11:13:35,561 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 106 [2019-08-05 11:13:35,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:35,562 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-08-05 11:13:35,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:13:35,562 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-08-05 11:13:35,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 11:13:35,563 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:35,563 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 1, 1, 1, 1] [2019-08-05 11:13:35,564 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:35,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:35,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1455069739, now seen corresponding path program 21 times [2019-08-05 11:13:35,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:35,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:13:35,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:35,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1134 trivial. 0 not checked. [2019-08-05 11:13:35,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:13:35,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:13:35,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:13:35,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:13:35,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:13:35,684 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 4 states. [2019-08-05 11:13:35,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:35,685 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2019-08-05 11:13:35,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:13:35,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-08-05 11:13:35,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:35,686 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:13:35,686 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:13:35,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:13:35,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:13:35,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:13:35,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:13:35,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:13:35,687 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 111 [2019-08-05 11:13:35,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:35,688 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:13:35,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:13:35,688 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:13:35,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:13:35,692 INFO L202 PluginConnector]: Adding new model recursive-easy-3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:13:35 BoogieIcfgContainer [2019-08-05 11:13:35,693 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:13:35,695 INFO L168 Benchmark]: Toolchain (without parser) took 8628.73 ms. Allocated memory was 141.0 MB in the beginning and 286.3 MB in the end (delta: 145.2 MB). Free memory was 110.8 MB in the beginning and 96.5 MB in the end (delta: 14.3 MB). Peak memory consumption was 159.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:13:35,696 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 141.0 MB. Free memory was 111.9 MB in the beginning and 111.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:13:35,697 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.58 ms. Allocated memory is still 141.0 MB. Free memory was 110.6 MB in the beginning and 108.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:13:35,698 INFO L168 Benchmark]: Boogie Preprocessor took 23.91 ms. Allocated memory is still 141.0 MB. Free memory was 108.8 MB in the beginning and 107.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:13:35,699 INFO L168 Benchmark]: RCFGBuilder took 271.63 ms. Allocated memory is still 141.0 MB. Free memory was 107.7 MB in the beginning and 98.2 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:13:35,699 INFO L168 Benchmark]: TraceAbstraction took 8287.45 ms. Allocated memory was 141.0 MB in the beginning and 286.3 MB in the end (delta: 145.2 MB). Free memory was 97.9 MB in the beginning and 96.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 146.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:13:35,704 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.24 ms. Allocated memory is still 141.0 MB. Free memory was 111.9 MB in the beginning and 111.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.58 ms. Allocated memory is still 141.0 MB. Free memory was 110.6 MB in the beginning and 108.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.91 ms. Allocated memory is still 141.0 MB. Free memory was 108.8 MB in the beginning and 107.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 271.63 ms. Allocated memory is still 141.0 MB. Free memory was 107.7 MB in the beginning and 98.2 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8287.45 ms. Allocated memory was 141.0 MB in the beginning and 286.3 MB in the end (delta: 145.2 MB). Free memory was 97.9 MB in the beginning and 96.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 146.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: 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 2 procedures, 9 locations, 1 error locations. SAFE Result, 8.2s OverallTime, 23 OverallIterations, 22 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 186 SDtfs, 0 SDslu, 430 SDs, 0 SdLazy, 436 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1269 GetRequests, 1035 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=22, 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, 23 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1292 NumberOfCodeBlocks, 1292 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1269 ConstructedInterpolants, 0 QuantifiedInterpolants, 171027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2908 ConjunctsInSsa, 301 ConjunctsInUnsatCore, 23 InterpolantComputations, 3 PerfectInterpolantSequences, 5544/8624 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...