java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/abstractInterpretation/regression/non_con/proc-procedure-without-impl.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:13:58,773 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:13:58,775 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:13:58,787 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:13:58,788 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:13:58,789 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:13:58,790 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:13:58,792 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:13:58,794 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:13:58,795 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:13:58,796 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:13:58,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:13:58,796 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:13:58,797 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:13:58,798 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:13:58,800 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:13:58,800 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:13:58,801 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:13:58,803 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:13:58,806 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:13:58,807 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:13:58,809 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:13:58,810 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:13:58,811 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:13:58,813 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:13:58,814 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:13:58,814 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:13:58,815 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:13:58,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:13:58,817 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:13:58,817 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:13:58,818 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:13:58,819 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:13:58,819 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:13:58,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:13:58,821 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:13:58,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:13:58,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:13:58,822 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:13:58,823 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:13:58,824 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:13:58,852 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:13:58,864 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:13:58,868 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:13:58,869 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:13:58,870 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:13:58,871 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/non_con/proc-procedure-without-impl.bpl [2019-08-05 11:13:58,871 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/non_con/proc-procedure-without-impl.bpl' [2019-08-05 11:13:58,904 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:13:58,905 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:13:58,906 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:13:58,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:13:58,906 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:13:58,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "proc-procedure-without-impl.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:58" (1/1) ... [2019-08-05 11:13:58,930 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "proc-procedure-without-impl.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:58" (1/1) ... [2019-08-05 11:13:58,938 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:13:58,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:13:58,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:13:58,939 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:13:58,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "proc-procedure-without-impl.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:58" (1/1) ... [2019-08-05 11:13:58,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "proc-procedure-without-impl.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:58" (1/1) ... [2019-08-05 11:13:58,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "proc-procedure-without-impl.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:58" (1/1) ... [2019-08-05 11:13:58,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "proc-procedure-without-impl.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:58" (1/1) ... [2019-08-05 11:13:58,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "proc-procedure-without-impl.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:58" (1/1) ... [2019-08-05 11:13:58,958 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "proc-procedure-without-impl.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:58" (1/1) ... [2019-08-05 11:13:58,958 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "proc-procedure-without-impl.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:58" (1/1) ... [2019-08-05 11:13:58,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:13:58,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:13:58,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:13:58,960 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:13:58,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "proc-procedure-without-impl.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:13:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure inc_without_impl [2019-08-05 11:13:59,028 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:13:59,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:13:59,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:13:59,305 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:13:59,305 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:13:59,306 INFO L202 PluginConnector]: Adding new model proc-procedure-without-impl.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:13:59 BoogieIcfgContainer [2019-08-05 11:13:59,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:13:59,308 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:13:59,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:13:59,312 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:13:59,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "proc-procedure-without-impl.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:13:58" (1/2) ... [2019-08-05 11:13:59,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f044a87 and model type proc-procedure-without-impl.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:13:59, skipping insertion in model container [2019-08-05 11:13:59,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "proc-procedure-without-impl.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:13:59" (2/2) ... [2019-08-05 11:13:59,316 INFO L109 eAbstractionObserver]: Analyzing ICFG proc-procedure-without-impl.bpl [2019-08-05 11:13:59,325 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:13:59,333 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-08-05 11:13:59,351 INFO L252 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-08-05 11:13:59,380 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:13:59,381 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:13:59,381 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:13:59,381 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:13:59,381 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:13:59,381 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:13:59,381 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:13:59,382 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:13:59,382 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:13:59,395 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-05 11:13:59,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:13:59,403 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:59,404 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:13:59,406 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:13:59,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:59,411 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2019-08-05 11:13:59,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:59,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:13:59,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:59,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:59,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:13:59,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:13:59,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:13:59,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:13:59,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:13:59,561 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-08-05 11:13:59,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:59,668 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 11:13:59,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:13:59,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:13:59,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:59,696 INFO L225 Difference]: With dead ends: 6 [2019-08-05 11:13:59,696 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 11:13:59,701 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:13:59,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 11:13:59,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 11:13:59,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 11:13:59,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 11:13:59,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 11:13:59,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:59,761 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 11:13:59,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:13:59,762 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 11:13:59,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:13:59,762 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:59,762 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:13:59,763 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:13:59,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:59,764 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2019-08-05 11:13:59,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:59,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:13:59,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:59,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:59,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:13:59,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:13:59,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:13:59,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:13:59,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:13:59,820 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 3 states. [2019-08-05 11:13:59,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:59,849 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 11:13:59,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:13:59,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:13:59,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:59,851 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:13:59,851 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:13:59,852 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:13:59,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:13:59,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-08-05 11:13:59,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:13:59,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 11:13:59,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2019-08-05 11:13:59,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:59,855 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 11:13:59,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:13:59,856 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 11:13:59,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:13:59,856 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:59,856 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:13:59,857 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:13:59,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:59,857 INFO L82 PathProgramCache]: Analyzing trace with hash 28753377, now seen corresponding path program 1 times [2019-08-05 11:13:59,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:59,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:13:59,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:59,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:59,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:59,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:13:59,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:13:59,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:13:59,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:13:59,940 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 4 states. [2019-08-05 11:14:00,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:00,021 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 11:14:00,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:14:00,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:14:00,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:00,024 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:14:00,024 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:14:00,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:14:00,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:14:00,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-08-05 11:14:00,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:14:00,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:14:00,028 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-08-05 11:14:00,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:00,028 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:14:00,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:14:00,029 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:14:00,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:14:00,029 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:00,029 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2019-08-05 11:14:00,030 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:14:00,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:00,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1862068770, now seen corresponding path program 2 times [2019-08-05 11:14:00,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:00,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:14:00,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:00,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:00,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:00,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:14:00,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:14:00,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:14:00,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:14:00,113 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 5 states. [2019-08-05 11:14:00,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:00,149 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:14:00,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:14:00,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 11:14:00,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:00,150 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:14:00,150 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:14:00,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:14:00,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:14:00,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-08-05 11:14:00,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:14:00,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 11:14:00,154 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-08-05 11:14:00,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:00,155 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 11:14:00,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:14:00,155 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 11:14:00,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:14:00,156 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:00,156 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2019-08-05 11:14:00,156 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:14:00,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:00,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1553397213, now seen corresponding path program 3 times [2019-08-05 11:14:00,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:00,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:14:00,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:00,281 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:00,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:00,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:14:00,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:14:00,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:14:00,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:14:00,283 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 6 states. [2019-08-05 11:14:00,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:00,342 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 11:14:00,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:14:00,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-08-05 11:14:00,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:00,344 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:14:00,344 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:14:00,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:14:00,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:14:00,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-08-05 11:14:00,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:14:00,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 11:14:00,347 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-08-05 11:14:00,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:00,347 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 11:14:00,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:14:00,348 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 11:14:00,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:14:00,348 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:00,348 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2019-08-05 11:14:00,349 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:14:00,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:00,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1833774564, now seen corresponding path program 4 times [2019-08-05 11:14:00,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:00,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:14:00,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:00,665 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:00,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:00,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:14:00,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:14:00,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:14:00,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:00,667 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 7 states. [2019-08-05 11:14:00,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:00,728 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 11:14:00,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:14:00,729 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-08-05 11:14:00,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:00,729 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:14:00,729 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:14:00,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:14:00,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:14:00,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-08-05 11:14:00,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:14:00,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 11:14:00,732 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-08-05 11:14:00,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:00,733 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 11:14:00,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:14:00,733 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 11:14:00,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:14:00,733 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:00,734 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1] [2019-08-05 11:14:00,734 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:14:00,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:00,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1320641893, now seen corresponding path program 5 times [2019-08-05 11:14:00,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:00,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:14:00,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:00,961 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:00,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:00,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:14:00,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:14:00,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:14:00,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:00,965 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 8 states. [2019-08-05 11:14:01,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:01,087 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 11:14:01,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:14:01,088 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-08-05 11:14:01,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:01,088 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:14:01,089 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:14:01,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:14:01,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:14:01,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-08-05 11:14:01,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:14:01,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 11:14:01,093 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-08-05 11:14:01,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:01,094 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 11:14:01,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:14:01,094 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 11:14:01,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:14:01,094 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:01,095 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1] [2019-08-05 11:14:01,095 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:14:01,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:01,095 INFO L82 PathProgramCache]: Analyzing trace with hash 2121384102, now seen corresponding path program 6 times [2019-08-05 11:14:01,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:01,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:14:01,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:01,209 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:01,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:01,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:14:01,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:14:01,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:14:01,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:01,216 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-08-05 11:14:01,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:01,281 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 11:14:01,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:14:01,281 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-08-05 11:14:01,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:01,282 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:14:01,282 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:14:01,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:14:01,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:14:01,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-08-05 11:14:01,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:14:01,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 11:14:01,286 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-08-05 11:14:01,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:01,286 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 11:14:01,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:14:01,286 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 11:14:01,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:14:01,287 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:01,287 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1] [2019-08-05 11:14:01,288 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:14:01,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:01,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1459466329, now seen corresponding path program 7 times [2019-08-05 11:14:01,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:01,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:14:01,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:01,687 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:01,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:01,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:14:01,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:14:01,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:14:01,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:14:01,689 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 10 states. [2019-08-05 11:14:01,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:01,756 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 11:14:01,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:14:01,757 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-08-05 11:14:01,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:01,758 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:14:01,759 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:14:01,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:14:01,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:14:01,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-08-05 11:14:01,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:14:01,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 11:14:01,763 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-08-05 11:14:01,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:01,763 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 11:14:01,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:14:01,763 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 11:14:01,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:14:01,764 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:01,764 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1] [2019-08-05 11:14:01,764 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:14:01,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:01,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1907040872, now seen corresponding path program 8 times [2019-08-05 11:14:01,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:01,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:14:01,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:01,933 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:01,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:01,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:14:01,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:14:01,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:14:01,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:14:01,935 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 11 states. [2019-08-05 11:14:02,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:02,043 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 11:14:02,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:14:02,043 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-08-05 11:14:02,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:02,044 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:14:02,045 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:14:02,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:14:02,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:14:02,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-08-05 11:14:02,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:14:02,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 11:14:02,049 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2019-08-05 11:14:02,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:02,049 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 11:14:02,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:14:02,050 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 11:14:02,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:14:02,050 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:02,051 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1] [2019-08-05 11:14:02,051 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:14:02,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:02,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1284880151, now seen corresponding path program 9 times [2019-08-05 11:14:02,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:02,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:14:02,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:02,317 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:02,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:02,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:14:02,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:14:02,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:14:02,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:14:02,319 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2019-08-05 11:14:02,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:02,416 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 11:14:02,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:14:02,417 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-08-05 11:14:02,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:02,417 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:14:02,418 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:14:02,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:14:02,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:14:02,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 11:14:02,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:14:02,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 11:14:02,421 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2019-08-05 11:14:02,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:02,421 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 11:14:02,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:14:02,421 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 11:14:02,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:14:02,422 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:02,422 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1] [2019-08-05 11:14:02,422 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:14:02,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:02,423 INFO L82 PathProgramCache]: Analyzing trace with hash -2114333910, now seen corresponding path program 10 times [2019-08-05 11:14:02,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:02,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:14:02,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:02,808 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:02,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:02,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:14:02,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:14:02,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:14:02,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:14:02,810 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 14 states. [2019-08-05 11:14:02,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:02,893 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 11:14:02,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:14:02,894 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-08-05 11:14:02,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:02,894 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:14:02,895 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:14:02,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:14:02,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:14:02,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-08-05 11:14:02,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:14:02,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 11:14:02,899 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2019-08-05 11:14:02,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:02,899 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 11:14:02,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:14:02,900 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 11:14:02,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:14:02,900 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:02,901 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1] [2019-08-05 11:14:02,901 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION]=== [2019-08-05 11:14:02,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:02,901 INFO L82 PathProgramCache]: Analyzing trace with hash -355479253, now seen corresponding path program 11 times [2019-08-05 11:14:02,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:02,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:14:02,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:03,054 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:03,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:14:03,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-08-05 11:14:03,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:14:03,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:14:03,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:14:03,056 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 13 states. [2019-08-05 11:14:03,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:03,177 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2019-08-05 11:14:03,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:14:03,177 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-08-05 11:14:03,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:03,178 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:14:03,178 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:14:03,178 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:14:03,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:14:03,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:14:03,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:14:03,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:14:03,179 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-08-05 11:14:03,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:03,180 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:14:03,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:14:03,180 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:14:03,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:14:03,186 INFO L202 PluginConnector]: Adding new model proc-procedure-without-impl.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:14:03 BoogieIcfgContainer [2019-08-05 11:14:03,186 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:14:03,190 INFO L168 Benchmark]: Toolchain (without parser) took 4282.68 ms. Allocated memory was 135.3 MB in the beginning and 198.2 MB in the end (delta: 62.9 MB). Free memory was 112.8 MB in the beginning and 117.0 MB in the end (delta: -4.2 MB). Peak memory consumption was 58.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:03,191 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 135.3 MB. Free memory was 114.0 MB in the beginning and 113.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:14:03,192 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.25 ms. Allocated memory is still 135.3 MB. Free memory was 112.8 MB in the beginning and 110.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:03,193 INFO L168 Benchmark]: Boogie Preprocessor took 20.94 ms. Allocated memory is still 135.3 MB. Free memory was 110.9 MB in the beginning and 109.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:03,194 INFO L168 Benchmark]: RCFGBuilder took 346.80 ms. Allocated memory is still 135.3 MB. Free memory was 109.8 MB in the beginning and 100.8 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:03,195 INFO L168 Benchmark]: TraceAbstraction took 3878.15 ms. Allocated memory was 135.3 MB in the beginning and 198.2 MB in the end (delta: 62.9 MB). Free memory was 100.6 MB in the beginning and 117.0 MB in the end (delta: -16.4 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:14:03,199 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 135.3 MB. Free memory was 114.0 MB in the beginning and 113.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 32.25 ms. Allocated memory is still 135.3 MB. Free memory was 112.8 MB in the beginning and 110.9 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.94 ms. Allocated memory is still 135.3 MB. Free memory was 110.9 MB in the beginning and 109.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 346.80 ms. Allocated memory is still 135.3 MB. Free memory was 109.8 MB in the beginning and 100.8 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3878.15 ms. Allocated memory was 135.3 MB in the beginning and 198.2 MB in the end (delta: 62.9 MB). Free memory was 100.6 MB in the beginning and 117.0 MB in the end (delta: -16.4 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 10]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 2 error locations. SAFE Result, 3.8s OverallTime, 13 OverallIterations, 11 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 34 SDtfs, 70 SDslu, 0 SDs, 0 SdLazy, 270 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 10 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 171 NumberOfCodeBlocks, 171 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 10330 SizeOfPredicates, 11 NumberOfNonLiveVariables, 368 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 121/506 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...