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/unclassified/EasyArray.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:15:24,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:15:24,779 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:15:24,790 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:15:24,790 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:15:24,791 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:15:24,793 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:15:24,794 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:15:24,796 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:15:24,797 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:15:24,798 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:15:24,798 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:15:24,799 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:15:24,800 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:15:24,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:15:24,802 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:15:24,803 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:15:24,804 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:15:24,805 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:15:24,807 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:15:24,809 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:15:24,810 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:15:24,811 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:15:24,812 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:15:24,815 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:15:24,815 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:15:24,815 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:15:24,816 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:15:24,817 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:15:24,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:15:24,818 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:15:24,819 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:15:24,820 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:15:24,820 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:15:24,822 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:15:24,822 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:15:24,823 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:15:24,823 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:15:24,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:15:24,824 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:15:24,825 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:15:24,860 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:15:24,871 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:15:24,874 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:15:24,876 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:15:24,876 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:15:24,877 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/EasyArray.bpl [2019-08-05 11:15:24,877 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/unclassified/EasyArray.bpl' [2019-08-05 11:15:24,906 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:15:24,908 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:15:24,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:15:24,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:15:24,909 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:15:24,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "EasyArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:24" (1/1) ... [2019-08-05 11:15:24,934 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "EasyArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:24" (1/1) ... [2019-08-05 11:15:24,939 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:15:24,940 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:15:24,940 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:15:24,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:15:24,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:15:24,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:15:24,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:15:24,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "EasyArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:24" (1/1) ... [2019-08-05 11:15:24,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "EasyArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:24" (1/1) ... [2019-08-05 11:15:24,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "EasyArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:24" (1/1) ... [2019-08-05 11:15:24,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "EasyArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:24" (1/1) ... [2019-08-05 11:15:24,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "EasyArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:24" (1/1) ... [2019-08-05 11:15:24,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "EasyArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:24" (1/1) ... [2019-08-05 11:15:24,963 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "EasyArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:24" (1/1) ... [2019-08-05 11:15:24,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:15:24,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:15:24,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:15:24,966 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:15:24,966 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "EasyArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:24" (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:15:25,034 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:15:25,035 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:15:25,035 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:15:25,319 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:15:25,320 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:15:25,321 INFO L202 PluginConnector]: Adding new model EasyArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:15:25 BoogieIcfgContainer [2019-08-05 11:15:25,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:15:25,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:15:25,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:15:25,329 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:15:25,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "EasyArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:15:24" (1/2) ... [2019-08-05 11:15:25,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb959ee and model type EasyArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:15:25, skipping insertion in model container [2019-08-05 11:15:25,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "EasyArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:15:25" (2/2) ... [2019-08-05 11:15:25,332 INFO L109 eAbstractionObserver]: Analyzing ICFG EasyArray.bpl [2019-08-05 11:15:25,343 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:15:25,352 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:15:25,369 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:15:25,403 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:15:25,404 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:15:25,404 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:15:25,404 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:15:25,405 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:15:25,405 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:15:25,405 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:15:25,405 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:15:25,406 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:15:25,420 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 11:15:25,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:15:25,428 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:25,429 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:15:25,431 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:25,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:25,437 INFO L82 PathProgramCache]: Analyzing trace with hash 929608, now seen corresponding path program 1 times [2019-08-05 11:15:25,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:25,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:15:25,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:25,566 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:15:25,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:15:25,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:15:25,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:15:25,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:15:25,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:15:25,588 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-08-05 11:15:25,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:25,732 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-08-05 11:15:25,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:15:25,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 11:15:25,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:25,749 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:15:25,750 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:15:25,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:15:25,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:15:25,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 6. [2019-08-05 11:15:25,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:15:25,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-08-05 11:15:25,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 4 [2019-08-05 11:15:25,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:25,786 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-08-05 11:15:25,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:15:25,786 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-08-05 11:15:25,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:15:25,787 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:25,787 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 11:15:25,787 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:25,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:25,788 INFO L82 PathProgramCache]: Analyzing trace with hash 28754402, now seen corresponding path program 1 times [2019-08-05 11:15:25,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:25,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:15:25,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:25,922 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:15:25,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:25,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:15:25,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:15:25,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:15:25,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:15:25,926 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-08-05 11:15:26,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:26,020 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-08-05 11:15:26,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:15:26,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:15:26,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:26,021 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:15:26,022 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:15:26,023 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:15:26,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:15:26,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 7. [2019-08-05 11:15:26,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:15:26,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-08-05 11:15:26,026 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-08-05 11:15:26,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:26,027 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-08-05 11:15:26,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:15:26,027 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-08-05 11:15:26,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:15:26,028 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:26,028 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 11:15:26,028 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:26,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:26,029 INFO L82 PathProgramCache]: Analyzing trace with hash 891323016, now seen corresponding path program 2 times [2019-08-05 11:15:26,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:26,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:15:26,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:26,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:26,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:26,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:15:26,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:15:26,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:15:26,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:15:26,109 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2019-08-05 11:15:26,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:26,194 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-08-05 11:15:26,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:15:26,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 11:15:26,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:26,197 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:15:26,197 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:15:26,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:15:26,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:15:26,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 8. [2019-08-05 11:15:26,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:15:26,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-08-05 11:15:26,200 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2019-08-05 11:15:26,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:26,201 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-08-05 11:15:26,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:15:26,201 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-08-05 11:15:26,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:15:26,202 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:26,213 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2019-08-05 11:15:26,215 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:26,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:26,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1861146274, now seen corresponding path program 3 times [2019-08-05 11:15:26,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:26,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:15:26,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:26,381 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:26,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:26,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:15:26,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:15:26,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:15:26,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:15:26,384 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 6 states. [2019-08-05 11:15:26,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:26,581 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-08-05 11:15:26,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:15:26,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-08-05 11:15:26,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:26,583 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:15:26,583 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:15:26,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:15:26,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:15:26,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 9. [2019-08-05 11:15:26,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:15:26,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 11:15:26,586 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2019-08-05 11:15:26,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:26,586 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 11:15:26,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:15:26,587 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 11:15:26,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:15:26,587 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:26,587 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2019-08-05 11:15:26,588 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:26,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:26,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1860896200, now seen corresponding path program 4 times [2019-08-05 11:15:26,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:26,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:15:26,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:26,783 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:26,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:26,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:15:26,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:15:26,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:15:26,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:15:26,785 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 7 states. [2019-08-05 11:15:26,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:26,857 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-08-05 11:15:26,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:15:26,858 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-08-05 11:15:26,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:26,859 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:15:26,859 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:15:26,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:15:26,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:15:26,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 10. [2019-08-05 11:15:26,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:15:26,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-08-05 11:15:26,863 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2019-08-05 11:15:26,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:26,864 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-08-05 11:15:26,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:15:26,864 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2019-08-05 11:15:26,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:15:26,864 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:26,864 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2019-08-05 11:15:26,865 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:26,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:26,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1853143906, now seen corresponding path program 5 times [2019-08-05 11:15:26,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:26,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:15:26,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:27,088 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:27,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:27,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:15:27,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:15:27,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:15:27,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:15:27,090 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 8 states. [2019-08-05 11:15:27,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:27,170 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-08-05 11:15:27,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:15:27,170 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-08-05 11:15:27,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:27,172 INFO L225 Difference]: With dead ends: 29 [2019-08-05 11:15:27,172 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 11:15:27,173 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:15:27,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 11:15:27,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 11. [2019-08-05 11:15:27,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:15:27,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 11:15:27,177 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2019-08-05 11:15:27,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:27,178 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 11:15:27,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:15:27,178 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 11:15:27,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:15:27,178 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:27,179 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2019-08-05 11:15:27,179 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:27,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:27,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1612822792, now seen corresponding path program 6 times [2019-08-05 11:15:27,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:27,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:15:27,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:27,281 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:27,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:27,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:15:27,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:15:27,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:15:27,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:15:27,283 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 9 states. [2019-08-05 11:15:27,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:27,649 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-08-05 11:15:27,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:15:27,653 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-08-05 11:15:27,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:27,654 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:15:27,654 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:15:27,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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:15:27,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:15:27,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 12. [2019-08-05 11:15:27,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:15:27,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-08-05 11:15:27,657 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-08-05 11:15:27,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:27,658 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-08-05 11:15:27,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:15:27,658 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-08-05 11:15:27,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:15:27,658 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:27,658 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2019-08-05 11:15:27,659 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:27,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:27,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1542164446, now seen corresponding path program 7 times [2019-08-05 11:15:27,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:27,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:15:27,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:27,798 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:27,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:27,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:15:27,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:15:27,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:15:27,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:15:27,799 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 10 states. [2019-08-05 11:15:28,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:28,017 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-08-05 11:15:28,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:15:28,017 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2019-08-05 11:15:28,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:28,018 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:15:28,018 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:15:28,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:15:28,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:15:28,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 13. [2019-08-05 11:15:28,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:15:28,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 11:15:28,022 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2019-08-05 11:15:28,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:28,022 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 11:15:28,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:15:28,023 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 11:15:28,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:15:28,023 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:28,024 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2019-08-05 11:15:28,024 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:28,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:28,025 INFO L82 PathProgramCache]: Analyzing trace with hash -562521016, now seen corresponding path program 8 times [2019-08-05 11:15:28,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:28,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:15:28,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:28,357 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:15:28,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:28,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:15:28,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:15:28,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:15:28,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:15:28,359 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 11 states. [2019-08-05 11:15:28,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:28,520 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-08-05 11:15:28,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:15:28,524 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2019-08-05 11:15:28,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:28,525 INFO L225 Difference]: With dead ends: 41 [2019-08-05 11:15:28,525 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 11:15:28,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:15:28,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 11:15:28,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 14. [2019-08-05 11:15:28,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:15:28,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-08-05 11:15:28,529 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2019-08-05 11:15:28,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:28,530 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-08-05 11:15:28,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:15:28,530 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-08-05 11:15:28,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:15:28,531 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:28,531 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1] [2019-08-05 11:15:28,531 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:28,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:28,531 INFO L82 PathProgramCache]: Analyzing trace with hash -258345758, now seen corresponding path program 9 times [2019-08-05 11:15:28,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:28,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:15:28,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:28,717 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:28,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:28,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:15:28,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:15:28,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:15:28,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:15:28,719 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 12 states. [2019-08-05 11:15:28,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:28,889 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-08-05 11:15:28,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:15:28,889 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2019-08-05 11:15:28,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:28,890 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:15:28,890 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:15:28,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:15:28,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:15:28,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 15. [2019-08-05 11:15:28,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:15:28,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-05 11:15:28,894 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2019-08-05 11:15:28,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:28,894 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-05 11:15:28,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:15:28,895 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-05 11:15:28,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:15:28,895 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:28,895 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1] [2019-08-05 11:15:28,895 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:28,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:28,896 INFO L82 PathProgramCache]: Analyzing trace with hash 581152648, now seen corresponding path program 10 times [2019-08-05 11:15:28,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:28,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:15:28,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:29,182 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:29,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:29,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:15:29,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:15:29,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:15:29,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:15:29,184 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 13 states. [2019-08-05 11:15:29,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:29,279 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-08-05 11:15:29,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:15:29,279 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2019-08-05 11:15:29,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:29,280 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:15:29,280 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:15:29,281 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:15:29,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:15:29,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 16. [2019-08-05 11:15:29,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:15:29,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-08-05 11:15:29,284 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2019-08-05 11:15:29,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:29,285 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-08-05 11:15:29,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:15:29,285 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-08-05 11:15:29,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:15:29,286 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:29,286 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1] [2019-08-05 11:15:29,286 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:29,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:29,286 INFO L82 PathProgramCache]: Analyzing trace with hash 835799458, now seen corresponding path program 11 times [2019-08-05 11:15:29,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:29,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:29,329 WARN L254 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:15:29,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:29,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:15:29,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:15:29,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:15:29,407 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:15:29,407 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 11:15:29,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:15:29,453 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:15:29,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:15:29,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:15:29,470 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:15:29,470 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-08-05 11:15:29,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:15:29,554 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:15:29,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 50 [2019-08-05 11:15:29,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:15:29,601 INFO L567 ElimStorePlain]: treesize reduction 28, result has 46.2 percent of original size [2019-08-05 11:15:29,603 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 11:15:29,604 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:24 [2019-08-05 11:15:29,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:15:29,753 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:15:29,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 88 [2019-08-05 11:15:29,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:15:29,985 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 21 [2019-08-05 11:15:29,986 INFO L567 ElimStorePlain]: treesize reduction 42, result has 44.7 percent of original size [2019-08-05 11:15:29,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:15:29,989 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-08-05 11:15:30,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:15:30,106 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:15:30,107 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 88 [2019-08-05 11:15:30,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:15:30,155 INFO L567 ElimStorePlain]: treesize reduction 42, result has 44.7 percent of original size [2019-08-05 11:15:30,158 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:15:30,158 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-08-05 11:15:30,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:15:30,262 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:15:30,263 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 88 [2019-08-05 11:15:30,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:15:30,316 INFO L567 ElimStorePlain]: treesize reduction 42, result has 44.7 percent of original size [2019-08-05 11:15:30,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:15:30,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-08-05 11:15:30,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:15:30,427 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:15:30,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 88 [2019-08-05 11:15:30,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:15:30,486 INFO L567 ElimStorePlain]: treesize reduction 42, result has 44.7 percent of original size [2019-08-05 11:15:30,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:15:30,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-08-05 11:15:30,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:15:30,574 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:15:30,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 88 [2019-08-05 11:15:30,577 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:15:30,619 INFO L567 ElimStorePlain]: treesize reduction 42, result has 44.7 percent of original size [2019-08-05 11:15:30,621 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:15:30,621 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-08-05 11:15:30,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:15:30,833 INFO L235 Elim1Store]: Index analysis took 138 ms [2019-08-05 11:15:30,905 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:15:30,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 88 [2019-08-05 11:15:30,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:15:30,949 INFO L567 ElimStorePlain]: treesize reduction 42, result has 44.7 percent of original size [2019-08-05 11:15:30,950 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:15:30,951 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-08-05 11:15:30,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:15:31,048 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:15:31,049 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 88 [2019-08-05 11:15:31,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:15:31,106 INFO L567 ElimStorePlain]: treesize reduction 42, result has 44.7 percent of original size [2019-08-05 11:15:31,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:15:31,108 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-08-05 11:15:31,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:15:31,226 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:15:31,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 88 [2019-08-05 11:15:31,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:15:31,308 INFO L567 ElimStorePlain]: treesize reduction 42, result has 44.7 percent of original size [2019-08-05 11:15:31,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:15:31,310 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2019-08-05 11:15:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-08-05 11:15:31,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:31,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:15:31,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:15:31,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:15:31,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:15:31,354 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 7 states. [2019-08-05 11:15:31,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:31,434 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-08-05 11:15:31,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:15:31,435 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-08-05 11:15:31,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:31,435 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:15:31,435 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:15:31,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 8 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:15:31,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:15:31,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2019-08-05 11:15:31,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:15:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-08-05 11:15:31,440 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2019-08-05 11:15:31,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:31,440 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-08-05 11:15:31,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:15:31,440 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-08-05 11:15:31,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:15:31,441 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:15:31,441 INFO L399 BasicCegarLoop]: trace histogram [11, 2, 1, 1, 1, 1] [2019-08-05 11:15:31,441 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:15:31,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:15:31,441 INFO L82 PathProgramCache]: Analyzing trace with hash 44396068, now seen corresponding path program 1 times [2019-08-05 11:15:31,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:15:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:15:31,483 WARN L254 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:15:31,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:31,531 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:15:31,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:15:31,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:15:31,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:15:31,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-08-05 11:15:31,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-08-05 11:15:31,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:15:31,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:15:31,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:15:31,560 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-08-05 11:15:31,585 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-08-05 11:15:31,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:15:31,601 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:15:31,602 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:15:31,602 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2019-08-05 11:15:31,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-08-05 11:15:31,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:15:31,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:15:31,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:15:31,633 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:24 [2019-08-05 11:15:31,791 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-08-05 11:15:31,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:15:31,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:15:31,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:15:31,804 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2019-08-05 11:15:31,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-08-05 11:15:31,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:15:31,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:15:31,900 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:15:31,900 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:34 [2019-08-05 11:15:31,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 54 [2019-08-05 11:15:31,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:15:31,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:15:31,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:15:31,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:39 [2019-08-05 11:15:32,055 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 62 [2019-08-05 11:15:32,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:15:32,291 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-08-05 11:15:32,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:15:32,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:15:32,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:44 [2019-08-05 11:15:32,343 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 70 [2019-08-05 11:15:32,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:15:32,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:15:32,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:15:32,365 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:49 [2019-08-05 11:15:32,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 78 [2019-08-05 11:15:32,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:15:32,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:15:32,433 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:15:32,434 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:54 [2019-08-05 11:15:32,564 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:32,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:32,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:15:32,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:15:32,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:15:32,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:15:32,566 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 16 states. [2019-08-05 11:15:32,965 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-08-05 11:15:33,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:15:33,740 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 11:15:33,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:15:33,741 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-08-05 11:15:33,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:15:33,741 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:15:33,742 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:15:33,742 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:15:33,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:15:33,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:15:33,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:15:33,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:15:33,744 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-08-05 11:15:33,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:15:33,744 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:15:33,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:15:33,744 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:15:33,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:15:33,748 INFO L202 PluginConnector]: Adding new model EasyArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:15:33 BoogieIcfgContainer [2019-08-05 11:15:33,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:15:33,750 INFO L168 Benchmark]: Toolchain (without parser) took 8842.46 ms. Allocated memory was 140.5 MB in the beginning and 288.4 MB in the end (delta: 147.8 MB). Free memory was 107.6 MB in the beginning and 252.9 MB in the end (delta: -145.3 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:33,751 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 140.5 MB. Free memory was 108.9 MB in the beginning and 108.7 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:15:33,751 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.88 ms. Allocated memory is still 140.5 MB. Free memory was 107.6 MB in the beginning and 105.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:33,752 INFO L168 Benchmark]: Boogie Preprocessor took 21.97 ms. Allocated memory is still 140.5 MB. Free memory was 105.7 MB in the beginning and 104.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:33,753 INFO L168 Benchmark]: RCFGBuilder took 356.35 ms. Allocated memory is still 140.5 MB. Free memory was 104.6 MB in the beginning and 95.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:15:33,754 INFO L168 Benchmark]: TraceAbstraction took 8425.67 ms. Allocated memory was 140.5 MB in the beginning and 288.4 MB in the end (delta: 147.8 MB). Free memory was 95.0 MB in the beginning and 252.9 MB in the end (delta: -158.0 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:15:33,757 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.23 ms. Allocated memory is still 140.5 MB. Free memory was 108.9 MB in the beginning and 108.7 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 33.88 ms. Allocated memory is still 140.5 MB. Free memory was 107.6 MB in the beginning and 105.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.97 ms. Allocated memory is still 140.5 MB. Free memory was 105.7 MB in the beginning and 104.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 356.35 ms. Allocated memory is still 140.5 MB. Free memory was 104.6 MB in the beginning and 95.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8425.67 ms. Allocated memory was 140.5 MB in the beginning and 288.4 MB in the end (delta: 147.8 MB). Free memory was 95.0 MB in the beginning and 252.9 MB in the end (delta: -158.0 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 23]: 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, 6 locations, 1 error locations. SAFE Result, 8.3s OverallTime, 13 OverallIterations, 11 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 25 SDtfs, 239 SDslu, 1 SDs, 0 SdLazy, 732 SolverSat, 169 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 25 SyntacticMatches, 8 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred 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, 194 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 118 ConstructedInterpolants, 12 QuantifiedInterpolants, 15134 SizeOfPredicates, 0 NumberOfNonLiveVariables, 430 ConjunctsInSsa, 143 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 45/354 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...