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/recursive/regression/bpl/addition-incorrect.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:07:54,809 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:07:54,811 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:07:54,823 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:07:54,823 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:07:54,824 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:07:54,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:07:54,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:07:54,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:07:54,830 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:07:54,831 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:07:54,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:07:54,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:07:54,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:07:54,834 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:07:54,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:07:54,836 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:07:54,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:07:54,839 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:07:54,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:07:54,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:07:54,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:07:54,845 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:07:54,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:07:54,849 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:07:54,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:07:54,850 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:07:54,850 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:07:54,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:07:54,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:07:54,852 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:07:54,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:07:54,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:07:54,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:07:54,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:07:54,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:07:54,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:07:54,858 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:07:54,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:07:54,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:07:54,860 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:07:54,887 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:07:54,899 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:07:54,903 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:07:54,904 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:07:54,905 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:07:54,906 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/recursive/regression/bpl/addition-incorrect.bpl [2019-08-05 11:07:54,906 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/recursive/regression/bpl/addition-incorrect.bpl' [2019-08-05 11:07:54,934 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:07:54,936 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:07:54,936 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:07:54,937 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:07:54,937 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:07:54,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "addition-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:54" (1/1) ... [2019-08-05 11:07:54,963 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "addition-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:54" (1/1) ... [2019-08-05 11:07:54,969 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:07:54,969 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:07:54,970 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:07:54,972 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:07:54,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:07:54,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:07:54,973 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:07:54,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "addition-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:54" (1/1) ... [2019-08-05 11:07:54,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "addition-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:54" (1/1) ... [2019-08-05 11:07:54,986 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "addition-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:54" (1/1) ... [2019-08-05 11:07:54,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "addition-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:54" (1/1) ... [2019-08-05 11:07:54,989 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "addition-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:54" (1/1) ... [2019-08-05 11:07:54,991 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "addition-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:54" (1/1) ... [2019-08-05 11:07:54,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "addition-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:54" (1/1) ... [2019-08-05 11:07:54,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:07:54,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:07:54,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:07:54,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:07:54,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "addition-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:54" (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:07:55,072 INFO L130 BoogieDeclarations]: Found specification of procedure Main [2019-08-05 11:07:55,073 INFO L138 BoogieDeclarations]: Found implementation of procedure Main [2019-08-05 11:07:55,073 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2019-08-05 11:07:55,073 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2019-08-05 11:07:55,149 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-08-05 11:07:55,326 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-08-05 11:07:55,357 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:07:55,357 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:07:55,358 INFO L202 PluginConnector]: Adding new model addition-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:07:55 BoogieIcfgContainer [2019-08-05 11:07:55,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:07:55,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:07:55,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:07:55,363 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:07:55,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "addition-incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:07:54" (1/2) ... [2019-08-05 11:07:55,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23dc5252 and model type addition-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:07:55, skipping insertion in model container [2019-08-05 11:07:55,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "addition-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:07:55" (2/2) ... [2019-08-05 11:07:55,367 INFO L109 eAbstractionObserver]: Analyzing ICFG addition-incorrect.bpl [2019-08-05 11:07:55,376 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:07:55,383 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-08-05 11:07:55,397 INFO L252 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-08-05 11:07:55,420 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:07:55,421 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:07:55,421 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:07:55,422 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:07:55,422 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:07:55,422 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:07:55,422 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:07:55,422 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:07:55,423 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:07:55,437 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2019-08-05 11:07:55,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 11:07:55,447 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:55,448 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 11:07:55,451 INFO L418 AbstractCegarLoop]: === Iteration 1 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:55,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:55,456 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-08-05 11:07:55,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:55,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:07:55,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:55,587 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:07:55,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:55,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:07:55,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:55,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:55,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:55,621 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2019-08-05 11:07:55,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:55,713 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-08-05 11:07:55,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:55,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 11:07:55,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:55,726 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:07:55,727 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:07:55,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:55,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:07:55,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:07:55,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:07:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-08-05 11:07:55,779 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 2 [2019-08-05 11:07:55,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:55,779 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-08-05 11:07:55,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:55,780 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-08-05 11:07:55,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 11:07:55,781 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:55,781 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 11:07:55,781 INFO L418 AbstractCegarLoop]: === Iteration 2 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:55,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:55,783 INFO L82 PathProgramCache]: Analyzing trace with hash 964, now seen corresponding path program 1 times [2019-08-05 11:07:55,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:55,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:07:55,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:55,829 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:07:55,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:55,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:07:55,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:55,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:55,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:55,833 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 3 states. [2019-08-05 11:07:55,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:55,877 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-05 11:07:55,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:55,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 11:07:55,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:55,879 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:07:55,879 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:07:55,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:55,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:07:55,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:07:55,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:07:55,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 11:07:55,884 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 2 [2019-08-05 11:07:55,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:55,885 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 11:07:55,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:55,885 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 11:07:55,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:07:55,886 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:55,886 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:07:55,886 INFO L418 AbstractCegarLoop]: === Iteration 3 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:55,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:55,887 INFO L82 PathProgramCache]: Analyzing trace with hash 37898, now seen corresponding path program 1 times [2019-08-05 11:07:55,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:55,894 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:55,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:55,976 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:07:55,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:55,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:07:55,977 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:07:55,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:07:55,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:55,979 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 4 states. [2019-08-05 11:07:56,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:56,092 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-08-05 11:07:56,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:07:56,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 11:07:56,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:56,096 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:07:56,096 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:07:56,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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:07:56,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:07:56,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2019-08-05 11:07:56,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:07:56,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-08-05 11:07:56,104 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 3 [2019-08-05 11:07:56,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:56,104 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-08-05 11:07:56,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:07:56,104 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-08-05 11:07:56,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:07:56,105 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:56,105 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:07:56,105 INFO L418 AbstractCegarLoop]: === Iteration 4 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:56,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:56,106 INFO L82 PathProgramCache]: Analyzing trace with hash 37897, now seen corresponding path program 1 times [2019-08-05 11:07:56,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:56,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:07:56,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:56,118 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:07:56,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:56,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:07:56,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:07:56,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:07:56,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:07:56,121 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2019-08-05 11:07:56,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:56,157 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-08-05 11:07:56,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:07:56,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:07:56,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:56,159 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:07:56,159 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:07:56,159 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:07:56,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:07:56,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-08-05 11:07:56,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:07:56,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 11:07:56,163 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 3 [2019-08-05 11:07:56,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:56,163 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 11:07:56,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:07:56,163 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 11:07:56,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:07:56,164 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:56,164 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:56,165 INFO L418 AbstractCegarLoop]: === Iteration 5 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:56,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:56,165 INFO L82 PathProgramCache]: Analyzing trace with hash -2000469301, now seen corresponding path program 1 times [2019-08-05 11:07:56,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:56,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:07:56,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:56,248 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:07:56,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:56,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:07:56,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:07:56,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:07:56,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:07:56,261 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 4 states. [2019-08-05 11:07:56,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:56,391 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-08-05 11:07:56,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:07:56,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-08-05 11:07:56,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:56,393 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:07:56,393 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:07:56,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:07:56,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:07:56,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2019-08-05 11:07:56,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:07:56,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-08-05 11:07:56,398 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2019-08-05 11:07:56,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:56,399 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-08-05 11:07:56,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:07:56,399 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-08-05 11:07:56,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:07:56,400 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:56,400 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:56,400 INFO L418 AbstractCegarLoop]: === Iteration 6 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:56,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:56,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1885006149, now seen corresponding path program 1 times [2019-08-05 11:07:56,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:56,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:07:56,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:56,618 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:07:56,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:07:56,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-05 11:07:56,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:07:56,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:07:56,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:07:56,620 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 5 states. [2019-08-05 11:07:56,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:56,739 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-08-05 11:07:56,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:07:56,740 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 11:07:56,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:56,740 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:07:56,741 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:07:56,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:07:56,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:07:56,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:07:56,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:07:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 11:07:56,744 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 8 [2019-08-05 11:07:56,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:56,745 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 11:07:56,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:07:56,745 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 11:07:56,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:07:56,746 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:56,746 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:56,746 INFO L418 AbstractCegarLoop]: === Iteration 7 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:56,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:56,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1706638143, now seen corresponding path program 1 times [2019-08-05 11:07:56,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:56,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:07:56,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:56,811 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:07:56,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:56,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:07:56,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:07:56,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:07:56,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:07:56,813 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 5 states. [2019-08-05 11:07:56,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:56,880 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-08-05 11:07:56,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:07:56,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-08-05 11:07:56,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:56,881 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:07:56,881 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:07:56,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:07:56,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:07:56,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-08-05 11:07:56,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:07:56,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-08-05 11:07:56,886 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2019-08-05 11:07:56,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:56,887 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-08-05 11:07:56,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:07:56,887 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-08-05 11:07:56,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:07:56,888 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:56,888 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:56,888 INFO L418 AbstractCegarLoop]: === Iteration 8 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:56,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:56,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1366174919, now seen corresponding path program 1 times [2019-08-05 11:07:56,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:56,904 WARN L254 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:07:56,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:57,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 11:07:57,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:57,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:07:57,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:07:57,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:07:57,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:07:57,121 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 7 states. [2019-08-05 11:07:57,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:57,232 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2019-08-05 11:07:57,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:07:57,232 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-08-05 11:07:57,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:57,233 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:07:57,233 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:07:57,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:07:57,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:07:57,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-08-05 11:07:57,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:07:57,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-05 11:07:57,239 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2019-08-05 11:07:57,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:57,239 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-05 11:07:57,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:07:57,240 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-05 11:07:57,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:07:57,240 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:57,241 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 11:07:57,241 INFO L418 AbstractCegarLoop]: === Iteration 9 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:57,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:57,242 INFO L82 PathProgramCache]: Analyzing trace with hash 688329411, now seen corresponding path program 2 times [2019-08-05 11:07:57,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:57,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:07:57,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:57,331 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:07:57,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:57,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:07:57,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:07:57,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:07:57,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:07:57,333 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 6 states. [2019-08-05 11:07:57,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:57,413 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-08-05 11:07:57,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:07:57,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-08-05 11:07:57,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:57,414 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:07:57,414 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:07:57,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:07:57,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:07:57,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2019-08-05 11:07:57,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:07:57,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-08-05 11:07:57,419 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 17 [2019-08-05 11:07:57,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:57,419 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-08-05 11:07:57,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:07:57,419 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-08-05 11:07:57,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:07:57,420 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:57,420 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:57,421 INFO L418 AbstractCegarLoop]: === Iteration 10 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:57,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:57,421 INFO L82 PathProgramCache]: Analyzing trace with hash -136624701, now seen corresponding path program 2 times [2019-08-05 11:07:57,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:57,440 WARN L254 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:07:57,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:57,859 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 11:07:57,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:57,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:07:57,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:07:57,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:07:57,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:07:57,861 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 8 states. [2019-08-05 11:07:58,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:58,018 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-08-05 11:07:58,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:07:58,018 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-08-05 11:07:58,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:58,019 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:07:58,019 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:07:58,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:07:58,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:07:58,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-08-05 11:07:58,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:07:58,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-08-05 11:07:58,023 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 18 [2019-08-05 11:07:58,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:58,024 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-08-05 11:07:58,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:07:58,024 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-08-05 11:07:58,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:07:58,025 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:58,025 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2019-08-05 11:07:58,025 INFO L418 AbstractCegarLoop]: === Iteration 11 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:58,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:58,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1924008137, now seen corresponding path program 3 times [2019-08-05 11:07:58,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:58,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:07:58,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:58,108 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:07:58,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:58,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:07:58,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:07:58,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:07:58,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:07:58,110 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2019-08-05 11:07:58,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:58,162 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-08-05 11:07:58,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:07:58,163 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-08-05 11:07:58,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:58,164 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:07:58,164 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:07:58,164 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:07:58,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:07:58,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2019-08-05 11:07:58,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:07:58,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2019-08-05 11:07:58,169 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 22 [2019-08-05 11:07:58,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:58,170 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-08-05 11:07:58,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:07:58,170 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2019-08-05 11:07:58,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:07:58,171 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:58,171 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:58,172 INFO L418 AbstractCegarLoop]: === Iteration 12 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:58,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:58,172 INFO L82 PathProgramCache]: Analyzing trace with hash 485289935, now seen corresponding path program 3 times [2019-08-05 11:07:58,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:58,191 WARN L254 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:07:58,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:58,449 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-08-05 11:07:58,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:58,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:07:58,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:07:58,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:07:58,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:07:58,451 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 9 states. [2019-08-05 11:07:58,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:58,671 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-08-05 11:07:58,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:07:58,671 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-08-05 11:07:58,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:58,672 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:07:58,672 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:07:58,673 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:07:58,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:07:58,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-08-05 11:07:58,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:07:58,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-08-05 11:07:58,677 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 23 [2019-08-05 11:07:58,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:58,678 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-08-05 11:07:58,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:07:58,678 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-08-05 11:07:58,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:07:58,679 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:58,679 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2019-08-05 11:07:58,680 INFO L418 AbstractCegarLoop]: === Iteration 13 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:58,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:58,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1838291269, now seen corresponding path program 4 times [2019-08-05 11:07:58,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:58,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:07:58,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:58,777 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:07:58,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:58,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:07:58,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:07:58,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:07:58,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:07:58,779 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 8 states. [2019-08-05 11:07:58,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:58,892 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-08-05 11:07:58,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:07:58,893 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-08-05 11:07:58,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:58,894 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:07:58,894 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:07:58,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:07:58,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:07:58,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-08-05 11:07:58,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:07:58,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-08-05 11:07:58,898 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 27 [2019-08-05 11:07:58,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:58,899 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-08-05 11:07:58,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:07:58,899 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-08-05 11:07:58,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:07:58,900 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:58,900 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:58,900 INFO L418 AbstractCegarLoop]: === Iteration 14 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:58,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:58,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1152454453, now seen corresponding path program 4 times [2019-08-05 11:07:58,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:58,918 WARN L254 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:07:58,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:59,091 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-08-05 11:07:59,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:59,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:07:59,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:07:59,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:07:59,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:07:59,093 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 10 states. [2019-08-05 11:07:59,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:59,231 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-08-05 11:07:59,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:07:59,231 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-08-05 11:07:59,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:59,233 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:07:59,233 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:07:59,234 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:07:59,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:07:59,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-08-05 11:07:59,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:07:59,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-08-05 11:07:59,237 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 28 [2019-08-05 11:07:59,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:59,238 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-08-05 11:07:59,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:07:59,238 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-08-05 11:07:59,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:07:59,239 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:59,239 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2019-08-05 11:07:59,240 INFO L418 AbstractCegarLoop]: === Iteration 15 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:59,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:59,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1189595345, now seen corresponding path program 5 times [2019-08-05 11:07:59,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:59,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:07:59,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:59,345 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:07:59,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:59,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:07:59,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:07:59,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:07:59,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:07:59,346 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 9 states. [2019-08-05 11:07:59,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:59,400 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-08-05 11:07:59,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:07:59,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2019-08-05 11:07:59,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:59,402 INFO L225 Difference]: With dead ends: 26 [2019-08-05 11:07:59,402 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 11:07:59,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:07:59,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 11:07:59,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-08-05 11:07:59,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:07:59,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-08-05 11:07:59,407 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 32 [2019-08-05 11:07:59,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:59,408 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-08-05 11:07:59,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:07:59,408 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-08-05 11:07:59,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:07:59,409 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:59,409 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2019-08-05 11:07:59,409 INFO L418 AbstractCegarLoop]: === Iteration 16 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:59,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:59,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1777250007, now seen corresponding path program 5 times [2019-08-05 11:07:59,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:59,428 WARN L254 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:07:59,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 30 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-08-05 11:07:59,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:59,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:07:59,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:07:59,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:07:59,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:07:59,713 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 10 states. [2019-08-05 11:07:59,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:59,858 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-08-05 11:07:59,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:07:59,859 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-08-05 11:07:59,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:59,861 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:07:59,861 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:07:59,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:07:59,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:07:59,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 11:07:59,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:07:59,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-08-05 11:07:59,866 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 33 [2019-08-05 11:07:59,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:59,867 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-08-05 11:07:59,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:07:59,867 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-08-05 11:07:59,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:07:59,868 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:59,869 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2019-08-05 11:07:59,869 INFO L418 AbstractCegarLoop]: === Iteration 17 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:07:59,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:59,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1138377037, now seen corresponding path program 6 times [2019-08-05 11:07:59,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:59,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:07:59,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:59,996 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:07:59,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:59,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:07:59,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:07:59,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:07:59,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:07:59,998 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 10 states. [2019-08-05 11:08:00,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:00,088 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-08-05 11:08:00,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:08:00,089 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2019-08-05 11:08:00,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:00,090 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:08:00,090 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:08:00,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:08:00,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:08:00,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-08-05 11:08:00,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:08:00,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-08-05 11:08:00,095 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 37 [2019-08-05 11:08:00,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:00,095 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-08-05 11:08:00,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:08:00,095 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-08-05 11:08:00,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:08:00,096 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:00,096 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2019-08-05 11:08:00,097 INFO L418 AbstractCegarLoop]: === Iteration 18 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:00,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:00,097 INFO L82 PathProgramCache]: Analyzing trace with hash -929949741, now seen corresponding path program 6 times [2019-08-05 11:08:00,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:00,117 WARN L254 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:08:00,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:00,284 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-08-05 11:08:00,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:00,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:08:00,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:08:00,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:08:00,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:08:00,286 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 11 states. [2019-08-05 11:08:00,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:00,469 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-08-05 11:08:00,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:08:00,470 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2019-08-05 11:08:00,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:00,471 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:08:00,471 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:08:00,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:08:00,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:08:00,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 11:08:00,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:08:00,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-08-05 11:08:00,476 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 38 [2019-08-05 11:08:00,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:00,476 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-08-05 11:08:00,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:08:00,476 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-08-05 11:08:00,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:08:00,478 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:00,478 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2019-08-05 11:08:00,479 INFO L418 AbstractCegarLoop]: === Iteration 19 === [MainErr1REQUIRES_VIOLATIONPRE_CONDITION, MainErr3ENSURES_VIOLATIONPOST_CONDITION, MainErr2ASSERT_VIOLATIONASSERT, MainErr0REQUIRES_VIOLATIONPRE_CONDITION, additionErr1REQUIRES_VIOLATIONPRE_CONDITION, additionErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:08:00,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:00,479 INFO L82 PathProgramCache]: Analyzing trace with hash -128320729, now seen corresponding path program 7 times [2019-08-05 11:08:00,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:08:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 11:08:00,539 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 11:08:00,580 INFO L202 PluginConnector]: Adding new model addition-incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:08:00 BoogieIcfgContainer [2019-08-05 11:08:00,581 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:08:00,585 INFO L168 Benchmark]: Toolchain (without parser) took 5648.66 ms. Allocated memory was 133.7 MB in the beginning and 236.5 MB in the end (delta: 102.8 MB). Free memory was 111.1 MB in the beginning and 173.8 MB in the end (delta: -62.7 MB). Peak memory consumption was 40.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:00,587 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory is still 112.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:08:00,587 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.75 ms. Allocated memory is still 133.7 MB. Free memory was 111.1 MB in the beginning and 109.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:00,588 INFO L168 Benchmark]: Boogie Preprocessor took 21.49 ms. Allocated memory is still 133.7 MB. Free memory was 109.0 MB in the beginning and 108.2 MB in the end (delta: 857.4 kB). Peak memory consumption was 857.4 kB. Max. memory is 7.1 GB. [2019-08-05 11:08:00,589 INFO L168 Benchmark]: RCFGBuilder took 364.05 ms. Allocated memory is still 133.7 MB. Free memory was 107.8 MB in the beginning and 97.5 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:00,591 INFO L168 Benchmark]: TraceAbstraction took 5220.76 ms. Allocated memory was 133.7 MB in the beginning and 236.5 MB in the end (delta: 102.8 MB). Free memory was 97.5 MB in the beginning and 173.8 MB in the end (delta: -76.3 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:00,596 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.21 ms. Allocated memory is still 133.7 MB. Free memory is still 112.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.75 ms. Allocated memory is still 133.7 MB. Free memory was 111.1 MB in the beginning and 109.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.49 ms. Allocated memory is still 133.7 MB. Free memory was 109.0 MB in the beginning and 108.2 MB in the end (delta: 857.4 kB). Peak memory consumption was 857.4 kB. Max. memory is 7.1 GB. * RCFGBuilder took 364.05 ms. Allocated memory is still 133.7 MB. Free memory was 107.8 MB in the beginning and 97.5 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5220.76 ms. Allocated memory was 133.7 MB in the beginning and 236.5 MB in the end (delta: 102.8 MB). Free memory was 97.5 MB in the beginning and 173.8 MB in the end (delta: -76.3 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 21]: assertion can be violated assertion can be violated We found a FailurePath: [L14] free requires a >= 0; [L15] free requires b >= 0; VAL [a=7, b=7] [L20] CALL call c := addition(a, b); VAL [x=7, y=7] [L25-L26] requires x >= 0; [L25-L27] requires y >= 0; VAL [x=7, y=7] [L31] COND FALSE !(y == 0) VAL [x=7, y=7] [L36] CALL call res := addition(x + 1, y - 1); VAL [x=8, y=6] [L25-L26] requires x >= 0; [L25-L27] requires y >= 0; VAL [x=8, y=6] [L31] COND FALSE !(y == 0) VAL [x=8, y=6] [L36] CALL call res := addition(x + 1, y - 1); VAL [x=9, y=5] [L25-L26] requires x >= 0; [L25-L27] requires y >= 0; VAL [x=9, y=5] [L31] COND FALSE !(y == 0) VAL [x=9, y=5] [L36] CALL call res := addition(x + 1, y - 1); VAL [x=10, y=4] [L25-L26] requires x >= 0; [L25-L27] requires y >= 0; VAL [x=10, y=4] [L31] COND FALSE !(y == 0) VAL [x=10, y=4] [L36] CALL call res := addition(x + 1, y - 1); VAL [x=11, y=3] [L25-L26] requires x >= 0; [L25-L27] requires y >= 0; VAL [x=11, y=3] [L31] COND FALSE !(y == 0) VAL [x=11, y=3] [L36] CALL call res := addition(x + 1, y - 1); VAL [x=12, y=2] [L25-L26] requires x >= 0; [L25-L27] requires y >= 0; VAL [x=12, y=2] [L31] COND FALSE !(y == 0) VAL [x=12, y=2] [L36] CALL call res := addition(x + 1, y - 1); VAL [x=13, y=1] [L25-L26] requires x >= 0; [L25-L27] requires y >= 0; VAL [x=13, y=1] [L31] COND FALSE !(y == 0) VAL [x=13, y=1] [L36] CALL call res := addition(x + 1, y - 1); VAL [x=14, y=0] [L25-L26] requires x >= 0; [L25-L27] requires y >= 0; VAL [x=14, y=0] [L31] COND TRUE y == 0 [L32] res := x; [L33] res := res * 1; VAL [res=14, x=14, y=0] [L36] RET call res := addition(x + 1, y - 1); VAL [res=14, x=13, y=1] [L36] RET call res := addition(x + 1, y - 1); VAL [res=14, x=12, y=2] [L36] RET call res := addition(x + 1, y - 1); VAL [res=14, x=11, y=3] [L36] RET call res := addition(x + 1, y - 1); VAL [res=14, x=10, y=4] [L36] RET call res := addition(x + 1, y - 1); VAL [res=14, x=9, y=5] [L36] RET call res := addition(x + 1, y - 1); VAL [res=14, x=8, y=6] [L36] RET call res := addition(x + 1, y - 1); VAL [res=14, x=7, y=7] [L20] RET call c := addition(a, b); VAL [a=7, b=7, c=14] [L21] assert a == 7 && b == 7 ==> c == 5; VAL [a=7, b=7, c=14] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 6 error locations. UNSAFE Result, 5.1s OverallTime, 19 OverallIterations, 8 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 168 SDtfs, 93 SDslu, 365 SDs, 0 SdLazy, 678 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 311 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 22 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 367 NumberOfCodeBlocks, 367 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 307 ConstructedInterpolants, 0 QuantifiedInterpolants, 33225 SizeOfPredicates, 0 NumberOfNonLiveVariables, 841 ConjunctsInSsa, 253 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 290/518 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...