java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/count_by_k.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:24:04,115 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:24:04,117 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:24:04,130 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:24:04,131 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:24:04,132 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:24:04,133 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:24:04,135 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:24:04,137 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:24:04,138 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:24:04,139 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:24:04,139 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:24:04,140 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:24:04,141 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:24:04,142 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:24:04,143 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:24:04,144 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:24:04,146 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:24:04,148 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:24:04,150 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:24:04,151 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:24:04,152 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:24:04,155 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:24:04,155 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:24:04,155 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:24:04,156 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:24:04,157 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:24:04,158 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:24:04,159 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:24:04,160 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:24:04,160 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:24:04,161 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:24:04,162 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:24:04,162 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:24:04,163 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:24:04,164 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:24:04,164 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 13:24:04,172 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:24:04,173 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:24:04,174 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:24:04,174 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:24:04,174 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:24:04,175 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:24:04,175 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:24:04,175 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:24:04,220 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:24:04,242 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:24:04,247 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:24:04,249 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:24:04,250 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:24:04,251 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/count_by_k.i_3.bpl [2018-07-25 13:24:04,251 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/count_by_k.i_3.bpl' [2018-07-25 13:24:04,309 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:24:04,311 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:24:04,312 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:24:04,312 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:24:04,312 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:24:04,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:04" (1/1) ... [2018-07-25 13:24:04,345 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:04" (1/1) ... [2018-07-25 13:24:04,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:24:04,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:24:04,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:24:04,353 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:24:04,365 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:04" (1/1) ... [2018-07-25 13:24:04,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:04" (1/1) ... [2018-07-25 13:24:04,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:04" (1/1) ... [2018-07-25 13:24:04,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:04" (1/1) ... [2018-07-25 13:24:04,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:04" (1/1) ... [2018-07-25 13:24:04,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:04" (1/1) ... [2018-07-25 13:24:04,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:04" (1/1) ... [2018-07-25 13:24:04,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:24:04,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:24:04,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:24:04,374 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:24:04,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:04" (1/1) ... [2018-07-25 13:24:04,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 13:24:04,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 13:24:04,608 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 13:24:04,609 INFO L202 PluginConnector]: Adding new model count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:24:04 BoogieIcfgContainer [2018-07-25 13:24:04,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:24:04,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:24:04,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:24:04,614 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:24:04,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:24:04" (1/2) ... [2018-07-25 13:24:04,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f9bd9 and model type count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:24:04, skipping insertion in model container [2018-07-25 13:24:04,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:24:04" (2/2) ... [2018-07-25 13:24:04,618 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_k.i_3.bpl [2018-07-25 13:24:04,629 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:24:04,638 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:24:04,683 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:24:04,683 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:24:04,684 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:24:04,684 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:24:04,684 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:24:04,684 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:24:04,685 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:24:04,685 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:24:04,685 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:24:04,698 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-25 13:24:04,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 13:24:04,707 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:04,708 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 13:24:04,709 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:04,714 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-07-25 13:24:04,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:04,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:04,813 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:24:04,814 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:24:04,819 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:24:04,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:24:04,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:24:04,838 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-07-25 13:24:04,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:04,867 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-07-25 13:24:04,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:24:04,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-07-25 13:24:04,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:04,879 INFO L225 Difference]: With dead ends: 10 [2018-07-25 13:24:04,880 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 13:24:04,886 INFO L574 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 [2018-07-25 13:24:04,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 13:24:04,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 13:24:04,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 13:24:04,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 13:24:04,928 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-25 13:24:04,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:04,929 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 13:24:04,929 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:24:04,929 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 13:24:04,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:24:04,930 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:04,930 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-25 13:24:04,931 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:04,932 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-07-25 13:24:04,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:04,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:04,971 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:04,971 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 13:24:04,973 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:24:04,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:24:04,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:24:04,974 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-07-25 13:24:04,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:04,996 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 13:24:04,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:24:04,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-07-25 13:24:04,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:04,998 INFO L225 Difference]: With dead ends: 11 [2018-07-25 13:24:04,998 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 13:24:05,000 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:24:05,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 13:24:05,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 13:24:05,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 13:24:05,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 13:24:05,004 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-25 13:24:05,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:05,005 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 13:24:05,005 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:24:05,005 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 13:24:05,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:24:05,005 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:05,006 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-25 13:24:05,006 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:05,006 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-07-25 13:24:05,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:05,057 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:05,057 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:24:05,058 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:24:05,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:24:05,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:24:05,059 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-07-25 13:24:05,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:05,101 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 13:24:05,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:24:05,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-07-25 13:24:05,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:05,103 INFO L225 Difference]: With dead ends: 13 [2018-07-25 13:24:05,103 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 13:24:05,104 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:24:05,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 13:24:05,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 13:24:05,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 13:24:05,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 13:24:05,109 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-25 13:24:05,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:05,109 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 13:24:05,110 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:24:05,110 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 13:24:05,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:24:05,111 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:05,111 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-25 13:24:05,111 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:05,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-07-25 13:24:05,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:05,179 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:05,180 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:05,180 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:24:05,181 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:24:05,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:24:05,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:24:05,182 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-07-25 13:24:05,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:05,279 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 13:24:05,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:24:05,280 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-07-25 13:24:05,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:05,283 INFO L225 Difference]: With dead ends: 15 [2018-07-25 13:24:05,283 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 13:24:05,284 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:24:05,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 13:24:05,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 13:24:05,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 13:24:05,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 13:24:05,292 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-07-25 13:24:05,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:05,293 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 13:24:05,293 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:24:05,293 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 13:24:05,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:24:05,294 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:05,294 INFO L354 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-07-25 13:24:05,295 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:05,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-07-25 13:24:05,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:05,361 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:05,362 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:05,362 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:24:05,362 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:24:05,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:24:05,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:24:05,363 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-07-25 13:24:05,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:05,463 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 13:24:05,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:24:05,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-07-25 13:24:05,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:05,464 INFO L225 Difference]: With dead ends: 17 [2018-07-25 13:24:05,464 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 13:24:05,465 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:24:05,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 13:24:05,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 13:24:05,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 13:24:05,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 13:24:05,479 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-07-25 13:24:05,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:05,480 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 13:24:05,480 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:24:05,481 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 13:24:05,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 13:24:05,481 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:05,482 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-25 13:24:05,482 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:05,482 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-07-25 13:24:05,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:05,568 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:05,568 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:05,568 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:24:05,569 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:24:05,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:24:05,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:24:05,570 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-07-25 13:24:05,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:05,632 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-25 13:24:05,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:24:05,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-25 13:24:05,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:05,634 INFO L225 Difference]: With dead ends: 19 [2018-07-25 13:24:05,634 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 13:24:05,635 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:24:05,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 13:24:05,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 13:24:05,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 13:24:05,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-25 13:24:05,641 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-07-25 13:24:05,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:05,642 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-25 13:24:05,642 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:24:05,642 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-25 13:24:05,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:24:05,643 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:05,643 INFO L354 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-07-25 13:24:05,643 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:05,644 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-07-25 13:24:05,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:05,699 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:05,700 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:05,700 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:24:05,700 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:24:05,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:24:05,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:24:05,706 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-07-25 13:24:05,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:05,815 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-25 13:24:05,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:24:05,816 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-25 13:24:05,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:05,817 INFO L225 Difference]: With dead ends: 21 [2018-07-25 13:24:05,817 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 13:24:05,818 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:24:05,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 13:24:05,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 13:24:05,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 13:24:05,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-25 13:24:05,825 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-07-25 13:24:05,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:05,826 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-25 13:24:05,826 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:24:05,826 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-25 13:24:05,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:24:05,827 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:05,827 INFO L354 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-07-25 13:24:05,827 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:05,828 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-07-25 13:24:05,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:05,881 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:05,882 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:05,882 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:24:05,884 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:24:05,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:24:05,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:24:05,886 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-07-25 13:24:05,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:05,980 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-25 13:24:05,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:24:05,980 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-25 13:24:05,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:05,981 INFO L225 Difference]: With dead ends: 23 [2018-07-25 13:24:05,982 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 13:24:05,982 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:24:05,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 13:24:05,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 13:24:05,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 13:24:05,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-25 13:24:05,988 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-07-25 13:24:05,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:05,989 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-25 13:24:05,989 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:24:05,989 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-25 13:24:05,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:24:05,990 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:05,990 INFO L354 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-07-25 13:24:05,991 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:05,991 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-07-25 13:24:05,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:06,053 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:06,053 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:06,054 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:24:06,054 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:24:06,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:24:06,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:24:06,055 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-07-25 13:24:06,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:06,155 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-25 13:24:06,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:24:06,156 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 13:24:06,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:06,157 INFO L225 Difference]: With dead ends: 25 [2018-07-25 13:24:06,157 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 13:24:06,158 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:24:06,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 13:24:06,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 13:24:06,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 13:24:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-25 13:24:06,164 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-07-25 13:24:06,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:06,165 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-25 13:24:06,165 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:24:06,166 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-25 13:24:06,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:24:06,168 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:06,168 INFO L354 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-07-25 13:24:06,169 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:06,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2018-07-25 13:24:06,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:06,225 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:06,226 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:06,226 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:24:06,227 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:24:06,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:24:06,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:24:06,228 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2018-07-25 13:24:06,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:06,349 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-25 13:24:06,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:24:06,349 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-07-25 13:24:06,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:06,350 INFO L225 Difference]: With dead ends: 27 [2018-07-25 13:24:06,350 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 13:24:06,351 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:24:06,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 13:24:06,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 13:24:06,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 13:24:06,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-25 13:24:06,358 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-07-25 13:24:06,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:06,358 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-25 13:24:06,358 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:24:06,359 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-25 13:24:06,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 13:24:06,359 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:06,360 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-07-25 13:24:06,360 INFO L415 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:06,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2018-07-25 13:24:06,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:06,427 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:06,428 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:06,428 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:24:06,429 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:24:06,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:24:06,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:24:06,430 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2018-07-25 13:24:06,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:06,569 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-25 13:24:06,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:24:06,570 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-07-25 13:24:06,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:06,571 INFO L225 Difference]: With dead ends: 29 [2018-07-25 13:24:06,571 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 13:24:06,572 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:24:06,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 13:24:06,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 13:24:06,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 13:24:06,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-25 13:24:06,579 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-07-25 13:24:06,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:06,579 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-25 13:24:06,579 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:24:06,580 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-25 13:24:06,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 13:24:06,580 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:06,581 INFO L354 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-07-25 13:24:06,581 INFO L415 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:06,581 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2018-07-25 13:24:06,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:06,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:06,654 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:06,654 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:06,655 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:24:06,655 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:24:06,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:24:06,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:24:06,656 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-07-25 13:24:06,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:06,821 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-25 13:24:06,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:24:06,821 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-07-25 13:24:06,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:06,822 INFO L225 Difference]: With dead ends: 31 [2018-07-25 13:24:06,822 INFO L226 Difference]: Without dead ends: 29 [2018-07-25 13:24:06,823 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:24:06,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-25 13:24:06,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-25 13:24:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 13:24:06,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-25 13:24:06,830 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-07-25 13:24:06,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:06,831 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-25 13:24:06,831 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:24:06,831 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-25 13:24:06,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 13:24:06,832 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:06,832 INFO L354 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-07-25 13:24:06,832 INFO L415 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:06,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2018-07-25 13:24:06,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:06,914 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:06,915 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:06,915 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:24:06,915 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:24:06,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:24:06,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:24:06,916 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-07-25 13:24:07,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:07,119 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-25 13:24:07,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:24:07,119 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-07-25 13:24:07,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:07,121 INFO L225 Difference]: With dead ends: 33 [2018-07-25 13:24:07,122 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 13:24:07,124 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:24:07,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 13:24:07,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-25 13:24:07,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 13:24:07,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-25 13:24:07,134 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-07-25 13:24:07,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:07,134 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-25 13:24:07,134 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:24:07,135 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-25 13:24:07,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 13:24:07,137 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:07,138 INFO L354 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-07-25 13:24:07,138 INFO L415 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:07,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2018-07-25 13:24:07,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:07,248 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:07,249 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:07,249 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:24:07,254 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:24:07,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:24:07,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:24:07,258 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-07-25 13:24:07,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:07,551 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-25 13:24:07,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:24:07,551 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-07-25 13:24:07,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:07,557 INFO L225 Difference]: With dead ends: 35 [2018-07-25 13:24:07,558 INFO L226 Difference]: Without dead ends: 33 [2018-07-25 13:24:07,559 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:24:07,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-25 13:24:07,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-25 13:24:07,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-25 13:24:07,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-25 13:24:07,571 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-07-25 13:24:07,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:07,571 INFO L472 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-25 13:24:07,572 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:24:07,572 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-25 13:24:07,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-25 13:24:07,573 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:07,573 INFO L354 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-07-25 13:24:07,573 INFO L415 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:07,574 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2018-07-25 13:24:07,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:07,696 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:07,697 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:07,697 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 13:24:07,697 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 13:24:07,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 13:24:07,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:24:07,698 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2018-07-25 13:24:07,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:07,965 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-25 13:24:07,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:24:07,966 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-07-25 13:24:07,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:07,966 INFO L225 Difference]: With dead ends: 37 [2018-07-25 13:24:07,967 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 13:24:07,968 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:24:07,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 13:24:07,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 13:24:07,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 13:24:07,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-25 13:24:07,975 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-07-25 13:24:07,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:07,975 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-25 13:24:07,975 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 13:24:07,976 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-25 13:24:07,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 13:24:07,976 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:07,977 INFO L354 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-07-25 13:24:07,977 INFO L415 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:07,977 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2018-07-25 13:24:07,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:08,095 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:08,095 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:08,096 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 13:24:08,096 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 13:24:08,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 13:24:08,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:24:08,097 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2018-07-25 13:24:08,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:08,406 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-25 13:24:08,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:24:08,407 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-07-25 13:24:08,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:08,407 INFO L225 Difference]: With dead ends: 39 [2018-07-25 13:24:08,407 INFO L226 Difference]: Without dead ends: 37 [2018-07-25 13:24:08,408 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:24:08,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-25 13:24:08,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-25 13:24:08,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 13:24:08,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-25 13:24:08,425 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-07-25 13:24:08,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:08,426 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-25 13:24:08,426 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 13:24:08,426 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-25 13:24:08,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 13:24:08,427 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:08,427 INFO L354 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-07-25 13:24:08,427 INFO L415 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:08,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2018-07-25 13:24:08,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:08,559 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:08,559 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:08,560 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 13:24:08,560 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 13:24:08,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 13:24:08,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:24:08,561 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 19 states. [2018-07-25 13:24:08,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:08,847 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-25 13:24:08,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:24:08,847 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-07-25 13:24:08,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:08,848 INFO L225 Difference]: With dead ends: 41 [2018-07-25 13:24:08,848 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 13:24:08,849 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:24:08,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 13:24:08,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-25 13:24:08,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-25 13:24:08,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-25 13:24:08,856 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-07-25 13:24:08,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:08,857 INFO L472 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-25 13:24:08,857 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 13:24:08,857 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-25 13:24:08,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-25 13:24:08,858 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:08,858 INFO L354 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-07-25 13:24:08,858 INFO L415 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:08,859 INFO L82 PathProgramCache]: Analyzing trace with hash 225377569, now seen corresponding path program 17 times [2018-07-25 13:24:08,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:08,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:08,967 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:08,967 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:08,968 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 13:24:08,968 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 13:24:08,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 13:24:08,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:24:08,969 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 20 states. [2018-07-25 13:24:09,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:09,276 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-25 13:24:09,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:24:09,276 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-07-25 13:24:09,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:09,277 INFO L225 Difference]: With dead ends: 43 [2018-07-25 13:24:09,277 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 13:24:09,278 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:24:09,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 13:24:09,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-25 13:24:09,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 13:24:09,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-25 13:24:09,285 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-07-25 13:24:09,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:09,285 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-25 13:24:09,285 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 13:24:09,285 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-25 13:24:09,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 13:24:09,286 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:09,286 INFO L354 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-07-25 13:24:09,286 INFO L415 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:09,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1839531099, now seen corresponding path program 18 times [2018-07-25 13:24:09,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:09,406 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:09,406 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:09,406 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 13:24:09,406 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 13:24:09,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 13:24:09,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:24:09,407 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2018-07-25 13:24:09,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:09,720 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-25 13:24:09,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:24:09,721 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-07-25 13:24:09,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:09,721 INFO L225 Difference]: With dead ends: 45 [2018-07-25 13:24:09,721 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 13:24:09,723 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:24:09,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 13:24:09,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-25 13:24:09,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 13:24:09,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-25 13:24:09,730 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-07-25 13:24:09,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:09,730 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-25 13:24:09,730 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 13:24:09,730 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-25 13:24:09,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 13:24:09,731 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:09,731 INFO L354 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-07-25 13:24:09,731 INFO L415 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:09,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1737087723, now seen corresponding path program 19 times [2018-07-25 13:24:09,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:09,870 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:09,870 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:09,870 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 13:24:09,871 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 13:24:09,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 13:24:09,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:24:09,872 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2018-07-25 13:24:10,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:10,222 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-25 13:24:10,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:24:10,222 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-07-25 13:24:10,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:10,223 INFO L225 Difference]: With dead ends: 47 [2018-07-25 13:24:10,223 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 13:24:10,225 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:24:10,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 13:24:10,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 13:24:10,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 13:24:10,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-25 13:24:10,246 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-07-25 13:24:10,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:10,246 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-25 13:24:10,246 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 13:24:10,246 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-25 13:24:10,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 13:24:10,247 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:10,247 INFO L354 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-07-25 13:24:10,249 INFO L415 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:10,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1401028431, now seen corresponding path program 20 times [2018-07-25 13:24:10,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:10,392 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:10,393 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:10,393 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 13:24:10,393 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 13:24:10,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 13:24:10,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:24:10,394 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 23 states. [2018-07-25 13:24:10,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:10,860 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-25 13:24:10,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:24:10,861 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-07-25 13:24:10,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:10,862 INFO L225 Difference]: With dead ends: 49 [2018-07-25 13:24:10,862 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 13:24:10,863 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:24:10,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 13:24:10,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-25 13:24:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 13:24:10,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-25 13:24:10,874 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-07-25 13:24:10,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:10,875 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-25 13:24:10,875 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 13:24:10,875 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-25 13:24:10,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 13:24:10,876 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:10,876 INFO L354 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-07-25 13:24:10,876 INFO L415 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:10,877 INFO L82 PathProgramCache]: Analyzing trace with hash 2063610633, now seen corresponding path program 21 times [2018-07-25 13:24:10,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:11,079 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:11,080 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:11,080 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 13:24:11,081 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 13:24:11,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 13:24:11,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:24:11,082 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 24 states. [2018-07-25 13:24:11,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:11,528 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-25 13:24:11,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:24:11,528 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-07-25 13:24:11,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:11,529 INFO L225 Difference]: With dead ends: 51 [2018-07-25 13:24:11,529 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 13:24:11,530 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:24:11,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 13:24:11,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-25 13:24:11,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-25 13:24:11,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-25 13:24:11,537 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-07-25 13:24:11,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:11,538 INFO L472 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-25 13:24:11,538 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 13:24:11,538 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-25 13:24:11,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 13:24:11,539 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:11,539 INFO L354 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-07-25 13:24:11,539 INFO L415 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:11,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1145020349, now seen corresponding path program 22 times [2018-07-25 13:24:11,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:11,688 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:11,688 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:11,689 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-25 13:24:11,689 INFO L451 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-25 13:24:11,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-25 13:24:11,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:24:11,690 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 25 states. [2018-07-25 13:24:12,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:12,163 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-25 13:24:12,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 13:24:12,164 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-07-25 13:24:12,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:12,164 INFO L225 Difference]: With dead ends: 53 [2018-07-25 13:24:12,165 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 13:24:12,166 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:24:12,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 13:24:12,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-25 13:24:12,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 13:24:12,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-25 13:24:12,174 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-07-25 13:24:12,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:12,174 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-25 13:24:12,174 INFO L473 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-25 13:24:12,174 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-25 13:24:12,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 13:24:12,175 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:12,175 INFO L354 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-07-25 13:24:12,175 INFO L415 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:12,176 INFO L82 PathProgramCache]: Analyzing trace with hash -852875523, now seen corresponding path program 23 times [2018-07-25 13:24:12,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:12,333 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:12,333 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:12,333 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 13:24:12,334 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 13:24:12,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 13:24:12,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:24:12,334 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 26 states. [2018-07-25 13:24:12,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:12,812 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-25 13:24:12,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 13:24:12,813 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-07-25 13:24:12,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:12,813 INFO L225 Difference]: With dead ends: 55 [2018-07-25 13:24:12,813 INFO L226 Difference]: Without dead ends: 53 [2018-07-25 13:24:12,815 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:24:12,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-25 13:24:12,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-25 13:24:12,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-25 13:24:12,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-25 13:24:12,822 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-07-25 13:24:12,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:12,823 INFO L472 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-25 13:24:12,823 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 13:24:12,823 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-25 13:24:12,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-25 13:24:12,824 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:12,824 INFO L354 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-07-25 13:24:12,824 INFO L415 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:12,824 INFO L82 PathProgramCache]: Analyzing trace with hash 725428023, now seen corresponding path program 24 times [2018-07-25 13:24:12,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:12,997 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:12,997 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:12,997 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-25 13:24:12,998 INFO L451 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-25 13:24:12,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-25 13:24:12,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:24:12,999 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 27 states. [2018-07-25 13:24:13,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:13,621 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-25 13:24:13,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 13:24:13,622 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-07-25 13:24:13,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:13,622 INFO L225 Difference]: With dead ends: 57 [2018-07-25 13:24:13,623 INFO L226 Difference]: Without dead ends: 55 [2018-07-25 13:24:13,624 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:24:13,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-25 13:24:13,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-25 13:24:13,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-25 13:24:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-25 13:24:13,640 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-07-25 13:24:13,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:13,640 INFO L472 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-25 13:24:13,641 INFO L473 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-25 13:24:13,641 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-25 13:24:13,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-25 13:24:13,662 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:13,662 INFO L354 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-07-25 13:24:13,662 INFO L415 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:13,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1351680241, now seen corresponding path program 25 times [2018-07-25 13:24:13,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:13,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:13,848 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:13,849 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:13,849 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 13:24:13,849 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 13:24:13,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 13:24:13,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:24:13,850 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 28 states. [2018-07-25 13:24:14,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:14,404 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-25 13:24:14,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 13:24:14,405 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-07-25 13:24:14,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:14,405 INFO L225 Difference]: With dead ends: 59 [2018-07-25 13:24:14,405 INFO L226 Difference]: Without dead ends: 57 [2018-07-25 13:24:14,408 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:24:14,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-25 13:24:14,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-25 13:24:14,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-25 13:24:14,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-25 13:24:14,417 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-07-25 13:24:14,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:14,417 INFO L472 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-25 13:24:14,417 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 13:24:14,417 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-25 13:24:14,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-25 13:24:14,418 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:14,418 INFO L354 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-07-25 13:24:14,420 INFO L415 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:14,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1884640299, now seen corresponding path program 26 times [2018-07-25 13:24:14,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:14,610 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:14,610 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:14,610 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-25 13:24:14,611 INFO L451 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-25 13:24:14,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-25 13:24:14,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:24:14,612 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 29 states. [2018-07-25 13:24:15,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:15,184 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-25 13:24:15,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 13:24:15,184 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-07-25 13:24:15,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:15,185 INFO L225 Difference]: With dead ends: 61 [2018-07-25 13:24:15,185 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 13:24:15,186 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:24:15,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 13:24:15,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-25 13:24:15,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-25 13:24:15,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-25 13:24:15,193 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-07-25 13:24:15,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:15,193 INFO L472 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-25 13:24:15,193 INFO L473 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-25 13:24:15,193 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-25 13:24:15,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-25 13:24:15,194 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:15,194 INFO L354 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-07-25 13:24:15,194 INFO L415 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:15,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1336819483, now seen corresponding path program 27 times [2018-07-25 13:24:15,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:15,381 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:15,382 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:15,382 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 13:24:15,382 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 13:24:15,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 13:24:15,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:24:15,383 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 30 states. [2018-07-25 13:24:16,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:16,057 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-25 13:24:16,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 13:24:16,058 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-07-25 13:24:16,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:16,059 INFO L225 Difference]: With dead ends: 63 [2018-07-25 13:24:16,059 INFO L226 Difference]: Without dead ends: 61 [2018-07-25 13:24:16,061 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:24:16,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-25 13:24:16,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-25 13:24:16,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-25 13:24:16,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-25 13:24:16,068 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-07-25 13:24:16,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:16,069 INFO L472 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-25 13:24:16,069 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 13:24:16,069 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-25 13:24:16,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-25 13:24:16,070 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:16,070 INFO L354 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-07-25 13:24:16,070 INFO L415 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:16,070 INFO L82 PathProgramCache]: Analyzing trace with hash -488249569, now seen corresponding path program 28 times [2018-07-25 13:24:16,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:16,331 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:16,331 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:16,331 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-25 13:24:16,332 INFO L451 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-25 13:24:16,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-25 13:24:16,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:24:16,333 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 31 states. [2018-07-25 13:24:17,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:17,100 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-25 13:24:17,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 13:24:17,100 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-07-25 13:24:17,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:17,101 INFO L225 Difference]: With dead ends: 65 [2018-07-25 13:24:17,101 INFO L226 Difference]: Without dead ends: 63 [2018-07-25 13:24:17,105 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:24:17,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-25 13:24:17,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-25 13:24:17,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-25 13:24:17,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-25 13:24:17,115 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-07-25 13:24:17,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:17,115 INFO L472 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-25 13:24:17,115 INFO L473 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-25 13:24:17,116 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-25 13:24:17,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-25 13:24:17,116 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:17,116 INFO L354 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-07-25 13:24:17,117 INFO L415 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:17,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1056348455, now seen corresponding path program 29 times [2018-07-25 13:24:17,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:17,335 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:17,335 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:17,336 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 13:24:17,336 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 13:24:17,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 13:24:17,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:24:17,337 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 32 states. [2018-07-25 13:24:18,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:18,122 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-25 13:24:18,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 13:24:18,122 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-07-25 13:24:18,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:18,123 INFO L225 Difference]: With dead ends: 67 [2018-07-25 13:24:18,123 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 13:24:18,125 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:24:18,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 13:24:18,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 13:24:18,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 13:24:18,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-25 13:24:18,135 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-07-25 13:24:18,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:18,135 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-25 13:24:18,135 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 13:24:18,135 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-25 13:24:18,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-25 13:24:18,136 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:18,136 INFO L354 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2018-07-25 13:24:18,136 INFO L415 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:18,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1538531309, now seen corresponding path program 30 times [2018-07-25 13:24:18,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:18,372 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:18,373 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:18,373 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-25 13:24:18,373 INFO L451 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-25 13:24:18,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-25 13:24:18,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:24:18,375 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 33 states. [2018-07-25 13:24:19,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:19,260 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-25 13:24:19,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 13:24:19,261 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-07-25 13:24:19,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:19,261 INFO L225 Difference]: With dead ends: 69 [2018-07-25 13:24:19,261 INFO L226 Difference]: Without dead ends: 67 [2018-07-25 13:24:19,264 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:24:19,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-25 13:24:19,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-25 13:24:19,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-25 13:24:19,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-25 13:24:19,273 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-07-25 13:24:19,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:19,273 INFO L472 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-25 13:24:19,273 INFO L473 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-25 13:24:19,273 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-25 13:24:19,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-25 13:24:19,274 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:19,274 INFO L354 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2018-07-25 13:24:19,274 INFO L415 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:19,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1059786035, now seen corresponding path program 31 times [2018-07-25 13:24:19,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:19,509 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:19,510 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:19,510 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 13:24:19,510 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 13:24:19,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 13:24:19,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:24:19,512 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 34 states. [2018-07-25 13:24:20,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:20,387 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-25 13:24:20,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 13:24:20,387 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-07-25 13:24:20,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:20,388 INFO L225 Difference]: With dead ends: 71 [2018-07-25 13:24:20,388 INFO L226 Difference]: Without dead ends: 69 [2018-07-25 13:24:20,390 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:24:20,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-25 13:24:20,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-25 13:24:20,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-25 13:24:20,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-25 13:24:20,399 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-07-25 13:24:20,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:20,399 INFO L472 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-25 13:24:20,400 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 13:24:20,400 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-25 13:24:20,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-25 13:24:20,400 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:20,400 INFO L354 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2018-07-25 13:24:20,401 INFO L415 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:20,401 INFO L82 PathProgramCache]: Analyzing trace with hash -547078393, now seen corresponding path program 32 times [2018-07-25 13:24:20,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:20,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:20,650 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:20,650 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-25 13:24:20,650 INFO L451 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-25 13:24:20,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-25 13:24:20,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:24:20,654 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 35 states. [2018-07-25 13:24:21,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:21,545 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-25 13:24:21,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 13:24:21,546 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-07-25 13:24:21,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:21,546 INFO L225 Difference]: With dead ends: 73 [2018-07-25 13:24:21,546 INFO L226 Difference]: Without dead ends: 71 [2018-07-25 13:24:21,549 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:24:21,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-25 13:24:21,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-25 13:24:21,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-25 13:24:21,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-25 13:24:21,558 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-07-25 13:24:21,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:21,558 INFO L472 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-25 13:24:21,558 INFO L473 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-25 13:24:21,558 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-25 13:24:21,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-25 13:24:21,559 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:21,559 INFO L354 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2018-07-25 13:24:21,559 INFO L415 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:21,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1756273471, now seen corresponding path program 33 times [2018-07-25 13:24:21,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:21,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:21,844 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:21,845 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 13:24:21,845 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 13:24:21,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 13:24:21,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:24:21,846 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 36 states. [2018-07-25 13:24:22,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:22,871 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-25 13:24:22,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 13:24:22,871 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-07-25 13:24:22,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:22,872 INFO L225 Difference]: With dead ends: 75 [2018-07-25 13:24:22,872 INFO L226 Difference]: Without dead ends: 73 [2018-07-25 13:24:22,873 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:24:22,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-25 13:24:22,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-25 13:24:22,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-25 13:24:22,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-25 13:24:22,881 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-07-25 13:24:22,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:22,881 INFO L472 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-25 13:24:22,881 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 13:24:22,881 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-25 13:24:22,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-25 13:24:22,882 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:22,882 INFO L354 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2018-07-25 13:24:22,882 INFO L415 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:22,882 INFO L82 PathProgramCache]: Analyzing trace with hash 143393787, now seen corresponding path program 34 times [2018-07-25 13:24:22,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:23,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:23,141 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:23,141 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-25 13:24:23,141 INFO L451 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-25 13:24:23,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-25 13:24:23,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:24:23,142 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 37 states. [2018-07-25 13:24:24,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:24,153 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-25 13:24:24,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 13:24:24,154 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-07-25 13:24:24,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:24,154 INFO L225 Difference]: With dead ends: 77 [2018-07-25 13:24:24,155 INFO L226 Difference]: Without dead ends: 75 [2018-07-25 13:24:24,156 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:24:24,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-25 13:24:24,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-25 13:24:24,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-25 13:24:24,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-25 13:24:24,165 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-07-25 13:24:24,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:24,166 INFO L472 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-25 13:24:24,166 INFO L473 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-25 13:24:24,166 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-25 13:24:24,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-25 13:24:24,167 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:24,167 INFO L354 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2018-07-25 13:24:24,167 INFO L415 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:24,168 INFO L82 PathProgramCache]: Analyzing trace with hash 362527925, now seen corresponding path program 35 times [2018-07-25 13:24:24,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:24,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:24,431 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:24,431 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 13:24:24,432 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 13:24:24,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 13:24:24,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:24:24,433 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 38 states. [2018-07-25 13:24:25,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:25,531 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-25 13:24:25,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 13:24:25,532 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-07-25 13:24:25,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:25,533 INFO L225 Difference]: With dead ends: 79 [2018-07-25 13:24:25,533 INFO L226 Difference]: Without dead ends: 77 [2018-07-25 13:24:25,535 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:24:25,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-25 13:24:25,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-25 13:24:25,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-25 13:24:25,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-25 13:24:25,543 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-07-25 13:24:25,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:25,543 INFO L472 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-25 13:24:25,543 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 13:24:25,544 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-25 13:24:25,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-25 13:24:25,544 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:25,544 INFO L354 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2018-07-25 13:24:25,545 INFO L415 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:25,545 INFO L82 PathProgramCache]: Analyzing trace with hash 497037039, now seen corresponding path program 36 times [2018-07-25 13:24:25,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:25,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:25,827 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:25,827 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-25 13:24:25,828 INFO L451 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-25 13:24:25,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-25 13:24:25,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:24:25,829 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 39 states. [2018-07-25 13:24:26,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:26,929 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-25 13:24:26,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 13:24:26,929 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-07-25 13:24:26,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:26,930 INFO L225 Difference]: With dead ends: 81 [2018-07-25 13:24:26,930 INFO L226 Difference]: Without dead ends: 79 [2018-07-25 13:24:26,932 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:24:26,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-25 13:24:26,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-25 13:24:26,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-25 13:24:26,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-25 13:24:26,940 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-07-25 13:24:26,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:26,940 INFO L472 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-25 13:24:26,940 INFO L473 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-25 13:24:26,941 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-25 13:24:26,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-25 13:24:26,941 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:26,941 INFO L354 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2018-07-25 13:24:26,942 INFO L415 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:26,942 INFO L82 PathProgramCache]: Analyzing trace with hash 911276713, now seen corresponding path program 37 times [2018-07-25 13:24:26,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:27,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:27,205 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:27,206 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 13:24:27,206 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 13:24:27,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 13:24:27,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:24:27,207 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 40 states. [2018-07-25 13:24:28,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:28,514 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-25 13:24:28,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 13:24:28,514 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-07-25 13:24:28,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:28,515 INFO L225 Difference]: With dead ends: 83 [2018-07-25 13:24:28,515 INFO L226 Difference]: Without dead ends: 81 [2018-07-25 13:24:28,517 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:24:28,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-25 13:24:28,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-25 13:24:28,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-25 13:24:28,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-25 13:24:28,526 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-07-25 13:24:28,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:28,526 INFO L472 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-25 13:24:28,526 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 13:24:28,526 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-25 13:24:28,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-25 13:24:28,527 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:28,527 INFO L354 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2018-07-25 13:24:28,527 INFO L415 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:28,527 INFO L82 PathProgramCache]: Analyzing trace with hash -436355101, now seen corresponding path program 38 times [2018-07-25 13:24:28,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:28,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:28,788 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:28,788 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-25 13:24:28,789 INFO L451 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-25 13:24:28,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-25 13:24:28,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:24:28,790 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 41 states. [2018-07-25 13:24:29,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:29,969 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-25 13:24:29,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 13:24:29,970 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-07-25 13:24:29,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:29,971 INFO L225 Difference]: With dead ends: 85 [2018-07-25 13:24:29,971 INFO L226 Difference]: Without dead ends: 83 [2018-07-25 13:24:29,972 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:24:29,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-25 13:24:29,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-25 13:24:29,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 13:24:29,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-25 13:24:29,982 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-07-25 13:24:29,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:29,982 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-25 13:24:29,982 INFO L473 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-25 13:24:29,982 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-25 13:24:29,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-25 13:24:29,983 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:29,983 INFO L354 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2018-07-25 13:24:29,984 INFO L415 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:29,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1569595037, now seen corresponding path program 39 times [2018-07-25 13:24:29,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:30,294 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:30,295 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 13:24:30,295 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 13:24:30,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 13:24:30,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:24:30,296 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 42 states. [2018-07-25 13:24:31,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:31,642 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-25 13:24:31,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 13:24:31,642 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-07-25 13:24:31,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:31,643 INFO L225 Difference]: With dead ends: 87 [2018-07-25 13:24:31,643 INFO L226 Difference]: Without dead ends: 85 [2018-07-25 13:24:31,644 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:24:31,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-25 13:24:31,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-25 13:24:31,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 13:24:31,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-25 13:24:31,651 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-07-25 13:24:31,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:31,652 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-25 13:24:31,652 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 13:24:31,652 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-25 13:24:31,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-25 13:24:31,653 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:31,653 INFO L354 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2018-07-25 13:24:31,653 INFO L415 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:31,653 INFO L82 PathProgramCache]: Analyzing trace with hash 847361751, now seen corresponding path program 40 times [2018-07-25 13:24:31,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:31,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:31,942 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:31,942 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-25 13:24:31,942 INFO L451 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-25 13:24:31,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-25 13:24:31,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:24:31,943 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 43 states. [2018-07-25 13:24:33,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:33,230 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-25 13:24:33,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 13:24:33,230 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-07-25 13:24:33,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:33,231 INFO L225 Difference]: With dead ends: 89 [2018-07-25 13:24:33,231 INFO L226 Difference]: Without dead ends: 87 [2018-07-25 13:24:33,233 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:24:33,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-25 13:24:33,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-25 13:24:33,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 13:24:33,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-25 13:24:33,241 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-07-25 13:24:33,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:33,242 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-25 13:24:33,242 INFO L473 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-25 13:24:33,242 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-25 13:24:33,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-25 13:24:33,243 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:33,243 INFO L354 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2018-07-25 13:24:33,243 INFO L415 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:33,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1729091439, now seen corresponding path program 41 times [2018-07-25 13:24:33,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:33,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:33,558 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:33,558 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 13:24:33,559 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 13:24:33,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 13:24:33,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:24:33,560 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 44 states. [2018-07-25 13:24:34,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:34,761 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-25 13:24:34,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-25 13:24:34,761 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-07-25 13:24:34,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:34,762 INFO L225 Difference]: With dead ends: 91 [2018-07-25 13:24:34,762 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 13:24:34,763 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:24:34,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 13:24:34,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-25 13:24:34,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 13:24:34,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-25 13:24:34,770 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-07-25 13:24:34,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:34,771 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-25 13:24:34,771 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 13:24:34,771 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-25 13:24:34,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-25 13:24:34,772 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:34,772 INFO L354 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2018-07-25 13:24:34,772 INFO L415 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:34,772 INFO L82 PathProgramCache]: Analyzing trace with hash 495522763, now seen corresponding path program 42 times [2018-07-25 13:24:34,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:35,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:35,084 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:35,084 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-25 13:24:35,084 INFO L451 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-25 13:24:35,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-25 13:24:35,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:24:35,085 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 45 states. [2018-07-25 13:24:36,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:36,292 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-25 13:24:36,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 13:24:36,292 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-07-25 13:24:36,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:36,293 INFO L225 Difference]: With dead ends: 93 [2018-07-25 13:24:36,293 INFO L226 Difference]: Without dead ends: 91 [2018-07-25 13:24:36,295 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:24:36,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-25 13:24:36,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-25 13:24:36,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-25 13:24:36,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-25 13:24:36,303 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-07-25 13:24:36,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:36,303 INFO L472 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-25 13:24:36,303 INFO L473 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-25 13:24:36,303 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-25 13:24:36,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-25 13:24:36,304 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:36,304 INFO L354 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2018-07-25 13:24:36,305 INFO L415 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:36,305 INFO L82 PathProgramCache]: Analyzing trace with hash -543942523, now seen corresponding path program 43 times [2018-07-25 13:24:36,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:36,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:36,616 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:36,616 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-25 13:24:36,617 INFO L451 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-25 13:24:36,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-25 13:24:36,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:24:36,618 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 46 states. [2018-07-25 13:24:37,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:37,800 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-25 13:24:37,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 13:24:37,801 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-07-25 13:24:37,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:37,802 INFO L225 Difference]: With dead ends: 95 [2018-07-25 13:24:37,802 INFO L226 Difference]: Without dead ends: 93 [2018-07-25 13:24:37,803 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:24:37,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-25 13:24:37,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-25 13:24:37,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-25 13:24:37,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-25 13:24:37,811 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-07-25 13:24:37,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:37,811 INFO L472 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-25 13:24:37,811 INFO L473 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-25 13:24:37,812 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-25 13:24:37,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-25 13:24:37,812 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:37,812 INFO L354 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2018-07-25 13:24:37,813 INFO L415 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:37,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1257297599, now seen corresponding path program 44 times [2018-07-25 13:24:37,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:38,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:38,092 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:38,092 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-25 13:24:38,093 INFO L451 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-25 13:24:38,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-25 13:24:38,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:24:38,093 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 47 states. [2018-07-25 13:24:39,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:39,259 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-25 13:24:39,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-25 13:24:39,259 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-07-25 13:24:39,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:39,260 INFO L225 Difference]: With dead ends: 97 [2018-07-25 13:24:39,260 INFO L226 Difference]: Without dead ends: 95 [2018-07-25 13:24:39,261 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:24:39,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-25 13:24:39,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-25 13:24:39,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-25 13:24:39,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-25 13:24:39,270 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-07-25 13:24:39,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:39,270 INFO L472 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-25 13:24:39,270 INFO L473 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-25 13:24:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-25 13:24:39,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-25 13:24:39,271 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:39,271 INFO L354 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2018-07-25 13:24:39,272 INFO L415 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:39,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1377234553, now seen corresponding path program 45 times [2018-07-25 13:24:39,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:39,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:39,688 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:39,688 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-25 13:24:39,689 INFO L451 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-25 13:24:39,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-25 13:24:39,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:24:39,690 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 48 states. [2018-07-25 13:24:40,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:40,916 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-25 13:24:40,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-25 13:24:40,916 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-07-25 13:24:40,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:40,917 INFO L225 Difference]: With dead ends: 99 [2018-07-25 13:24:40,917 INFO L226 Difference]: Without dead ends: 97 [2018-07-25 13:24:40,918 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:24:40,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-25 13:24:40,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-25 13:24:40,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-25 13:24:40,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-25 13:24:40,928 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-07-25 13:24:40,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:40,928 INFO L472 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-25 13:24:40,928 INFO L473 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-25 13:24:40,928 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-25 13:24:40,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-25 13:24:40,929 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:40,929 INFO L354 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2018-07-25 13:24:40,930 INFO L415 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:40,930 INFO L82 PathProgramCache]: Analyzing trace with hash 672530355, now seen corresponding path program 46 times [2018-07-25 13:24:40,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:41,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:41,272 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:41,272 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-25 13:24:41,272 INFO L451 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-25 13:24:41,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-25 13:24:41,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:24:41,273 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 49 states. [2018-07-25 13:24:42,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:42,795 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-25 13:24:42,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-25 13:24:42,796 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-07-25 13:24:42,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:42,797 INFO L225 Difference]: With dead ends: 101 [2018-07-25 13:24:42,797 INFO L226 Difference]: Without dead ends: 99 [2018-07-25 13:24:42,797 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:24:42,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-25 13:24:42,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-25 13:24:42,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-25 13:24:42,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-25 13:24:42,803 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-07-25 13:24:42,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:42,804 INFO L472 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-25 13:24:42,804 INFO L473 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-25 13:24:42,804 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-25 13:24:42,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-25 13:24:42,804 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:42,805 INFO L354 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2018-07-25 13:24:42,805 INFO L415 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:42,805 INFO L82 PathProgramCache]: Analyzing trace with hash 2056628845, now seen corresponding path program 47 times [2018-07-25 13:24:42,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:43,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:43,103 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:43,103 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-25 13:24:43,103 INFO L451 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-25 13:24:43,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-25 13:24:43,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 13:24:43,104 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 50 states. [2018-07-25 13:24:44,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:44,521 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-25 13:24:44,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-25 13:24:44,521 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-07-25 13:24:44,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:44,522 INFO L225 Difference]: With dead ends: 103 [2018-07-25 13:24:44,522 INFO L226 Difference]: Without dead ends: 101 [2018-07-25 13:24:44,523 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:24:44,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-25 13:24:44,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-25 13:24:44,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-25 13:24:44,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-25 13:24:44,530 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-07-25 13:24:44,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:44,531 INFO L472 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-25 13:24:44,531 INFO L473 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-25 13:24:44,531 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-25 13:24:44,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-25 13:24:44,531 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:44,531 INFO L354 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2018-07-25 13:24:44,532 INFO L415 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:44,532 INFO L82 PathProgramCache]: Analyzing trace with hash 735415975, now seen corresponding path program 48 times [2018-07-25 13:24:44,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:44,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:44,935 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:44,935 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-25 13:24:44,935 INFO L451 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-25 13:24:44,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-25 13:24:44,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:24:44,936 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 51 states. [2018-07-25 13:24:46,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:46,412 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-25 13:24:46,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-25 13:24:46,412 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-07-25 13:24:46,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:46,413 INFO L225 Difference]: With dead ends: 105 [2018-07-25 13:24:46,413 INFO L226 Difference]: Without dead ends: 103 [2018-07-25 13:24:46,414 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 13:24:46,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-25 13:24:46,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-25 13:24:46,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-25 13:24:46,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-25 13:24:46,421 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-07-25 13:24:46,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:46,421 INFO L472 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-25 13:24:46,421 INFO L473 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-25 13:24:46,421 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-25 13:24:46,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-25 13:24:46,422 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:46,422 INFO L354 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2018-07-25 13:24:46,422 INFO L415 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:46,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1934799775, now seen corresponding path program 49 times [2018-07-25 13:24:46,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:46,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:46,736 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:46,736 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-25 13:24:46,736 INFO L451 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-25 13:24:46,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-25 13:24:46,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:24:46,737 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 52 states. [2018-07-25 13:24:48,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:48,282 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-25 13:24:48,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-25 13:24:48,282 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-07-25 13:24:48,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:48,283 INFO L225 Difference]: With dead ends: 107 [2018-07-25 13:24:48,283 INFO L226 Difference]: Without dead ends: 105 [2018-07-25 13:24:48,283 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 13:24:48,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-25 13:24:48,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-25 13:24:48,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-25 13:24:48,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-25 13:24:48,292 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-07-25 13:24:48,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:48,293 INFO L472 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-25 13:24:48,293 INFO L473 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-25 13:24:48,293 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-25 13:24:48,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-25 13:24:48,293 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:48,293 INFO L354 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2018-07-25 13:24:48,294 INFO L415 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:48,294 INFO L82 PathProgramCache]: Analyzing trace with hash 378307483, now seen corresponding path program 50 times [2018-07-25 13:24:48,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:48,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:48,630 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:48,630 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-25 13:24:48,630 INFO L451 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-25 13:24:48,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-25 13:24:48,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:24:48,631 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 53 states. [2018-07-25 13:24:50,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:50,487 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-07-25 13:24:50,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-25 13:24:50,487 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-07-25 13:24:50,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:50,490 INFO L225 Difference]: With dead ends: 109 [2018-07-25 13:24:50,490 INFO L226 Difference]: Without dead ends: 107 [2018-07-25 13:24:50,491 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 13:24:50,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-25 13:24:50,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-07-25 13:24:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-25 13:24:50,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-07-25 13:24:50,508 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-07-25 13:24:50,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:50,508 INFO L472 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-07-25 13:24:50,509 INFO L473 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-25 13:24:50,509 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-07-25 13:24:50,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-25 13:24:50,509 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:50,509 INFO L354 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2018-07-25 13:24:50,510 INFO L415 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:50,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1518676907, now seen corresponding path program 51 times [2018-07-25 13:24:50,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:51,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:51,077 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:51,077 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-25 13:24:51,077 INFO L451 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-25 13:24:51,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-25 13:24:51,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:24:51,078 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 54 states. [2018-07-25 13:24:52,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:52,737 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-07-25 13:24:52,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-25 13:24:52,737 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-07-25 13:24:52,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:52,739 INFO L225 Difference]: With dead ends: 111 [2018-07-25 13:24:52,739 INFO L226 Difference]: Without dead ends: 109 [2018-07-25 13:24:52,740 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 13:24:52,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-25 13:24:52,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-07-25 13:24:52,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-25 13:24:52,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-07-25 13:24:52,748 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-07-25 13:24:52,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:52,748 INFO L472 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-07-25 13:24:52,749 INFO L473 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-25 13:24:52,749 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-07-25 13:24:52,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-25 13:24:52,749 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:52,749 INFO L354 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2018-07-25 13:24:52,750 INFO L415 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:52,750 INFO L82 PathProgramCache]: Analyzing trace with hash 840425103, now seen corresponding path program 52 times [2018-07-25 13:24:52,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:52,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:53,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:53,101 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:53,102 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-25 13:24:53,102 INFO L451 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-25 13:24:53,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-25 13:24:53,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:24:53,103 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 55 states. [2018-07-25 13:24:54,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:54,908 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-07-25 13:24:54,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-25 13:24:54,909 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-07-25 13:24:54,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:54,910 INFO L225 Difference]: With dead ends: 113 [2018-07-25 13:24:54,910 INFO L226 Difference]: Without dead ends: 111 [2018-07-25 13:24:54,911 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 13:24:54,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-25 13:24:54,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-07-25 13:24:54,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-25 13:24:54,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-07-25 13:24:54,919 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2018-07-25 13:24:54,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:54,919 INFO L472 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-07-25 13:24:54,919 INFO L473 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-25 13:24:54,920 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-07-25 13:24:54,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-25 13:24:54,920 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:54,920 INFO L354 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2018-07-25 13:24:54,921 INFO L415 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:54,921 INFO L82 PathProgramCache]: Analyzing trace with hash 194724425, now seen corresponding path program 53 times [2018-07-25 13:24:54,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:55,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:55,286 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:55,286 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-25 13:24:55,286 INFO L451 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-25 13:24:55,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-25 13:24:55,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:24:55,287 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 56 states. [2018-07-25 13:24:57,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:57,238 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-07-25 13:24:57,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-25 13:24:57,239 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-07-25 13:24:57,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:57,239 INFO L225 Difference]: With dead ends: 115 [2018-07-25 13:24:57,239 INFO L226 Difference]: Without dead ends: 113 [2018-07-25 13:24:57,240 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 13:24:57,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-25 13:24:57,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-07-25 13:24:57,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-25 13:24:57,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-07-25 13:24:57,246 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2018-07-25 13:24:57,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:57,247 INFO L472 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-07-25 13:24:57,247 INFO L473 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-25 13:24:57,247 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-07-25 13:24:57,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-25 13:24:57,247 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:57,247 INFO L354 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2018-07-25 13:24:57,248 INFO L415 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:57,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1848336509, now seen corresponding path program 54 times [2018-07-25 13:24:57,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:57,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:57,628 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:57,628 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-25 13:24:57,629 INFO L451 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-25 13:24:57,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-25 13:24:57,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:24:57,629 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 57 states. [2018-07-25 13:24:59,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:59,567 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-07-25 13:24:59,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-25 13:24:59,568 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-07-25 13:24:59,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:59,569 INFO L225 Difference]: With dead ends: 117 [2018-07-25 13:24:59,569 INFO L226 Difference]: Without dead ends: 115 [2018-07-25 13:24:59,570 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 13:24:59,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-25 13:24:59,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-07-25 13:24:59,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-25 13:24:59,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-07-25 13:24:59,578 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2018-07-25 13:24:59,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:59,578 INFO L472 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-07-25 13:24:59,578 INFO L473 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-25 13:24:59,578 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-07-25 13:24:59,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-25 13:24:59,579 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:59,579 INFO L354 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2018-07-25 13:24:59,579 INFO L415 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:59,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1865127485, now seen corresponding path program 55 times [2018-07-25 13:24:59,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:59,973 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:59,973 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-25 13:24:59,974 INFO L451 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-25 13:24:59,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-25 13:24:59,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:24:59,974 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 58 states. [2018-07-25 13:25:02,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:02,094 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-07-25 13:25:02,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-25 13:25:02,094 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-07-25 13:25:02,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:02,095 INFO L225 Difference]: With dead ends: 119 [2018-07-25 13:25:02,095 INFO L226 Difference]: Without dead ends: 117 [2018-07-25 13:25:02,097 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 13:25:02,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-07-25 13:25:02,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-07-25 13:25:02,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-25 13:25:02,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-07-25 13:25:02,105 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2018-07-25 13:25:02,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:02,106 INFO L472 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-07-25 13:25:02,106 INFO L473 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-25 13:25:02,106 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-07-25 13:25:02,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-25 13:25:02,107 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:02,107 INFO L354 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2018-07-25 13:25:02,107 INFO L415 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:02,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1386202743, now seen corresponding path program 56 times [2018-07-25 13:25:02,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:02,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:02,576 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:02,576 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-25 13:25:02,577 INFO L451 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-25 13:25:02,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-25 13:25:02,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:25:02,578 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 59 states. [2018-07-25 13:25:04,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:04,761 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-07-25 13:25:04,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-25 13:25:04,761 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2018-07-25 13:25:04,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:04,762 INFO L225 Difference]: With dead ends: 121 [2018-07-25 13:25:04,762 INFO L226 Difference]: Without dead ends: 119 [2018-07-25 13:25:04,763 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 13:25:04,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-25 13:25:04,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-25 13:25:04,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-25 13:25:04,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-07-25 13:25:04,772 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2018-07-25 13:25:04,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:04,772 INFO L472 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-07-25 13:25:04,772 INFO L473 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-25 13:25:04,772 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-07-25 13:25:04,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-25 13:25:04,773 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:04,773 INFO L354 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2018-07-25 13:25:04,773 INFO L415 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:04,774 INFO L82 PathProgramCache]: Analyzing trace with hash 701026353, now seen corresponding path program 57 times [2018-07-25 13:25:04,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:05,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:05,236 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:05,236 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-25 13:25:05,237 INFO L451 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-25 13:25:05,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-25 13:25:05,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 13:25:05,237 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 60 states. [2018-07-25 13:25:07,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:07,491 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-07-25 13:25:07,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-25 13:25:07,491 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-07-25 13:25:07,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:07,492 INFO L225 Difference]: With dead ends: 123 [2018-07-25 13:25:07,492 INFO L226 Difference]: Without dead ends: 121 [2018-07-25 13:25:07,494 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 13:25:07,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-25 13:25:07,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-07-25 13:25:07,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 13:25:07,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-07-25 13:25:07,502 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2018-07-25 13:25:07,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:07,502 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-07-25 13:25:07,502 INFO L473 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-25 13:25:07,502 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-07-25 13:25:07,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-25 13:25:07,503 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:07,503 INFO L354 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2018-07-25 13:25:07,504 INFO L415 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:07,504 INFO L82 PathProgramCache]: Analyzing trace with hash -623488149, now seen corresponding path program 58 times [2018-07-25 13:25:07,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:07,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:07,924 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:07,925 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-25 13:25:07,925 INFO L451 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-25 13:25:07,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-25 13:25:07,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:25:07,926 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 61 states. [2018-07-25 13:25:10,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:10,398 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-07-25 13:25:10,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-25 13:25:10,398 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-07-25 13:25:10,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:10,399 INFO L225 Difference]: With dead ends: 125 [2018-07-25 13:25:10,399 INFO L226 Difference]: Without dead ends: 123 [2018-07-25 13:25:10,401 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 13:25:10,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-25 13:25:10,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-07-25 13:25:10,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-07-25 13:25:10,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-07-25 13:25:10,407 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2018-07-25 13:25:10,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:10,407 INFO L472 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-07-25 13:25:10,407 INFO L473 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-25 13:25:10,408 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-07-25 13:25:10,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-25 13:25:10,408 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:10,408 INFO L354 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2018-07-25 13:25:10,409 INFO L415 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:10,409 INFO L82 PathProgramCache]: Analyzing trace with hash 2123362341, now seen corresponding path program 59 times [2018-07-25 13:25:10,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:10,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:10,961 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:10,961 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-25 13:25:10,962 INFO L451 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-25 13:25:10,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-25 13:25:10,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:25:10,963 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 62 states. [2018-07-25 13:25:13,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:13,563 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-07-25 13:25:13,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 13:25:13,563 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-07-25 13:25:13,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:13,564 INFO L225 Difference]: With dead ends: 127 [2018-07-25 13:25:13,564 INFO L226 Difference]: Without dead ends: 125 [2018-07-25 13:25:13,565 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 13:25:13,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-25 13:25:13,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-07-25 13:25:13,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-25 13:25:13,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-07-25 13:25:13,574 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2018-07-25 13:25:13,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:13,574 INFO L472 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-07-25 13:25:13,574 INFO L473 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-25 13:25:13,574 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-07-25 13:25:13,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-25 13:25:13,575 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:13,575 INFO L354 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2018-07-25 13:25:13,575 INFO L415 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:13,575 INFO L82 PathProgramCache]: Analyzing trace with hash 441796191, now seen corresponding path program 60 times [2018-07-25 13:25:13,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:14,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:14,011 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:14,011 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-25 13:25:14,011 INFO L451 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-25 13:25:14,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-25 13:25:14,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:25:14,012 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 63 states. [2018-07-25 13:25:16,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:16,545 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-07-25 13:25:16,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-25 13:25:16,545 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-07-25 13:25:16,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:16,546 INFO L225 Difference]: With dead ends: 129 [2018-07-25 13:25:16,546 INFO L226 Difference]: Without dead ends: 127 [2018-07-25 13:25:16,547 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 13:25:16,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-25 13:25:16,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-07-25 13:25:16,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-25 13:25:16,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-07-25 13:25:16,555 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2018-07-25 13:25:16,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:16,556 INFO L472 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-07-25 13:25:16,556 INFO L473 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-25 13:25:16,556 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-07-25 13:25:16,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-25 13:25:16,557 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:16,557 INFO L354 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2018-07-25 13:25:16,557 INFO L415 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:16,558 INFO L82 PathProgramCache]: Analyzing trace with hash -635570663, now seen corresponding path program 61 times [2018-07-25 13:25:16,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:17,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:17,001 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:17,001 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-25 13:25:17,001 INFO L451 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-25 13:25:17,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-25 13:25:17,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:25:17,002 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 64 states. [2018-07-25 13:25:19,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:19,717 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-07-25 13:25:19,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-25 13:25:19,717 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-07-25 13:25:19,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:19,718 INFO L225 Difference]: With dead ends: 131 [2018-07-25 13:25:19,718 INFO L226 Difference]: Without dead ends: 129 [2018-07-25 13:25:19,719 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 13:25:19,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-25 13:25:19,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-07-25 13:25:19,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-25 13:25:19,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-07-25 13:25:19,738 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2018-07-25 13:25:19,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:19,738 INFO L472 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-07-25 13:25:19,738 INFO L473 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-25 13:25:19,738 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-07-25 13:25:19,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-25 13:25:19,739 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:19,739 INFO L354 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2018-07-25 13:25:19,740 INFO L415 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:19,740 INFO L82 PathProgramCache]: Analyzing trace with hash -897999021, now seen corresponding path program 62 times [2018-07-25 13:25:19,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:20,280 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:20,280 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-25 13:25:20,281 INFO L451 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-25 13:25:20,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-25 13:25:20,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:25:20,282 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 65 states. [2018-07-25 13:25:23,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:23,065 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-07-25 13:25:23,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-25 13:25:23,065 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-07-25 13:25:23,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:23,066 INFO L225 Difference]: With dead ends: 133 [2018-07-25 13:25:23,066 INFO L226 Difference]: Without dead ends: 131 [2018-07-25 13:25:23,067 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 13:25:23,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-25 13:25:23,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-07-25 13:25:23,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-25 13:25:23,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-07-25 13:25:23,075 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2018-07-25 13:25:23,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:23,076 INFO L472 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-07-25 13:25:23,076 INFO L473 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-25 13:25:23,076 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-07-25 13:25:23,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-25 13:25:23,077 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:23,077 INFO L354 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2018-07-25 13:25:23,077 INFO L415 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:23,078 INFO L82 PathProgramCache]: Analyzing trace with hash 311419405, now seen corresponding path program 63 times [2018-07-25 13:25:23,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:23,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:23,587 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:23,587 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-25 13:25:23,587 INFO L451 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-25 13:25:23,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-25 13:25:23,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:25:23,589 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 66 states. [2018-07-25 13:25:26,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:26,472 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-25 13:25:26,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-25 13:25:26,472 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-07-25 13:25:26,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:26,473 INFO L225 Difference]: With dead ends: 135 [2018-07-25 13:25:26,474 INFO L226 Difference]: Without dead ends: 133 [2018-07-25 13:25:26,475 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4224, Invalid=12288, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 13:25:26,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-25 13:25:26,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-07-25 13:25:26,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-25 13:25:26,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-07-25 13:25:26,484 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2018-07-25 13:25:26,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:26,485 INFO L472 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-07-25 13:25:26,485 INFO L473 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-25 13:25:26,485 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-07-25 13:25:26,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-25 13:25:26,486 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:26,486 INFO L354 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2018-07-25 13:25:26,486 INFO L415 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:26,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1373610425, now seen corresponding path program 64 times [2018-07-25 13:25:26,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:27,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:27,062 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:27,062 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-25 13:25:27,063 INFO L451 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-25 13:25:27,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-25 13:25:27,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:25:27,063 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 67 states. [2018-07-25 13:25:29,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:29,953 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-07-25 13:25:29,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-25 13:25:29,953 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-07-25 13:25:29,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:29,954 INFO L225 Difference]: With dead ends: 137 [2018-07-25 13:25:29,954 INFO L226 Difference]: Without dead ends: 135 [2018-07-25 13:25:29,955 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 13:25:29,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-25 13:25:29,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-07-25 13:25:29,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-07-25 13:25:29,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-07-25 13:25:29,964 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2018-07-25 13:25:29,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:29,964 INFO L472 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-07-25 13:25:29,964 INFO L473 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-25 13:25:29,964 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-07-25 13:25:29,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-25 13:25:29,965 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:29,965 INFO L354 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2018-07-25 13:25:29,965 INFO L415 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:29,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1484606463, now seen corresponding path program 65 times [2018-07-25 13:25:29,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:30,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:30,429 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:30,429 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-25 13:25:30,429 INFO L451 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-25 13:25:30,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-25 13:25:30,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 13:25:30,430 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 68 states. [2018-07-25 13:25:33,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:33,496 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-07-25 13:25:33,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-25 13:25:33,496 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-07-25 13:25:33,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:33,497 INFO L225 Difference]: With dead ends: 139 [2018-07-25 13:25:33,498 INFO L226 Difference]: Without dead ends: 137 [2018-07-25 13:25:33,499 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 13:25:33,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-25 13:25:33,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-07-25 13:25:33,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-25 13:25:33,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-07-25 13:25:33,510 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2018-07-25 13:25:33,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:33,510 INFO L472 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-07-25 13:25:33,510 INFO L473 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-25 13:25:33,510 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-07-25 13:25:33,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-25 13:25:33,511 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:33,511 INFO L354 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2018-07-25 13:25:33,511 INFO L415 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:33,512 INFO L82 PathProgramCache]: Analyzing trace with hash -777616581, now seen corresponding path program 66 times [2018-07-25 13:25:33,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:34,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:34,061 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:34,061 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-25 13:25:34,061 INFO L451 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-25 13:25:34,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-25 13:25:34,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:25:34,062 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 69 states. [2018-07-25 13:25:37,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:37,190 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-07-25 13:25:37,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-25 13:25:37,190 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-07-25 13:25:37,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:37,191 INFO L225 Difference]: With dead ends: 141 [2018-07-25 13:25:37,191 INFO L226 Difference]: Without dead ends: 139 [2018-07-25 13:25:37,193 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4623, Invalid=13467, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 13:25:37,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-25 13:25:37,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-07-25 13:25:37,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-07-25 13:25:37,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-07-25 13:25:37,200 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2018-07-25 13:25:37,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:37,201 INFO L472 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-07-25 13:25:37,201 INFO L473 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-25 13:25:37,201 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-07-25 13:25:37,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-25 13:25:37,202 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:37,202 INFO L354 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2018-07-25 13:25:37,202 INFO L415 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:37,203 INFO L82 PathProgramCache]: Analyzing trace with hash 34827253, now seen corresponding path program 67 times [2018-07-25 13:25:37,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:37,781 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:37,781 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:37,781 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-25 13:25:37,782 INFO L451 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-25 13:25:37,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-25 13:25:37,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:25:37,783 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 70 states. [2018-07-25 13:25:41,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:41,151 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-07-25 13:25:41,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-25 13:25:41,151 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-07-25 13:25:41,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:41,152 INFO L225 Difference]: With dead ends: 143 [2018-07-25 13:25:41,152 INFO L226 Difference]: Without dead ends: 141 [2018-07-25 13:25:41,153 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4760, Invalid=13872, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 13:25:41,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-25 13:25:41,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-07-25 13:25:41,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-25 13:25:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-07-25 13:25:41,160 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2018-07-25 13:25:41,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:41,160 INFO L472 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-07-25 13:25:41,161 INFO L473 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-25 13:25:41,161 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-07-25 13:25:41,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-25 13:25:41,161 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:41,161 INFO L354 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2018-07-25 13:25:41,161 INFO L415 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:41,162 INFO L82 PathProgramCache]: Analyzing trace with hash -890696145, now seen corresponding path program 68 times [2018-07-25 13:25:41,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:41,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:41,723 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:41,723 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-25 13:25:41,724 INFO L451 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-25 13:25:41,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-25 13:25:41,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:25:41,725 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 71 states. [2018-07-25 13:25:45,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:45,763 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-07-25 13:25:45,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-25 13:25:45,763 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2018-07-25 13:25:45,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:45,764 INFO L225 Difference]: With dead ends: 145 [2018-07-25 13:25:45,764 INFO L226 Difference]: Without dead ends: 143 [2018-07-25 13:25:45,765 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4899, Invalid=14283, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 13:25:45,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-25 13:25:45,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-07-25 13:25:45,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-25 13:25:45,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-07-25 13:25:45,774 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2018-07-25 13:25:45,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:45,774 INFO L472 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-07-25 13:25:45,774 INFO L473 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-25 13:25:45,774 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-07-25 13:25:45,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-25 13:25:45,775 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:45,775 INFO L354 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1] [2018-07-25 13:25:45,775 INFO L415 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:45,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1260451351, now seen corresponding path program 69 times [2018-07-25 13:25:45,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:46,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:46,325 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:46,325 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-25 13:25:46,325 INFO L451 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-25 13:25:46,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-25 13:25:46,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:25:46,326 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 72 states. [2018-07-25 13:25:49,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:49,765 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-07-25 13:25:49,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-25 13:25:49,766 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-07-25 13:25:49,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:49,767 INFO L225 Difference]: With dead ends: 147 [2018-07-25 13:25:49,767 INFO L226 Difference]: Without dead ends: 145 [2018-07-25 13:25:49,768 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5040, Invalid=14700, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 13:25:49,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-25 13:25:49,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-07-25 13:25:49,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-25 13:25:49,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-07-25 13:25:49,777 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2018-07-25 13:25:49,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:49,778 INFO L472 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-07-25 13:25:49,778 INFO L473 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-25 13:25:49,778 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-07-25 13:25:49,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-25 13:25:49,779 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:49,779 INFO L354 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1] [2018-07-25 13:25:49,779 INFO L415 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:49,779 INFO L82 PathProgramCache]: Analyzing trace with hash -112918749, now seen corresponding path program 70 times [2018-07-25 13:25:49,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:50,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:50,393 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:50,393 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-25 13:25:50,393 INFO L451 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-25 13:25:50,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-25 13:25:50,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:25:50,394 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 73 states. [2018-07-25 13:25:53,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:53,902 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-07-25 13:25:53,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-25 13:25:53,902 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-07-25 13:25:53,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:53,903 INFO L225 Difference]: With dead ends: 149 [2018-07-25 13:25:53,903 INFO L226 Difference]: Without dead ends: 147 [2018-07-25 13:25:53,905 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5183, Invalid=15123, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 13:25:53,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-25 13:25:53,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-07-25 13:25:53,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-25 13:25:53,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-07-25 13:25:53,915 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2018-07-25 13:25:53,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:53,915 INFO L472 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-07-25 13:25:53,915 INFO L473 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-25 13:25:53,915 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-07-25 13:25:53,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-25 13:25:53,916 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:53,916 INFO L354 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1] [2018-07-25 13:25:53,917 INFO L415 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:53,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1140683299, now seen corresponding path program 71 times [2018-07-25 13:25:53,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:54,538 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:54,539 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:54,539 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-25 13:25:54,539 INFO L451 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-25 13:25:54,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-25 13:25:54,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:25:54,540 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 74 states. [2018-07-25 13:25:58,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:58,638 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-07-25 13:25:58,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-25 13:25:58,638 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-07-25 13:25:58,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:58,639 INFO L225 Difference]: With dead ends: 151 [2018-07-25 13:25:58,639 INFO L226 Difference]: Without dead ends: 149 [2018-07-25 13:25:58,640 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5328, Invalid=15552, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 13:25:58,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-25 13:25:58,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-07-25 13:25:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-25 13:25:58,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-07-25 13:25:58,651 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2018-07-25 13:25:58,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:58,651 INFO L472 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-07-25 13:25:58,651 INFO L473 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-25 13:25:58,652 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-07-25 13:25:58,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-25 13:25:58,652 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:58,652 INFO L354 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1] [2018-07-25 13:25:58,653 INFO L415 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:58,653 INFO L82 PathProgramCache]: Analyzing trace with hash -979937769, now seen corresponding path program 72 times [2018-07-25 13:25:58,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:59,352 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:59,352 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:59,352 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-25 13:25:59,353 INFO L451 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-25 13:25:59,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-25 13:25:59,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:25:59,354 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 75 states. [2018-07-25 13:26:03,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:03,704 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-07-25 13:26:03,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-25 13:26:03,705 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-07-25 13:26:03,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:03,706 INFO L225 Difference]: With dead ends: 153 [2018-07-25 13:26:03,706 INFO L226 Difference]: Without dead ends: 151 [2018-07-25 13:26:03,707 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5475, Invalid=15987, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 13:26:03,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-25 13:26:03,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-07-25 13:26:03,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-25 13:26:03,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-07-25 13:26:03,716 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2018-07-25 13:26:03,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:03,717 INFO L472 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-07-25 13:26:03,717 INFO L473 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-25 13:26:03,717 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-07-25 13:26:03,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-25 13:26:03,717 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:03,718 INFO L354 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1] [2018-07-25 13:26:03,718 INFO L415 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:03,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1122306095, now seen corresponding path program 73 times [2018-07-25 13:26:03,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:04,423 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:04,423 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-25 13:26:04,424 INFO L451 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-25 13:26:04,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-25 13:26:04,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:26:04,424 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 76 states. [2018-07-25 13:26:08,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:08,679 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-07-25 13:26:08,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-25 13:26:08,680 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-07-25 13:26:08,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:08,680 INFO L225 Difference]: With dead ends: 155 [2018-07-25 13:26:08,680 INFO L226 Difference]: Without dead ends: 153 [2018-07-25 13:26:08,681 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5624, Invalid=16428, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 13:26:08,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-25 13:26:08,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-07-25 13:26:08,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-25 13:26:08,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-07-25 13:26:08,692 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2018-07-25 13:26:08,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:08,692 INFO L472 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-07-25 13:26:08,693 INFO L473 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-25 13:26:08,693 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-07-25 13:26:08,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-25 13:26:08,693 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:08,694 INFO L354 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1] [2018-07-25 13:26:08,694 INFO L415 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:08,694 INFO L82 PathProgramCache]: Analyzing trace with hash -499313909, now seen corresponding path program 74 times [2018-07-25 13:26:08,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:09,574 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:09,574 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:09,574 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-25 13:26:09,575 INFO L451 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-25 13:26:09,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-25 13:26:09,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:26:09,576 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 77 states. [2018-07-25 13:26:13,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:13,911 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-07-25 13:26:13,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-25 13:26:13,911 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2018-07-25 13:26:13,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:13,912 INFO L225 Difference]: With dead ends: 157 [2018-07-25 13:26:13,912 INFO L226 Difference]: Without dead ends: 155 [2018-07-25 13:26:13,913 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5775, Invalid=16875, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 13:26:13,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-25 13:26:13,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-25 13:26:13,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-25 13:26:13,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-07-25 13:26:13,923 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2018-07-25 13:26:13,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:13,923 INFO L472 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-07-25 13:26:13,923 INFO L473 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-25 13:26:13,923 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-07-25 13:26:13,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-25 13:26:13,924 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:13,924 INFO L354 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1] [2018-07-25 13:26:13,924 INFO L415 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:13,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1195722693, now seen corresponding path program 75 times [2018-07-25 13:26:13,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:14,603 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:14,603 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:14,603 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-25 13:26:14,603 INFO L451 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-25 13:26:14,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-25 13:26:14,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:26:14,604 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 78 states. [2018-07-25 13:26:18,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:18,969 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-07-25 13:26:18,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-25 13:26:18,969 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-07-25 13:26:18,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:18,970 INFO L225 Difference]: With dead ends: 159 [2018-07-25 13:26:18,970 INFO L226 Difference]: Without dead ends: 157 [2018-07-25 13:26:18,971 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5928, Invalid=17328, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 13:26:18,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-25 13:26:18,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-07-25 13:26:18,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-07-25 13:26:18,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-07-25 13:26:18,981 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2018-07-25 13:26:18,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:18,982 INFO L472 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-07-25 13:26:18,982 INFO L473 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-25 13:26:18,982 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-07-25 13:26:18,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-25 13:26:18,983 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:18,983 INFO L354 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1] [2018-07-25 13:26:18,983 INFO L415 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:18,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1961675265, now seen corresponding path program 76 times [2018-07-25 13:26:18,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:19,832 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:19,833 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:19,833 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-25 13:26:19,833 INFO L451 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-25 13:26:19,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-25 13:26:19,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:26:19,834 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 79 states. [2018-07-25 13:26:24,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:24,473 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-07-25 13:26:24,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-25 13:26:24,473 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-07-25 13:26:24,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:24,474 INFO L225 Difference]: With dead ends: 161 [2018-07-25 13:26:24,475 INFO L226 Difference]: Without dead ends: 159 [2018-07-25 13:26:24,476 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6083, Invalid=17787, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 13:26:24,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-07-25 13:26:24,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-07-25 13:26:24,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-07-25 13:26:24,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-07-25 13:26:24,486 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2018-07-25 13:26:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:24,486 INFO L472 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-07-25 13:26:24,486 INFO L473 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-25 13:26:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-07-25 13:26:24,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-25 13:26:24,487 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:24,487 INFO L354 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1] [2018-07-25 13:26:24,487 INFO L415 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:24,488 INFO L82 PathProgramCache]: Analyzing trace with hash 320765369, now seen corresponding path program 77 times [2018-07-25 13:26:24,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:25,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:25,305 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:25,305 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-25 13:26:25,306 INFO L451 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-25 13:26:25,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-25 13:26:25,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 13:26:25,306 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 80 states. [2018-07-25 13:26:30,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:30,510 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-07-25 13:26:30,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-25 13:26:30,510 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-07-25 13:26:30,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:30,511 INFO L225 Difference]: With dead ends: 163 [2018-07-25 13:26:30,511 INFO L226 Difference]: Without dead ends: 161 [2018-07-25 13:26:30,512 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=6240, Invalid=18252, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 13:26:30,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-07-25 13:26:30,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-07-25 13:26:30,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-25 13:26:30,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-07-25 13:26:30,519 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2018-07-25 13:26:30,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:30,519 INFO L472 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-07-25 13:26:30,519 INFO L473 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-25 13:26:30,519 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-07-25 13:26:30,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-25 13:26:30,520 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:30,520 INFO L354 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1] [2018-07-25 13:26:30,520 INFO L415 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:30,520 INFO L82 PathProgramCache]: Analyzing trace with hash -982073613, now seen corresponding path program 78 times [2018-07-25 13:26:30,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:31,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:31,371 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:31,371 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-25 13:26:31,371 INFO L451 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-25 13:26:31,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-25 13:26:31,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:26:31,372 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 81 states. [2018-07-25 13:26:36,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:36,561 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-07-25 13:26:36,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-25 13:26:36,561 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-07-25 13:26:36,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:36,562 INFO L225 Difference]: With dead ends: 165 [2018-07-25 13:26:36,562 INFO L226 Difference]: Without dead ends: 163 [2018-07-25 13:26:36,564 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=6399, Invalid=18723, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 13:26:36,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-25 13:26:36,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-07-25 13:26:36,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-25 13:26:36,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-07-25 13:26:36,572 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2018-07-25 13:26:36,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:36,572 INFO L472 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-07-25 13:26:36,572 INFO L473 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-25 13:26:36,572 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-07-25 13:26:36,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-25 13:26:36,573 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:36,573 INFO L354 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1] [2018-07-25 13:26:36,573 INFO L415 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:36,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1120115117, now seen corresponding path program 79 times [2018-07-25 13:26:36,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:37,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:37,326 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:37,327 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-25 13:26:37,327 INFO L451 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-25 13:26:37,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-25 13:26:37,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 13:26:37,328 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 82 states. [2018-07-25 13:26:42,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:42,425 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-07-25 13:26:42,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-25 13:26:42,426 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-07-25 13:26:42,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:42,426 INFO L225 Difference]: With dead ends: 167 [2018-07-25 13:26:42,426 INFO L226 Difference]: Without dead ends: 165 [2018-07-25 13:26:42,428 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=6560, Invalid=19200, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 13:26:42,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-07-25 13:26:42,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-07-25 13:26:42,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-07-25 13:26:42,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-07-25 13:26:42,438 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2018-07-25 13:26:42,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:42,439 INFO L472 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-07-25 13:26:42,439 INFO L473 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-25 13:26:42,439 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-07-25 13:26:42,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-25 13:26:42,439 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:42,440 INFO L354 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1] [2018-07-25 13:26:42,440 INFO L415 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:42,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1606111769, now seen corresponding path program 80 times [2018-07-25 13:26:42,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:43,247 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:43,248 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:43,248 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-25 13:26:43,248 INFO L451 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-25 13:26:43,248 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-25 13:26:43,249 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:26:43,249 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 83 states. [2018-07-25 13:26:48,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:48,610 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-07-25 13:26:48,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-25 13:26:48,610 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2018-07-25 13:26:48,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:48,611 INFO L225 Difference]: With dead ends: 169 [2018-07-25 13:26:48,611 INFO L226 Difference]: Without dead ends: 167 [2018-07-25 13:26:48,612 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=6723, Invalid=19683, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 13:26:48,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-25 13:26:48,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-07-25 13:26:48,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-07-25 13:26:48,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-07-25 13:26:48,619 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2018-07-25 13:26:48,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:48,619 INFO L472 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-07-25 13:26:48,619 INFO L473 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-25 13:26:48,619 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-07-25 13:26:48,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-07-25 13:26:48,620 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:48,620 INFO L354 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1] [2018-07-25 13:26:48,620 INFO L415 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:48,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1580098655, now seen corresponding path program 81 times [2018-07-25 13:26:48,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:49,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:49,521 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:49,521 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-25 13:26:49,521 INFO L451 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-25 13:26:49,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-25 13:26:49,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 13:26:49,522 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 84 states. [2018-07-25 13:26:55,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:55,327 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-07-25 13:26:55,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-25 13:26:55,327 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-07-25 13:26:55,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:55,328 INFO L225 Difference]: With dead ends: 171 [2018-07-25 13:26:55,329 INFO L226 Difference]: Without dead ends: 169 [2018-07-25 13:26:55,330 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3240 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=6888, Invalid=20172, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 13:26:55,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-07-25 13:26:55,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-07-25 13:26:55,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-07-25 13:26:55,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-07-25 13:26:55,338 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2018-07-25 13:26:55,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:55,339 INFO L472 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-07-25 13:26:55,339 INFO L473 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-25 13:26:55,339 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-07-25 13:26:55,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-07-25 13:26:55,340 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:55,340 INFO L354 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1] [2018-07-25 13:26:55,340 INFO L415 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:55,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1943667419, now seen corresponding path program 82 times [2018-07-25 13:26:55,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:56,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:56,323 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:56,323 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-25 13:26:56,323 INFO L451 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-25 13:26:56,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-25 13:26:56,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:26:56,324 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 85 states. [2018-07-25 13:27:02,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:02,381 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-07-25 13:27:02,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-25 13:27:02,381 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2018-07-25 13:27:02,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:02,383 INFO L225 Difference]: With dead ends: 173 [2018-07-25 13:27:02,383 INFO L226 Difference]: Without dead ends: 171 [2018-07-25 13:27:02,384 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=7055, Invalid=20667, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 13:27:02,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-07-25 13:27:02,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-07-25 13:27:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-07-25 13:27:02,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-07-25 13:27:02,395 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2018-07-25 13:27:02,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:02,396 INFO L472 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-07-25 13:27:02,396 INFO L473 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-25 13:27:02,396 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-07-25 13:27:02,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-25 13:27:02,397 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:02,397 INFO L354 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1] [2018-07-25 13:27:02,397 INFO L415 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:02,397 INFO L82 PathProgramCache]: Analyzing trace with hash -446332011, now seen corresponding path program 83 times [2018-07-25 13:27:02,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:03,404 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:03,404 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:03,404 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-25 13:27:03,404 INFO L451 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-25 13:27:03,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-25 13:27:03,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 13:27:03,405 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 86 states. [2018-07-25 13:27:09,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:09,619 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-07-25 13:27:09,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-25 13:27:09,619 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-07-25 13:27:09,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:09,620 INFO L225 Difference]: With dead ends: 175 [2018-07-25 13:27:09,620 INFO L226 Difference]: Without dead ends: 173 [2018-07-25 13:27:09,622 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3403 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=7224, Invalid=21168, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 13:27:09,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-07-25 13:27:09,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-07-25 13:27:09,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-25 13:27:09,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-07-25 13:27:09,632 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2018-07-25 13:27:09,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:09,632 INFO L472 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-07-25 13:27:09,632 INFO L473 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-25 13:27:09,633 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-07-25 13:27:09,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-25 13:27:09,633 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:09,634 INFO L354 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1] [2018-07-25 13:27:09,634 INFO L415 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:09,634 INFO L82 PathProgramCache]: Analyzing trace with hash 571719119, now seen corresponding path program 84 times [2018-07-25 13:27:09,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:10,652 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:10,653 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:10,653 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-25 13:27:10,653 INFO L451 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-25 13:27:10,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-25 13:27:10,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:27:10,654 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 87 states. [2018-07-25 13:27:16,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:16,894 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-07-25 13:27:16,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-25 13:27:16,894 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2018-07-25 13:27:16,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:16,895 INFO L225 Difference]: With dead ends: 177 [2018-07-25 13:27:16,895 INFO L226 Difference]: Without dead ends: 175 [2018-07-25 13:27:16,897 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=7395, Invalid=21675, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 13:27:16,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-07-25 13:27:16,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-07-25 13:27:16,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-07-25 13:27:16,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-07-25 13:27:16,907 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2018-07-25 13:27:16,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:16,907 INFO L472 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-07-25 13:27:16,908 INFO L473 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-25 13:27:16,908 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-07-25 13:27:16,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-07-25 13:27:16,908 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:16,909 INFO L354 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1] [2018-07-25 13:27:16,909 INFO L415 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:16,909 INFO L82 PathProgramCache]: Analyzing trace with hash -333688439, now seen corresponding path program 85 times [2018-07-25 13:27:16,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:17,895 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:17,895 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:17,896 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-25 13:27:17,896 INFO L451 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-25 13:27:17,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-25 13:27:17,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 13:27:17,897 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 88 states. [2018-07-25 13:27:24,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:24,543 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-07-25 13:27:24,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-25 13:27:24,543 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-07-25 13:27:24,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:24,544 INFO L225 Difference]: With dead ends: 179 [2018-07-25 13:27:24,544 INFO L226 Difference]: Without dead ends: 177 [2018-07-25 13:27:24,546 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=7568, Invalid=22188, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 13:27:24,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-07-25 13:27:24,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-07-25 13:27:24,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-07-25 13:27:24,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-07-25 13:27:24,553 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2018-07-25 13:27:24,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:24,553 INFO L472 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-07-25 13:27:24,553 INFO L473 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-25 13:27:24,554 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-07-25 13:27:24,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-25 13:27:24,554 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:24,555 INFO L354 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1] [2018-07-25 13:27:24,555 INFO L415 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:24,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1448009411, now seen corresponding path program 86 times [2018-07-25 13:27:24,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:25,556 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:25,556 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:25,556 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-25 13:27:25,557 INFO L451 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-25 13:27:25,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-25 13:27:25,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:27:25,558 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 89 states. [2018-07-25 13:27:32,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:32,093 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-07-25 13:27:32,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-25 13:27:32,093 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2018-07-25 13:27:32,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:32,094 INFO L225 Difference]: With dead ends: 181 [2018-07-25 13:27:32,094 INFO L226 Difference]: Without dead ends: 179 [2018-07-25 13:27:32,095 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=7743, Invalid=22707, Unknown=0, NotChecked=0, Total=30450 [2018-07-25 13:27:32,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-25 13:27:32,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-07-25 13:27:32,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-07-25 13:27:32,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-07-25 13:27:32,101 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2018-07-25 13:27:32,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:32,102 INFO L472 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-07-25 13:27:32,102 INFO L473 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-25 13:27:32,102 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-07-25 13:27:32,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-25 13:27:32,102 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:32,103 INFO L354 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1] [2018-07-25 13:27:32,103 INFO L415 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:32,103 INFO L82 PathProgramCache]: Analyzing trace with hash -32307843, now seen corresponding path program 87 times [2018-07-25 13:27:32,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:33,111 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:33,111 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:33,111 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-25 13:27:33,112 INFO L451 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-25 13:27:33,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-25 13:27:33,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 13:27:33,113 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 90 states. [2018-07-25 13:27:40,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:40,093 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-07-25 13:27:40,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-25 13:27:40,093 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-07-25 13:27:40,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:40,094 INFO L225 Difference]: With dead ends: 183 [2018-07-25 13:27:40,094 INFO L226 Difference]: Without dead ends: 181 [2018-07-25 13:27:40,096 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3741 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=7920, Invalid=23232, Unknown=0, NotChecked=0, Total=31152 [2018-07-25 13:27:40,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-07-25 13:27:40,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-07-25 13:27:40,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-25 13:27:40,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-07-25 13:27:40,105 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2018-07-25 13:27:40,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:40,105 INFO L472 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-07-25 13:27:40,105 INFO L473 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-25 13:27:40,105 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-07-25 13:27:40,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-25 13:27:40,106 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:40,107 INFO L354 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1] [2018-07-25 13:27:40,107 INFO L415 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:40,107 INFO L82 PathProgramCache]: Analyzing trace with hash -983013961, now seen corresponding path program 88 times [2018-07-25 13:27:40,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:41,210 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:41,211 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:41,211 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-25 13:27:41,211 INFO L451 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-25 13:27:41,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-25 13:27:41,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:27:41,212 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 91 states. [2018-07-25 13:27:48,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:48,677 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-07-25 13:27:48,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-25 13:27:48,678 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2018-07-25 13:27:48,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:48,678 INFO L225 Difference]: With dead ends: 185 [2018-07-25 13:27:48,678 INFO L226 Difference]: Without dead ends: 183 [2018-07-25 13:27:48,680 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=8099, Invalid=23763, Unknown=0, NotChecked=0, Total=31862 [2018-07-25 13:27:48,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-25 13:27:48,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-07-25 13:27:48,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-25 13:27:48,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-07-25 13:27:48,687 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2018-07-25 13:27:48,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:48,687 INFO L472 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-07-25 13:27:48,687 INFO L473 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-25 13:27:48,687 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-07-25 13:27:48,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-07-25 13:27:48,688 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:48,688 INFO L354 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1] [2018-07-25 13:27:48,688 INFO L415 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:48,689 INFO L82 PathProgramCache]: Analyzing trace with hash 216440689, now seen corresponding path program 89 times [2018-07-25 13:27:48,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:49,792 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:49,792 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:49,793 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-25 13:27:49,793 INFO L451 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-25 13:27:49,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-25 13:27:49,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 13:27:49,794 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 92 states. [2018-07-25 13:27:57,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:57,235 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-07-25 13:27:57,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-25 13:27:57,235 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2018-07-25 13:27:57,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:57,236 INFO L225 Difference]: With dead ends: 187 [2018-07-25 13:27:57,236 INFO L226 Difference]: Without dead ends: 185 [2018-07-25 13:27:57,237 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3916 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=8280, Invalid=24300, Unknown=0, NotChecked=0, Total=32580 [2018-07-25 13:27:57,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-25 13:27:57,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-07-25 13:27:57,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-25 13:27:57,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-07-25 13:27:57,245 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2018-07-25 13:27:57,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:57,245 INFO L472 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-07-25 13:27:57,245 INFO L473 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-25 13:27:57,245 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-07-25 13:27:57,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-25 13:27:57,246 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:57,246 INFO L354 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1] [2018-07-25 13:27:57,246 INFO L415 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:57,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1841124011, now seen corresponding path program 90 times [2018-07-25 13:27:57,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:58,459 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:58,460 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:58,460 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-25 13:27:58,460 INFO L451 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-25 13:27:58,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-25 13:27:58,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:27:58,461 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 93 states. [2018-07-25 13:28:05,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:05,776 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-07-25 13:28:05,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-25 13:28:05,776 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2018-07-25 13:28:05,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:05,777 INFO L225 Difference]: With dead ends: 189 [2018-07-25 13:28:05,777 INFO L226 Difference]: Without dead ends: 187 [2018-07-25 13:28:05,779 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=8463, Invalid=24843, Unknown=0, NotChecked=0, Total=33306 [2018-07-25 13:28:05,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-07-25 13:28:05,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-07-25 13:28:05,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-07-25 13:28:05,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-07-25 13:28:05,785 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2018-07-25 13:28:05,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:05,785 INFO L472 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-07-25 13:28:05,785 INFO L473 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-25 13:28:05,785 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-07-25 13:28:05,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-07-25 13:28:05,786 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:05,786 INFO L354 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1] [2018-07-25 13:28:05,787 INFO L415 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:05,787 INFO L82 PathProgramCache]: Analyzing trace with hash -206299291, now seen corresponding path program 91 times [2018-07-25 13:28:05,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:06,946 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:06,947 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:06,947 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-25 13:28:06,947 INFO L451 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-25 13:28:06,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-25 13:28:06,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 13:28:06,948 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 94 states. Received shutdown request... [2018-07-25 13:28:12,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 13:28:12,729 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 13:28:12,736 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 13:28:12,737 INFO L202 PluginConnector]: Adding new model count_by_k.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:28:12 BoogieIcfgContainer [2018-07-25 13:28:12,737 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:28:12,738 INFO L168 Benchmark]: Toolchain (without parser) took 248428.11 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -270.1 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-07-25 13:28:12,740 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:28:12,740 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:28:12,740 INFO L168 Benchmark]: Boogie Preprocessor took 20.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:28:12,741 INFO L168 Benchmark]: RCFGBuilder took 235.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 13:28:12,741 INFO L168 Benchmark]: TraceAbstraction took 248126.46 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -280.7 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2018-07-25 13:28:12,744 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 235.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 248126.46 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -280.7 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 38). Cancelled while BasicCegarLoop was constructing difference of abstraction (187states) and interpolant automaton (currently 62 states, 94 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 154 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 248.0s OverallTime, 92 OverallIterations, 92 TraceHistogramMax, 208.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 457 SDtfs, 0 SDslu, 8432 SDs, 0 SdLazy, 8797 SolverSat, 4094 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8525 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 8432 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123315 ImplicationChecksByTransitivity, 219.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187occurred in iteration=91, 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.7s AutomataMinimizationTime, 91 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 16.4s SatisfiabilityAnalysisTime, 20.8s InterpolantComputationTime, 8740 NumberOfCodeBlocks, 8740 NumberOfCodeBlocksAsserted, 92 NumberOfCheckSat, 8648 ConstructedInterpolants, 0 QuantifiedInterpolants, 5293080 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 92 InterpolantComputations, 1 PerfectInterpolantSequences, 0/259532 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/count_by_k.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-28-12-765.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/count_by_k.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-28-12-765.csv Completed graceful shutdown