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/20170304-DifficultPathPrograms/s3_clnt_2.cil.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:16:29,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:16:29,650 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:16:29,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:16:29,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:16:29,668 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:16:29,670 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:16:29,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:16:29,675 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:16:29,682 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:16:29,683 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:16:29,686 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:16:29,687 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:16:29,690 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:16:29,691 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:16:29,692 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:16:29,693 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:16:29,694 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:16:29,700 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:16:29,706 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:16:29,707 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:16:29,711 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:16:29,712 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:16:29,713 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:16:29,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:16:29,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:16:29,716 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:16:29,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:16:29,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:16:29,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:16:29,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:16:29,721 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:16:29,725 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:16:29,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:16:29,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:16:29,727 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:16:29,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:16:29,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:16:29,728 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:16:29,729 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:16:29,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:16:29,756 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:16:29,772 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:16:29,776 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:16:29,778 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:16:29,779 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:16:29,779 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_2.cil.c_21.bpl [2019-08-05 10:16:29,780 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_2.cil.c_21.bpl' [2019-08-05 10:16:29,860 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:16:29,862 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:16:29,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:16:29,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:16:29,863 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:16:29,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:29" (1/1) ... [2019-08-05 10:16:29,905 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:29" (1/1) ... [2019-08-05 10:16:29,913 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:16:29,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:16:29,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:16:29,915 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:16:29,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:29" (1/1) ... [2019-08-05 10:16:29,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:29" (1/1) ... [2019-08-05 10:16:29,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:29" (1/1) ... [2019-08-05 10:16:29,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:29" (1/1) ... [2019-08-05 10:16:29,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:29" (1/1) ... [2019-08-05 10:16:29,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:29" (1/1) ... [2019-08-05 10:16:29,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:29" (1/1) ... [2019-08-05 10:16:29,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:16:29,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:16:29,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:16:29,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:16:29,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:16:30,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:16:30,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:16:30,701 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-08-05 10:16:31,057 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:16:31,057 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 10:16:31,058 INFO L202 PluginConnector]: Adding new model s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:16:31 BoogieIcfgContainer [2019-08-05 10:16:31,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:16:31,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:16:31,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:16:31,063 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:16:31,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:16:29" (1/2) ... [2019-08-05 10:16:31,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d36230b and model type s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:16:31, skipping insertion in model container [2019-08-05 10:16:31,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:16:31" (2/2) ... [2019-08-05 10:16:31,067 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil.c_21.bpl [2019-08-05 10:16:31,076 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:16:31,087 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:16:31,105 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:16:31,147 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:16:31,148 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:16:31,148 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:16:31,148 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:16:31,149 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:16:31,149 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:16:31,149 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:16:31,149 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:16:31,149 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:16:31,164 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2019-08-05 10:16:31,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:16:31,176 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:31,177 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:31,179 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:31,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:31,186 INFO L82 PathProgramCache]: Analyzing trace with hash 2097985007, now seen corresponding path program 1 times [2019-08-05 10:16:31,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:31,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:16:31,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:31,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:31,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:31,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:16:31,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:31,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:31,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:31,439 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2019-08-05 10:16:31,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:31,648 INFO L93 Difference]: Finished difference Result 25 states and 39 transitions. [2019-08-05 10:16:31,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:31,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-08-05 10:16:31,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:31,663 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:16:31,663 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:16:31,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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 10:16:31,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:16:31,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:16:31,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:16:31,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2019-08-05 10:16:31,701 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 39 transitions. Word has length 10 [2019-08-05 10:16:31,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:31,702 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 39 transitions. [2019-08-05 10:16:31,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:31,702 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 39 transitions. [2019-08-05 10:16:31,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:16:31,703 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:31,703 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:31,704 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:31,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:31,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1998621291, now seen corresponding path program 1 times [2019-08-05 10:16:31,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:31,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:16:31,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:31,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:16:31,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:31,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:31,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:31,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:31,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:31,813 INFO L87 Difference]: Start difference. First operand 25 states and 39 transitions. Second operand 3 states. [2019-08-05 10:16:32,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:32,011 INFO L93 Difference]: Finished difference Result 30 states and 44 transitions. [2019-08-05 10:16:32,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:32,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-08-05 10:16:32,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:32,014 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:16:32,014 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:16:32,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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 10:16:32,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:16:32,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:16:32,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:16:32,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2019-08-05 10:16:32,023 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 44 transitions. Word has length 14 [2019-08-05 10:16:32,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:32,023 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 44 transitions. [2019-08-05 10:16:32,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:32,024 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. [2019-08-05 10:16:32,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:16:32,024 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:32,024 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:32,025 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:32,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:32,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1142573565, now seen corresponding path program 1 times [2019-08-05 10:16:32,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:32,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:16:32,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:32,088 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:16:32,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:32,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:32,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:32,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:32,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:32,093 INFO L87 Difference]: Start difference. First operand 30 states and 44 transitions. Second operand 3 states. [2019-08-05 10:16:32,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:32,276 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2019-08-05 10:16:32,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:32,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-08-05 10:16:32,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:32,277 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:16:32,278 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:16:32,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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 10:16:32,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:16:32,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:16:32,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:16:32,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2019-08-05 10:16:32,284 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 56 transitions. Word has length 19 [2019-08-05 10:16:32,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:32,285 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 56 transitions. [2019-08-05 10:16:32,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:32,285 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2019-08-05 10:16:32,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:16:32,286 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:32,286 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:32,286 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:32,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:32,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1071510880, now seen corresponding path program 1 times [2019-08-05 10:16:32,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:32,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:16:32,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:32,356 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-08-05 10:16:32,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:32,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:32,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:32,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:32,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:32,358 INFO L87 Difference]: Start difference. First operand 42 states and 56 transitions. Second operand 3 states. [2019-08-05 10:16:32,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:32,496 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2019-08-05 10:16:32,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:32,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-08-05 10:16:32,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:32,499 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:16:32,499 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:16:32,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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 10:16:32,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:16:32,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:16:32,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:16:32,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2019-08-05 10:16:32,506 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 25 [2019-08-05 10:16:32,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:32,506 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2019-08-05 10:16:32,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:32,507 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2019-08-05 10:16:32,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:16:32,508 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:32,508 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:32,508 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:32,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:32,509 INFO L82 PathProgramCache]: Analyzing trace with hash -463581491, now seen corresponding path program 1 times [2019-08-05 10:16:32,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:32,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:16:32,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:32,598 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-08-05 10:16:32,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:32,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:16:32,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:32,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:32,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:32,600 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand 3 states. [2019-08-05 10:16:32,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:32,741 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2019-08-05 10:16:32,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:32,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-08-05 10:16:32,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:32,745 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:16:32,745 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:16:32,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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 10:16:32,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:16:32,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:16:32,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:16:32,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2019-08-05 10:16:32,752 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 32 [2019-08-05 10:16:32,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:32,753 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2019-08-05 10:16:32,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:32,753 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2019-08-05 10:16:32,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:16:32,754 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:32,754 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:32,755 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:32,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:32,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1711916507, now seen corresponding path program 1 times [2019-08-05 10:16:32,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:32,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:16:32,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:33,101 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:16:33,192 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:16:33,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:33,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:16:33,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:16:33,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:16:33,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:16:33,194 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand 7 states. [2019-08-05 10:16:33,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:33,366 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2019-08-05 10:16:33,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:16:33,367 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-08-05 10:16:33,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:33,370 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:16:33,370 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:16:33,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:16:33,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:16:33,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87. [2019-08-05 10:16:33,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:16:33,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions. [2019-08-05 10:16:33,381 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 35 [2019-08-05 10:16:33,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:33,382 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 108 transitions. [2019-08-05 10:16:33,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:16:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions. [2019-08-05 10:16:33,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:16:33,384 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:33,384 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:33,384 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:33,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:33,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1145499157, now seen corresponding path program 2 times [2019-08-05 10:16:33,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:33,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:16:33,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:33,495 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-08-05 10:16:33,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:33,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:33,496 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:33,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:33,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:33,497 INFO L87 Difference]: Start difference. First operand 87 states and 108 transitions. Second operand 3 states. [2019-08-05 10:16:33,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:33,644 INFO L93 Difference]: Finished difference Result 117 states and 147 transitions. [2019-08-05 10:16:33,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:33,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-08-05 10:16:33,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:33,649 INFO L225 Difference]: With dead ends: 117 [2019-08-05 10:16:33,649 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 10:16:33,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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 10:16:33,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 10:16:33,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2019-08-05 10:16:33,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:16:33,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 132 transitions. [2019-08-05 10:16:33,659 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 132 transitions. Word has length 48 [2019-08-05 10:16:33,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:33,660 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 132 transitions. [2019-08-05 10:16:33,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:33,660 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2019-08-05 10:16:33,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:16:33,661 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:33,661 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 7, 6, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:33,662 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:33,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:33,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1373415361, now seen corresponding path program 3 times [2019-08-05 10:16:33,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:33,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:16:33,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:33,755 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:16:33,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:33,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:33,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:33,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:33,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:33,759 INFO L87 Difference]: Start difference. First operand 108 states and 132 transitions. Second operand 3 states. [2019-08-05 10:16:34,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:34,186 INFO L93 Difference]: Finished difference Result 159 states and 198 transitions. [2019-08-05 10:16:34,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:34,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-08-05 10:16:34,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:34,189 INFO L225 Difference]: With dead ends: 159 [2019-08-05 10:16:34,190 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 10:16:34,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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 10:16:34,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 10:16:34,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2019-08-05 10:16:34,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-08-05 10:16:34,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 195 transitions. [2019-08-05 10:16:34,214 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 195 transitions. Word has length 51 [2019-08-05 10:16:34,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:34,216 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 195 transitions. [2019-08-05 10:16:34,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:34,217 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 195 transitions. [2019-08-05 10:16:34,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:16:34,220 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:34,220 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:34,221 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:34,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:34,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1534825561, now seen corresponding path program 1 times [2019-08-05 10:16:34,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:34,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:16:34,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:34,325 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 10:16:34,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:34,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:34,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:34,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:34,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:34,330 INFO L87 Difference]: Start difference. First operand 156 states and 195 transitions. Second operand 3 states. [2019-08-05 10:16:34,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:34,441 INFO L93 Difference]: Finished difference Result 159 states and 198 transitions. [2019-08-05 10:16:34,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:34,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-08-05 10:16:34,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:34,444 INFO L225 Difference]: With dead ends: 159 [2019-08-05 10:16:34,444 INFO L226 Difference]: Without dead ends: 159 [2019-08-05 10:16:34,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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 10:16:34,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-08-05 10:16:34,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-08-05 10:16:34,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-08-05 10:16:34,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 198 transitions. [2019-08-05 10:16:34,451 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 198 transitions. Word has length 58 [2019-08-05 10:16:34,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:34,452 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 198 transitions. [2019-08-05 10:16:34,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:34,452 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 198 transitions. [2019-08-05 10:16:34,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:16:34,453 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:34,453 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 8, 7, 6, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:34,454 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:34,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:34,454 INFO L82 PathProgramCache]: Analyzing trace with hash 2109828369, now seen corresponding path program 1 times [2019-08-05 10:16:34,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:34,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:16:34,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:34,542 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-08-05 10:16:34,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:34,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:34,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:34,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:34,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:34,544 INFO L87 Difference]: Start difference. First operand 159 states and 198 transitions. Second operand 3 states. [2019-08-05 10:16:34,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:34,620 INFO L93 Difference]: Finished difference Result 189 states and 234 transitions. [2019-08-05 10:16:34,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:34,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-08-05 10:16:34,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:34,623 INFO L225 Difference]: With dead ends: 189 [2019-08-05 10:16:34,623 INFO L226 Difference]: Without dead ends: 189 [2019-08-05 10:16:34,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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 10:16:34,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-08-05 10:16:34,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-08-05 10:16:34,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-08-05 10:16:34,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 207 transitions. [2019-08-05 10:16:34,630 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 207 transitions. Word has length 60 [2019-08-05 10:16:34,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:34,631 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 207 transitions. [2019-08-05 10:16:34,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:34,631 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 207 transitions. [2019-08-05 10:16:34,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:16:34,632 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:34,632 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:34,633 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:34,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:34,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1969137301, now seen corresponding path program 1 times [2019-08-05 10:16:34,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:34,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:16:34,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:34,705 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-08-05 10:16:34,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:34,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:34,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:34,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:34,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:34,707 INFO L87 Difference]: Start difference. First operand 168 states and 207 transitions. Second operand 3 states. [2019-08-05 10:16:34,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:34,790 INFO L93 Difference]: Finished difference Result 186 states and 225 transitions. [2019-08-05 10:16:34,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:34,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-08-05 10:16:34,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:34,793 INFO L225 Difference]: With dead ends: 186 [2019-08-05 10:16:34,793 INFO L226 Difference]: Without dead ends: 186 [2019-08-05 10:16:34,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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 10:16:34,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-08-05 10:16:34,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-08-05 10:16:34,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-08-05 10:16:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 225 transitions. [2019-08-05 10:16:34,800 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 225 transitions. Word has length 67 [2019-08-05 10:16:34,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:34,800 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 225 transitions. [2019-08-05 10:16:34,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:34,800 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 225 transitions. [2019-08-05 10:16:34,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:16:34,801 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:34,802 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 9, 8, 7, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:34,802 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:34,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:34,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1205794369, now seen corresponding path program 1 times [2019-08-05 10:16:34,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:34,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:16:34,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:34,931 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-08-05 10:16:34,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:16:34,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:16:34,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:16:34,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:16:34,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:16:34,934 INFO L87 Difference]: Start difference. First operand 186 states and 225 transitions. Second operand 3 states. [2019-08-05 10:16:35,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:35,380 INFO L93 Difference]: Finished difference Result 195 states and 237 transitions. [2019-08-05 10:16:35,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:16:35,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-08-05 10:16:35,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:35,383 INFO L225 Difference]: With dead ends: 195 [2019-08-05 10:16:35,383 INFO L226 Difference]: Without dead ends: 195 [2019-08-05 10:16:35,384 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 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 10:16:35,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-08-05 10:16:35,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 186. [2019-08-05 10:16:35,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-08-05 10:16:35,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 222 transitions. [2019-08-05 10:16:35,389 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 222 transitions. Word has length 69 [2019-08-05 10:16:35,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:35,390 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 222 transitions. [2019-08-05 10:16:35,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:16:35,390 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 222 transitions. [2019-08-05 10:16:35,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:16:35,391 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:35,392 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 6, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:35,392 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:35,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:35,392 INFO L82 PathProgramCache]: Analyzing trace with hash 2078107493, now seen corresponding path program 1 times [2019-08-05 10:16:35,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:35,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:16:35,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:35,554 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 182 proven. 6 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 10:16:35,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:35,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:16:35,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:16:35,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:16:35,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:16:35,556 INFO L87 Difference]: Start difference. First operand 186 states and 222 transitions. Second operand 4 states. [2019-08-05 10:16:35,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:35,728 INFO L93 Difference]: Finished difference Result 225 states and 261 transitions. [2019-08-05 10:16:35,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:16:35,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-08-05 10:16:35,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:35,731 INFO L225 Difference]: With dead ends: 225 [2019-08-05 10:16:35,731 INFO L226 Difference]: Without dead ends: 225 [2019-08-05 10:16:35,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:16:35,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-05 10:16:35,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 219. [2019-08-05 10:16:35,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-08-05 10:16:35,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 255 transitions. [2019-08-05 10:16:35,737 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 255 transitions. Word has length 76 [2019-08-05 10:16:35,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:35,737 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 255 transitions. [2019-08-05 10:16:35,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:16:35,738 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 255 transitions. [2019-08-05 10:16:35,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:16:35,739 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:35,739 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 7, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:35,739 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:35,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:35,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1811919009, now seen corresponding path program 2 times [2019-08-05 10:16:35,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:35,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:16:35,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:36,020 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 238 proven. 22 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 10:16:36,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:36,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:16:36,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:16:36,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:16:36,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:16:36,021 INFO L87 Difference]: Start difference. First operand 219 states and 255 transitions. Second operand 5 states. [2019-08-05 10:16:36,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:36,442 INFO L93 Difference]: Finished difference Result 255 states and 291 transitions. [2019-08-05 10:16:36,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:16:36,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-08-05 10:16:36,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:36,445 INFO L225 Difference]: With dead ends: 255 [2019-08-05 10:16:36,446 INFO L226 Difference]: Without dead ends: 255 [2019-08-05 10:16:36,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:16:36,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-08-05 10:16:36,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 249. [2019-08-05 10:16:36,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-08-05 10:16:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 285 transitions. [2019-08-05 10:16:36,452 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 285 transitions. Word has length 86 [2019-08-05 10:16:36,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:36,452 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 285 transitions. [2019-08-05 10:16:36,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:16:36,453 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 285 transitions. [2019-08-05 10:16:36,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:16:36,454 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:36,454 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 10, 8, 6, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:36,454 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:36,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:36,455 INFO L82 PathProgramCache]: Analyzing trace with hash 909418205, now seen corresponding path program 3 times [2019-08-05 10:16:36,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:36,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:16:36,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:36,989 WARN L188 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2019-08-05 10:16:37,185 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-08-05 10:16:37,247 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 294 proven. 48 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 10:16:37,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:37,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:16:37,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:16:37,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:16:37,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:16:37,249 INFO L87 Difference]: Start difference. First operand 249 states and 285 transitions. Second operand 6 states. [2019-08-05 10:16:37,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:37,649 INFO L93 Difference]: Finished difference Result 285 states and 321 transitions. [2019-08-05 10:16:37,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:16:37,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-08-05 10:16:37,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:37,653 INFO L225 Difference]: With dead ends: 285 [2019-08-05 10:16:37,653 INFO L226 Difference]: Without dead ends: 285 [2019-08-05 10:16:37,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:16:37,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-08-05 10:16:37,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 279. [2019-08-05 10:16:37,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-08-05 10:16:37,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 315 transitions. [2019-08-05 10:16:37,661 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 315 transitions. Word has length 96 [2019-08-05 10:16:37,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:37,661 INFO L475 AbstractCegarLoop]: Abstraction has 279 states and 315 transitions. [2019-08-05 10:16:37,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:16:37,662 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 315 transitions. [2019-08-05 10:16:37,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:16:37,679 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:16:37,679 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 11, 9, 7, 5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:16:37,679 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:16:37,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:16:37,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1395782169, now seen corresponding path program 4 times [2019-08-05 10:16:37,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:16:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:16:37,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:16:37,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:16:37,958 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2019-08-05 10:16:38,252 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-08-05 10:16:38,319 INFO L134 CoverageAnalysis]: Checked inductivity of 533 backedges. 350 proven. 84 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-08-05 10:16:38,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:16:38,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:16:38,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:16:38,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:16:38,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:16:38,320 INFO L87 Difference]: Start difference. First operand 279 states and 315 transitions. Second operand 7 states. [2019-08-05 10:16:39,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:16:39,034 INFO L93 Difference]: Finished difference Result 189 states and 199 transitions. [2019-08-05 10:16:39,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:16:39,034 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2019-08-05 10:16:39,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:16:39,035 INFO L225 Difference]: With dead ends: 189 [2019-08-05 10:16:39,035 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:16:39,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:16:39,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:16:39,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:16:39,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:16:39,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:16:39,037 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2019-08-05 10:16:39,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:16:39,038 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:16:39,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:16:39,038 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:16:39,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:16:39,044 INFO L202 PluginConnector]: Adding new model s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:16:39 BoogieIcfgContainer [2019-08-05 10:16:39,047 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:16:39,048 INFO L168 Benchmark]: Toolchain (without parser) took 9186.87 ms. Allocated memory was 133.2 MB in the beginning and 234.9 MB in the end (delta: 101.7 MB). Free memory was 108.0 MB in the beginning and 81.7 MB in the end (delta: 26.3 MB). Peak memory consumption was 128.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:39,049 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 133.2 MB. Free memory is still 110.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:16:39,050 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.09 ms. Allocated memory is still 133.2 MB. Free memory was 108.0 MB in the beginning and 106.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:39,051 INFO L168 Benchmark]: Boogie Preprocessor took 63.42 ms. Allocated memory is still 133.2 MB. Free memory was 106.2 MB in the beginning and 104.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:39,052 INFO L168 Benchmark]: RCFGBuilder took 1080.63 ms. Allocated memory is still 133.2 MB. Free memory was 104.5 MB in the beginning and 63.9 MB in the end (delta: 40.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:39,053 INFO L168 Benchmark]: TraceAbstraction took 7986.80 ms. Allocated memory was 133.2 MB in the beginning and 234.9 MB in the end (delta: 101.7 MB). Free memory was 63.9 MB in the beginning and 81.7 MB in the end (delta: -17.8 MB). Peak memory consumption was 83.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:16:39,056 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.20 ms. Allocated memory is still 133.2 MB. Free memory is still 110.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 51.09 ms. Allocated memory is still 133.2 MB. Free memory was 108.0 MB in the beginning and 106.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 63.42 ms. Allocated memory is still 133.2 MB. Free memory was 106.2 MB in the beginning and 104.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1080.63 ms. Allocated memory is still 133.2 MB. Free memory was 104.5 MB in the beginning and 63.9 MB in the end (delta: 40.6 MB). Peak memory consumption was 40.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7986.80 ms. Allocated memory was 133.2 MB in the beginning and 234.9 MB in the end (delta: 101.7 MB). Free memory was 63.9 MB in the beginning and 81.7 MB in the end (delta: -17.8 MB). Peak memory consumption was 83.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 459]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. SAFE Result, 7.9s OverallTime, 16 OverallIterations, 14 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 309 SDtfs, 83 SDslu, 245 SDs, 0 SdLazy, 1058 SolverSat, 91 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 836 GetRequests, 806 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=279occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 66 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 852 NumberOfCodeBlocks, 852 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 836 ConstructedInterpolants, 0 QuantifiedInterpolants, 296714 SizeOfPredicates, 62 NumberOfNonLiveVariables, 4659 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 16 InterpolantComputations, 11 PerfectInterpolantSequences, 2670/2888 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...