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/simple4.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:29:14,757 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:29:14,759 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:29:14,773 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:29:14,774 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:29:14,776 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:29:14,777 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:29:14,781 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:29:14,784 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:29:14,790 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:29:14,791 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:29:14,792 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:29:14,793 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:29:14,794 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:29:14,795 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:29:14,796 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:29:14,797 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:29:14,799 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:29:14,801 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:29:14,802 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:29:14,804 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:29:14,805 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:29:14,807 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:29:14,808 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:29:14,808 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:29:14,809 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:29:14,810 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:29:14,811 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:29:14,812 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:29:14,813 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:29:14,813 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:29:14,814 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:29:14,814 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:29:14,814 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:29:14,815 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:29:14,816 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:29:14,816 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:29:14,825 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:29:14,825 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:29:14,827 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:29:14,827 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:29:14,827 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:29:14,828 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:29:14,828 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:29:14,828 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:29:14,905 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:29:14,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:29:14,928 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:29:14,929 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:29:14,930 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:29:14,931 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/simple4.i_3.bpl [2018-07-25 13:29:14,931 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/simple4.i_3.bpl' [2018-07-25 13:29:14,998 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:29:15,000 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:29:15,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:29:15,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:29:15,001 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:29:15,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:14" (1/1) ... [2018-07-25 13:29:15,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:14" (1/1) ... [2018-07-25 13:29:15,046 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:29:15,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:29:15,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:29:15,048 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:29:15,060 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:14" (1/1) ... [2018-07-25 13:29:15,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:14" (1/1) ... [2018-07-25 13:29:15,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:14" (1/1) ... [2018-07-25 13:29:15,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:14" (1/1) ... [2018-07-25 13:29:15,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:14" (1/1) ... [2018-07-25 13:29:15,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:14" (1/1) ... [2018-07-25 13:29:15,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:14" (1/1) ... [2018-07-25 13:29:15,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:29:15,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:29:15,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:29:15,074 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:29:15,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:14" (1/1) ... [2018-07-25 13:29:15,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 13:29:15,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 13:29:15,356 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 13:29:15,357 INFO L202 PluginConnector]: Adding new model simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:29:15 BoogieIcfgContainer [2018-07-25 13:29:15,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:29:15,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:29:15,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:29:15,365 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:29:15,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:29:14" (1/2) ... [2018-07-25 13:29:15,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c6119c and model type simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:29:15, skipping insertion in model container [2018-07-25 13:29:15,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:29:15" (2/2) ... [2018-07-25 13:29:15,370 INFO L112 eAbstractionObserver]: Analyzing ICFG simple4.i_3.bpl [2018-07-25 13:29:15,381 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:29:15,390 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:29:15,433 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:29:15,434 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:29:15,434 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:29:15,435 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:29:15,435 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:29:15,435 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:29:15,435 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:29:15,436 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:29:15,436 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:29:15,453 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-25 13:29:15,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 13:29:15,463 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:15,464 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 13:29:15,465 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:15,471 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-07-25 13:29:15,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:15,585 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:29:15,590 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:29:15,590 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:29:15,600 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:29:15,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:29:15,616 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:29:15,619 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-07-25 13:29:15,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:15,650 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-07-25 13:29:15,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:29:15,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-07-25 13:29:15,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:15,666 INFO L225 Difference]: With dead ends: 10 [2018-07-25 13:29:15,666 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 13:29:15,670 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:29:15,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 13:29:15,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 13:29:15,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 13:29:15,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 13:29:15,711 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-25 13:29:15,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:15,712 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 13:29:15,712 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:29:15,712 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 13:29:15,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:29:15,713 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:15,713 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-25 13:29:15,714 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:15,714 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-07-25 13:29:15,714 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:15,776 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:29:15,777 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:15,777 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 13:29:15,781 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:29:15,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:29:15,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:29:15,782 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-07-25 13:29:15,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:15,824 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 13:29:15,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:29:15,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-07-25 13:29:15,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:15,828 INFO L225 Difference]: With dead ends: 11 [2018-07-25 13:29:15,828 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 13:29:15,830 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:29:15,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 13:29:15,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 13:29:15,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 13:29:15,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 13:29:15,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-25 13:29:15,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:15,840 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 13:29:15,840 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:29:15,840 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 13:29:15,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:29:15,841 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:15,841 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-25 13:29:15,841 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:15,842 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-07-25 13:29:15,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:15,904 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:29:15,904 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:15,905 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:29:15,905 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:29:15,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:29:15,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:29:15,906 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-07-25 13:29:15,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:15,943 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 13:29:15,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:29:15,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-07-25 13:29:15,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:15,946 INFO L225 Difference]: With dead ends: 13 [2018-07-25 13:29:15,946 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 13:29:15,947 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:29:15,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 13:29:15,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 13:29:15,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 13:29:15,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 13:29:15,956 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-25 13:29:15,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:15,956 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 13:29:15,956 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:29:15,957 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 13:29:15,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:29:15,958 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:15,960 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-25 13:29:15,960 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:15,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-07-25 13:29:15,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:16,049 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:29:16,050 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:16,050 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:29:16,050 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:29:16,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:29:16,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:29:16,052 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-07-25 13:29:16,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:16,086 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 13:29:16,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:29:16,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-07-25 13:29:16,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:16,088 INFO L225 Difference]: With dead ends: 15 [2018-07-25 13:29:16,088 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 13:29:16,089 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:29:16,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 13:29:16,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 13:29:16,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 13:29:16,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 13:29:16,094 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-07-25 13:29:16,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:16,095 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 13:29:16,095 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:29:16,095 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 13:29:16,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:29:16,096 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:16,096 INFO L354 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-07-25 13:29:16,096 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:16,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-07-25 13:29:16,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:16,155 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:29:16,156 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:16,156 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:29:16,160 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:29:16,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:29:16,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:29:16,161 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-07-25 13:29:16,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:16,233 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 13:29:16,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:29:16,234 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-07-25 13:29:16,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:16,235 INFO L225 Difference]: With dead ends: 17 [2018-07-25 13:29:16,235 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 13:29:16,237 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:29:16,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 13:29:16,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 13:29:16,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 13:29:16,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 13:29:16,248 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-07-25 13:29:16,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:16,249 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 13:29:16,249 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:29:16,249 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 13:29:16,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 13:29:16,250 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:16,250 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-25 13:29:16,252 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:16,253 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-07-25 13:29:16,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:16,370 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:29:16,370 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:16,371 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:29:16,371 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:29:16,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:29:16,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:29:16,374 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-07-25 13:29:16,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:16,459 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-25 13:29:16,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:29:16,460 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-25 13:29:16,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:16,461 INFO L225 Difference]: With dead ends: 19 [2018-07-25 13:29:16,461 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 13:29:16,462 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:29:16,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 13:29:16,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 13:29:16,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 13:29:16,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-25 13:29:16,474 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-07-25 13:29:16,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:16,475 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-25 13:29:16,475 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:29:16,476 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-25 13:29:16,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:29:16,476 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:16,477 INFO L354 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-07-25 13:29:16,477 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:16,477 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-07-25 13:29:16,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:16,587 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:29:16,587 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:16,588 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:29:16,588 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:29:16,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:29:16,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:29:16,589 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-07-25 13:29:16,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:16,668 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-25 13:29:16,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:29:16,669 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-25 13:29:16,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:16,671 INFO L225 Difference]: With dead ends: 21 [2018-07-25 13:29:16,671 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 13:29:16,672 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:29:16,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 13:29:16,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 13:29:16,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 13:29:16,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-25 13:29:16,683 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-07-25 13:29:16,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:16,684 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-25 13:29:16,684 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:29:16,686 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-25 13:29:16,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:29:16,687 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:16,687 INFO L354 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-07-25 13:29:16,688 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:16,688 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-07-25 13:29:16,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:16,756 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:29:16,757 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:16,757 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:29:16,757 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:29:16,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:29:16,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:29:16,759 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-07-25 13:29:16,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:16,829 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-25 13:29:16,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:29:16,830 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-25 13:29:16,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:16,831 INFO L225 Difference]: With dead ends: 23 [2018-07-25 13:29:16,831 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 13:29:16,832 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:29:16,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 13:29:16,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 13:29:16,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 13:29:16,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-25 13:29:16,846 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-07-25 13:29:16,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:16,846 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-25 13:29:16,846 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:29:16,847 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-25 13:29:16,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:29:16,850 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:16,850 INFO L354 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-07-25 13:29:16,850 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:16,851 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-07-25 13:29:16,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:16,912 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:29:16,912 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:16,912 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:29:16,913 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:29:16,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:29:16,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:29:16,914 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-07-25 13:29:16,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:16,961 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-25 13:29:16,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:29:16,963 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 13:29:16,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:16,963 INFO L225 Difference]: With dead ends: 25 [2018-07-25 13:29:16,964 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 13:29:16,966 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:29:16,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 13:29:16,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 13:29:16,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 13:29:16,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-25 13:29:16,975 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-07-25 13:29:16,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:16,980 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-25 13:29:16,980 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:29:16,980 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-25 13:29:16,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:29:16,981 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:16,981 INFO L354 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-07-25 13:29:16,982 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:16,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2018-07-25 13:29:16,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:17,047 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:29:17,047 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:17,048 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:29:17,048 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:29:17,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:29:17,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:29:17,049 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2018-07-25 13:29:17,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:17,095 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-25 13:29:17,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:29:17,096 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-07-25 13:29:17,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:17,097 INFO L225 Difference]: With dead ends: 27 [2018-07-25 13:29:17,097 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 13:29:17,098 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:29:17,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 13:29:17,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 13:29:17,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 13:29:17,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-25 13:29:17,104 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-07-25 13:29:17,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:17,104 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-25 13:29:17,104 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:29:17,104 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-25 13:29:17,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 13:29:17,105 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:17,106 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-07-25 13:29:17,106 INFO L415 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:17,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2018-07-25 13:29:17,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:17,178 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:29:17,179 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:17,179 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:29:17,179 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:29:17,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:29:17,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:29:17,180 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2018-07-25 13:29:17,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:17,234 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-25 13:29:17,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:29:17,235 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-07-25 13:29:17,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:17,236 INFO L225 Difference]: With dead ends: 29 [2018-07-25 13:29:17,236 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 13:29:17,237 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:29:17,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 13:29:17,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 13:29:17,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 13:29:17,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-25 13:29:17,245 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-07-25 13:29:17,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:17,246 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-25 13:29:17,246 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:29:17,246 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-25 13:29:17,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 13:29:17,249 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:17,249 INFO L354 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-07-25 13:29:17,250 INFO L415 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:17,250 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2018-07-25 13:29:17,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:17,336 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:29:17,336 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:17,337 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:29:17,337 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:29:17,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:29:17,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:29:17,338 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-07-25 13:29:17,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:17,397 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-25 13:29:17,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:29:17,398 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-07-25 13:29:17,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:17,399 INFO L225 Difference]: With dead ends: 31 [2018-07-25 13:29:17,399 INFO L226 Difference]: Without dead ends: 29 [2018-07-25 13:29:17,400 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:29:17,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-25 13:29:17,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-25 13:29:17,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 13:29:17,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-25 13:29:17,406 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-07-25 13:29:17,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:17,407 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-25 13:29:17,407 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:29:17,407 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-25 13:29:17,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 13:29:17,408 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:17,408 INFO L354 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-07-25 13:29:17,408 INFO L415 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:17,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2018-07-25 13:29:17,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:17,492 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:29:17,493 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:17,493 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:29:17,493 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:29:17,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:29:17,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:29:17,495 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-07-25 13:29:17,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:17,560 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-25 13:29:17,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:29:17,560 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-07-25 13:29:17,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:17,561 INFO L225 Difference]: With dead ends: 33 [2018-07-25 13:29:17,561 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 13:29:17,562 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:29:17,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 13:29:17,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-25 13:29:17,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 13:29:17,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-25 13:29:17,571 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-07-25 13:29:17,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:17,571 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-25 13:29:17,571 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:29:17,572 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-25 13:29:17,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 13:29:17,573 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:17,573 INFO L354 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-07-25 13:29:17,573 INFO L415 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:17,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2018-07-25 13:29:17,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:17,664 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:29:17,665 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:17,665 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:29:17,665 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:29:17,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:29:17,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:29:17,670 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-07-25 13:29:17,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:17,746 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-25 13:29:17,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:29:17,747 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-07-25 13:29:17,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:17,748 INFO L225 Difference]: With dead ends: 35 [2018-07-25 13:29:17,748 INFO L226 Difference]: Without dead ends: 33 [2018-07-25 13:29:17,749 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:29:17,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-25 13:29:17,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-25 13:29:17,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-25 13:29:17,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-25 13:29:17,762 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-07-25 13:29:17,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:17,762 INFO L472 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-25 13:29:17,762 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:29:17,763 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-25 13:29:17,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-25 13:29:17,764 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:17,764 INFO L354 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-07-25 13:29:17,765 INFO L415 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:17,765 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2018-07-25 13:29:17,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:17,877 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:29:17,877 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:17,878 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 13:29:17,878 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 13:29:17,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 13:29:17,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:29:17,879 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2018-07-25 13:29:17,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:17,970 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-25 13:29:17,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:29:17,971 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-07-25 13:29:17,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:17,972 INFO L225 Difference]: With dead ends: 37 [2018-07-25 13:29:17,972 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 13:29:17,975 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:29:17,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 13:29:17,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 13:29:17,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 13:29:17,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-25 13:29:17,985 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-07-25 13:29:17,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:17,986 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-25 13:29:17,986 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 13:29:17,986 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-25 13:29:17,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 13:29:17,990 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:17,990 INFO L354 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-07-25 13:29:17,990 INFO L415 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:17,991 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2018-07-25 13:29:17,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:18,113 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:29:18,114 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:18,114 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 13:29:18,117 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 13:29:18,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 13:29:18,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:29:18,119 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2018-07-25 13:29:18,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:18,213 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-25 13:29:18,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:29:18,215 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-07-25 13:29:18,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:18,216 INFO L225 Difference]: With dead ends: 39 [2018-07-25 13:29:18,216 INFO L226 Difference]: Without dead ends: 37 [2018-07-25 13:29:18,218 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:29:18,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-25 13:29:18,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-25 13:29:18,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 13:29:18,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-25 13:29:18,228 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-07-25 13:29:18,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:18,228 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-25 13:29:18,228 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 13:29:18,229 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-25 13:29:18,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 13:29:18,230 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:18,230 INFO L354 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-07-25 13:29:18,231 INFO L415 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:18,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2018-07-25 13:29:18,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:18,379 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:29:18,380 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:18,380 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 13:29:18,380 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 13:29:18,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 13:29:18,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:29:18,382 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 19 states. [2018-07-25 13:29:18,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:18,478 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-25 13:29:18,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:29:18,479 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-07-25 13:29:18,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:18,479 INFO L225 Difference]: With dead ends: 41 [2018-07-25 13:29:18,480 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 13:29:18,483 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:29:18,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 13:29:18,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-25 13:29:18,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-25 13:29:18,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-25 13:29:18,494 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-07-25 13:29:18,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:18,498 INFO L472 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-25 13:29:18,498 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 13:29:18,498 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-25 13:29:18,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-25 13:29:18,499 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:18,500 INFO L354 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-07-25 13:29:18,500 INFO L415 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:18,500 INFO L82 PathProgramCache]: Analyzing trace with hash 225377569, now seen corresponding path program 17 times [2018-07-25 13:29:18,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:18,625 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:29:18,626 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:18,626 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 13:29:18,626 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 13:29:18,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 13:29:18,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:29:18,628 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 20 states. [2018-07-25 13:29:18,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:18,738 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-25 13:29:18,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:29:18,742 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-07-25 13:29:18,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:18,743 INFO L225 Difference]: With dead ends: 43 [2018-07-25 13:29:18,743 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 13:29:18,744 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:29:18,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 13:29:18,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-25 13:29:18,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 13:29:18,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-25 13:29:18,752 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-07-25 13:29:18,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:18,752 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-25 13:29:18,752 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 13:29:18,753 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-25 13:29:18,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 13:29:18,753 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:18,754 INFO L354 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-07-25 13:29:18,754 INFO L415 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:18,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1839531099, now seen corresponding path program 18 times [2018-07-25 13:29:18,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:18,902 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:29:18,903 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:18,903 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 13:29:18,903 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 13:29:18,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 13:29:18,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:29:18,905 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2018-07-25 13:29:19,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:19,010 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-25 13:29:19,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:29:19,011 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-07-25 13:29:19,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:19,012 INFO L225 Difference]: With dead ends: 45 [2018-07-25 13:29:19,012 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 13:29:19,013 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:29:19,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 13:29:19,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-25 13:29:19,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 13:29:19,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-25 13:29:19,019 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-07-25 13:29:19,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:19,020 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-25 13:29:19,020 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 13:29:19,020 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-25 13:29:19,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 13:29:19,021 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:19,021 INFO L354 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-07-25 13:29:19,021 INFO L415 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:19,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1737087723, now seen corresponding path program 19 times [2018-07-25 13:29:19,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:19,150 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:29:19,151 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:19,151 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 13:29:19,151 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 13:29:19,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 13:29:19,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:29:19,153 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2018-07-25 13:29:19,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:19,270 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-25 13:29:19,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:29:19,271 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-07-25 13:29:19,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:19,272 INFO L225 Difference]: With dead ends: 47 [2018-07-25 13:29:19,272 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 13:29:19,273 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:29:19,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 13:29:19,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 13:29:19,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 13:29:19,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-25 13:29:19,285 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-07-25 13:29:19,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:19,285 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-25 13:29:19,289 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 13:29:19,289 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-25 13:29:19,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 13:29:19,290 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:19,290 INFO L354 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-07-25 13:29:19,290 INFO L415 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:19,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1401028431, now seen corresponding path program 20 times [2018-07-25 13:29:19,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:19,449 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:29:19,449 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:19,450 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 13:29:19,450 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 13:29:19,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 13:29:19,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:29:19,454 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 23 states. [2018-07-25 13:29:19,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:19,618 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-25 13:29:19,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:29:19,619 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-07-25 13:29:19,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:19,620 INFO L225 Difference]: With dead ends: 49 [2018-07-25 13:29:19,620 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 13:29:19,621 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:29:19,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 13:29:19,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-25 13:29:19,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 13:29:19,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-25 13:29:19,630 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-07-25 13:29:19,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:19,630 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-25 13:29:19,631 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 13:29:19,631 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-25 13:29:19,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 13:29:19,631 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:19,632 INFO L354 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-07-25 13:29:19,632 INFO L415 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:19,632 INFO L82 PathProgramCache]: Analyzing trace with hash 2063610633, now seen corresponding path program 21 times [2018-07-25 13:29:19,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:19,816 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:29:19,817 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:19,817 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 13:29:19,818 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 13:29:19,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 13:29:19,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:29:19,819 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 24 states. [2018-07-25 13:29:20,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:20,019 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-25 13:29:20,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:29:20,021 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-07-25 13:29:20,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:20,022 INFO L225 Difference]: With dead ends: 51 [2018-07-25 13:29:20,022 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 13:29:20,022 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:29:20,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 13:29:20,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-25 13:29:20,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-25 13:29:20,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-25 13:29:20,028 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-07-25 13:29:20,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:20,029 INFO L472 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-25 13:29:20,029 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 13:29:20,029 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-25 13:29:20,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 13:29:20,030 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:20,030 INFO L354 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-07-25 13:29:20,031 INFO L415 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:20,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1145020349, now seen corresponding path program 22 times [2018-07-25 13:29:20,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:20,217 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:29:20,217 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:20,217 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-25 13:29:20,218 INFO L451 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-25 13:29:20,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-25 13:29:20,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:29:20,219 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 25 states. [2018-07-25 13:29:20,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:20,356 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-25 13:29:20,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 13:29:20,357 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-07-25 13:29:20,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:20,357 INFO L225 Difference]: With dead ends: 53 [2018-07-25 13:29:20,357 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 13:29:20,358 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:29:20,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 13:29:20,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-25 13:29:20,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 13:29:20,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-25 13:29:20,372 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-07-25 13:29:20,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:20,372 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-25 13:29:20,372 INFO L473 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-25 13:29:20,373 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-25 13:29:20,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 13:29:20,373 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:20,377 INFO L354 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-07-25 13:29:20,377 INFO L415 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:20,378 INFO L82 PathProgramCache]: Analyzing trace with hash -852875523, now seen corresponding path program 23 times [2018-07-25 13:29:20,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:20,539 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:29:20,539 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:20,539 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 13:29:20,539 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 13:29:20,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 13:29:20,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:29:20,540 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 26 states. [2018-07-25 13:29:20,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:20,690 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-25 13:29:20,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 13:29:20,691 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-07-25 13:29:20,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:20,692 INFO L225 Difference]: With dead ends: 55 [2018-07-25 13:29:20,692 INFO L226 Difference]: Without dead ends: 53 [2018-07-25 13:29:20,693 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:29:20,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-25 13:29:20,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-25 13:29:20,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-25 13:29:20,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-25 13:29:20,700 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-07-25 13:29:20,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:20,701 INFO L472 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-25 13:29:20,701 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 13:29:20,701 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-25 13:29:20,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-25 13:29:20,701 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:20,702 INFO L354 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-07-25 13:29:20,702 INFO L415 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:20,702 INFO L82 PathProgramCache]: Analyzing trace with hash 725428023, now seen corresponding path program 24 times [2018-07-25 13:29:20,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:20,892 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:29:20,893 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:20,893 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-25 13:29:20,893 INFO L451 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-25 13:29:20,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-25 13:29:20,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:29:20,894 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 27 states. [2018-07-25 13:29:21,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:21,049 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-25 13:29:21,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 13:29:21,050 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-07-25 13:29:21,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:21,050 INFO L225 Difference]: With dead ends: 57 [2018-07-25 13:29:21,051 INFO L226 Difference]: Without dead ends: 55 [2018-07-25 13:29:21,052 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:29:21,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-25 13:29:21,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-25 13:29:21,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-25 13:29:21,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-25 13:29:21,057 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-07-25 13:29:21,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:21,057 INFO L472 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-25 13:29:21,057 INFO L473 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-25 13:29:21,058 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-25 13:29:21,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-25 13:29:21,058 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:21,058 INFO L354 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-07-25 13:29:21,058 INFO L415 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:21,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1351680241, now seen corresponding path program 25 times [2018-07-25 13:29:21,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:21,232 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:29:21,232 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:21,232 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 13:29:21,233 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 13:29:21,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 13:29:21,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:29:21,234 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 28 states. [2018-07-25 13:29:21,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:21,389 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-25 13:29:21,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 13:29:21,390 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-07-25 13:29:21,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:21,390 INFO L225 Difference]: With dead ends: 59 [2018-07-25 13:29:21,390 INFO L226 Difference]: Without dead ends: 57 [2018-07-25 13:29:21,391 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:29:21,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-25 13:29:21,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-25 13:29:21,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-25 13:29:21,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-25 13:29:21,396 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-07-25 13:29:21,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:21,397 INFO L472 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-25 13:29:21,397 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 13:29:21,397 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-25 13:29:21,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-25 13:29:21,397 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:21,397 INFO L354 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-07-25 13:29:21,398 INFO L415 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:21,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1884640299, now seen corresponding path program 26 times [2018-07-25 13:29:21,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:21,566 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:29:21,566 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:21,567 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-25 13:29:21,567 INFO L451 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-25 13:29:21,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-25 13:29:21,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:29:21,568 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 29 states. [2018-07-25 13:29:21,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:21,743 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-25 13:29:21,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 13:29:21,743 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-07-25 13:29:21,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:21,744 INFO L225 Difference]: With dead ends: 61 [2018-07-25 13:29:21,744 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 13:29:21,745 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:29:21,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 13:29:21,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-25 13:29:21,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-25 13:29:21,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-25 13:29:21,750 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-07-25 13:29:21,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:21,751 INFO L472 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-25 13:29:21,751 INFO L473 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-25 13:29:21,751 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-25 13:29:21,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-25 13:29:21,752 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:21,752 INFO L354 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-07-25 13:29:21,752 INFO L415 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:21,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1336819483, now seen corresponding path program 27 times [2018-07-25 13:29:21,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:21,931 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:29:21,932 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:21,932 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 13:29:21,932 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 13:29:21,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 13:29:21,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:29:21,934 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 30 states. [2018-07-25 13:29:22,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:22,125 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-25 13:29:22,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 13:29:22,125 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-07-25 13:29:22,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:22,126 INFO L225 Difference]: With dead ends: 63 [2018-07-25 13:29:22,126 INFO L226 Difference]: Without dead ends: 61 [2018-07-25 13:29:22,127 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:29:22,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-25 13:29:22,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-25 13:29:22,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-25 13:29:22,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-25 13:29:22,132 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-07-25 13:29:22,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:22,133 INFO L472 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-25 13:29:22,133 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 13:29:22,133 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-25 13:29:22,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-25 13:29:22,134 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:22,134 INFO L354 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-07-25 13:29:22,134 INFO L415 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:22,134 INFO L82 PathProgramCache]: Analyzing trace with hash -488249569, now seen corresponding path program 28 times [2018-07-25 13:29:22,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:22,313 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:29:22,314 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:22,314 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-25 13:29:22,314 INFO L451 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-25 13:29:22,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-25 13:29:22,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:29:22,315 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 31 states. [2018-07-25 13:29:22,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:22,505 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-25 13:29:22,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 13:29:22,506 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-07-25 13:29:22,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:22,506 INFO L225 Difference]: With dead ends: 65 [2018-07-25 13:29:22,506 INFO L226 Difference]: Without dead ends: 63 [2018-07-25 13:29:22,507 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:29:22,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-25 13:29:22,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-25 13:29:22,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-25 13:29:22,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-25 13:29:22,514 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-07-25 13:29:22,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:22,514 INFO L472 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-25 13:29:22,514 INFO L473 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-25 13:29:22,514 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-25 13:29:22,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-25 13:29:22,515 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:22,515 INFO L354 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-07-25 13:29:22,515 INFO L415 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:22,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1056348455, now seen corresponding path program 29 times [2018-07-25 13:29:22,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:22,719 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:29:22,719 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:22,719 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 13:29:22,720 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 13:29:22,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 13:29:22,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:29:22,721 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 32 states. [2018-07-25 13:29:22,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:22,944 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-25 13:29:22,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 13:29:22,944 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-07-25 13:29:22,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:22,945 INFO L225 Difference]: With dead ends: 67 [2018-07-25 13:29:22,946 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 13:29:22,947 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:29:22,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 13:29:22,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 13:29:22,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 13:29:22,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-25 13:29:22,954 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-07-25 13:29:22,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:22,955 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-25 13:29:22,955 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 13:29:22,955 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-25 13:29:22,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-25 13:29:22,956 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:22,956 INFO L354 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2018-07-25 13:29:22,956 INFO L415 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:22,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1538531309, now seen corresponding path program 30 times [2018-07-25 13:29:22,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:23,232 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:29:23,233 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:23,233 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-25 13:29:23,234 INFO L451 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-25 13:29:23,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-25 13:29:23,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:29:23,235 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 33 states. [2018-07-25 13:29:23,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:23,453 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-25 13:29:23,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 13:29:23,453 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-07-25 13:29:23,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:23,454 INFO L225 Difference]: With dead ends: 69 [2018-07-25 13:29:23,454 INFO L226 Difference]: Without dead ends: 67 [2018-07-25 13:29:23,455 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:29:23,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-25 13:29:23,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-25 13:29:23,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-25 13:29:23,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-25 13:29:23,461 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-07-25 13:29:23,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:23,462 INFO L472 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-25 13:29:23,462 INFO L473 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-25 13:29:23,462 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-25 13:29:23,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-25 13:29:23,462 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:23,463 INFO L354 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2018-07-25 13:29:23,463 INFO L415 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:23,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1059786035, now seen corresponding path program 31 times [2018-07-25 13:29:23,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:23,666 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:29:23,666 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:23,666 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 13:29:23,667 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 13:29:23,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 13:29:23,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:29:23,668 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 34 states. [2018-07-25 13:29:23,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:23,894 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-25 13:29:23,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 13:29:23,894 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-07-25 13:29:23,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:23,895 INFO L225 Difference]: With dead ends: 71 [2018-07-25 13:29:23,895 INFO L226 Difference]: Without dead ends: 69 [2018-07-25 13:29:23,896 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:29:23,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-25 13:29:23,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-25 13:29:23,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-25 13:29:23,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-25 13:29:23,902 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-07-25 13:29:23,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:23,902 INFO L472 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-25 13:29:23,902 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 13:29:23,902 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-25 13:29:23,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-25 13:29:23,903 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:23,903 INFO L354 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2018-07-25 13:29:23,904 INFO L415 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:23,904 INFO L82 PathProgramCache]: Analyzing trace with hash -547078393, now seen corresponding path program 32 times [2018-07-25 13:29:23,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:24,118 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:29:24,118 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:24,118 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-25 13:29:24,119 INFO L451 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-25 13:29:24,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-25 13:29:24,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:29:24,120 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 35 states. [2018-07-25 13:29:24,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:24,379 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-25 13:29:24,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 13:29:24,379 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-07-25 13:29:24,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:24,380 INFO L225 Difference]: With dead ends: 73 [2018-07-25 13:29:24,380 INFO L226 Difference]: Without dead ends: 71 [2018-07-25 13:29:24,381 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:29:24,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-25 13:29:24,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-25 13:29:24,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-25 13:29:24,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-25 13:29:24,387 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-07-25 13:29:24,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:24,388 INFO L472 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-25 13:29:24,388 INFO L473 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-25 13:29:24,388 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-25 13:29:24,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-25 13:29:24,390 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:24,390 INFO L354 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2018-07-25 13:29:24,390 INFO L415 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:24,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1756273471, now seen corresponding path program 33 times [2018-07-25 13:29:24,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:24,618 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:29:24,618 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:24,619 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 13:29:24,619 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 13:29:24,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 13:29:24,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:29:24,620 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 36 states. [2018-07-25 13:29:24,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:24,880 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-25 13:29:24,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 13:29:24,880 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-07-25 13:29:24,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:24,881 INFO L225 Difference]: With dead ends: 75 [2018-07-25 13:29:24,881 INFO L226 Difference]: Without dead ends: 73 [2018-07-25 13:29:24,882 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:29:24,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-25 13:29:24,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-25 13:29:24,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-25 13:29:24,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-25 13:29:24,887 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-07-25 13:29:24,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:24,888 INFO L472 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-25 13:29:24,888 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 13:29:24,888 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-25 13:29:24,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-25 13:29:24,889 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:24,889 INFO L354 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2018-07-25 13:29:24,893 INFO L415 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:24,893 INFO L82 PathProgramCache]: Analyzing trace with hash 143393787, now seen corresponding path program 34 times [2018-07-25 13:29:24,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:25,149 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:29:25,149 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:25,149 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-25 13:29:25,150 INFO L451 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-25 13:29:25,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-25 13:29:25,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:29:25,151 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 37 states. [2018-07-25 13:29:25,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:25,413 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-25 13:29:25,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 13:29:25,414 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-07-25 13:29:25,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:25,415 INFO L225 Difference]: With dead ends: 77 [2018-07-25 13:29:25,415 INFO L226 Difference]: Without dead ends: 75 [2018-07-25 13:29:25,416 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:29:25,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-25 13:29:25,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-25 13:29:25,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-25 13:29:25,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-25 13:29:25,423 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-07-25 13:29:25,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:25,424 INFO L472 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-25 13:29:25,424 INFO L473 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-25 13:29:25,424 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-25 13:29:25,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-25 13:29:25,425 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:25,425 INFO L354 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2018-07-25 13:29:25,425 INFO L415 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:25,425 INFO L82 PathProgramCache]: Analyzing trace with hash 362527925, now seen corresponding path program 35 times [2018-07-25 13:29:25,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:25,661 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:29:25,661 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:25,661 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 13:29:25,662 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 13:29:25,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 13:29:25,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:29:25,663 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 38 states. [2018-07-25 13:29:25,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:25,917 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-25 13:29:25,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 13:29:25,917 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-07-25 13:29:25,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:25,918 INFO L225 Difference]: With dead ends: 79 [2018-07-25 13:29:25,918 INFO L226 Difference]: Without dead ends: 77 [2018-07-25 13:29:25,919 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:29:25,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-25 13:29:25,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-25 13:29:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-25 13:29:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-25 13:29:25,925 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-07-25 13:29:25,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:25,925 INFO L472 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-25 13:29:25,925 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 13:29:25,925 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-25 13:29:25,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-25 13:29:25,926 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:25,926 INFO L354 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2018-07-25 13:29:25,926 INFO L415 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:25,927 INFO L82 PathProgramCache]: Analyzing trace with hash 497037039, now seen corresponding path program 36 times [2018-07-25 13:29:25,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:26,179 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:29:26,179 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:26,180 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-25 13:29:26,180 INFO L451 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-25 13:29:26,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-25 13:29:26,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:29:26,184 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 39 states. [2018-07-25 13:29:26,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:26,484 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-25 13:29:26,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 13:29:26,485 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-07-25 13:29:26,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:26,486 INFO L225 Difference]: With dead ends: 81 [2018-07-25 13:29:26,486 INFO L226 Difference]: Without dead ends: 79 [2018-07-25 13:29:26,487 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:29:26,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-25 13:29:26,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-25 13:29:26,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-25 13:29:26,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-25 13:29:26,495 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-07-25 13:29:26,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:26,496 INFO L472 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-25 13:29:26,496 INFO L473 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-25 13:29:26,496 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-25 13:29:26,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-25 13:29:26,499 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:26,499 INFO L354 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2018-07-25 13:29:26,499 INFO L415 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:26,500 INFO L82 PathProgramCache]: Analyzing trace with hash 911276713, now seen corresponding path program 37 times [2018-07-25 13:29:26,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:26,802 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:29:26,802 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:26,802 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 13:29:26,803 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 13:29:26,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 13:29:26,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:29:26,804 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 40 states. [2018-07-25 13:29:27,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:27,065 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-25 13:29:27,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 13:29:27,065 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-07-25 13:29:27,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:27,069 INFO L225 Difference]: With dead ends: 83 [2018-07-25 13:29:27,069 INFO L226 Difference]: Without dead ends: 81 [2018-07-25 13:29:27,070 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:29:27,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-25 13:29:27,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-25 13:29:27,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-25 13:29:27,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-25 13:29:27,077 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-07-25 13:29:27,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:27,077 INFO L472 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-25 13:29:27,077 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 13:29:27,077 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-25 13:29:27,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-25 13:29:27,078 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:27,078 INFO L354 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2018-07-25 13:29:27,078 INFO L415 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:27,079 INFO L82 PathProgramCache]: Analyzing trace with hash -436355101, now seen corresponding path program 38 times [2018-07-25 13:29:27,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:27,291 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:29:27,291 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:27,291 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-25 13:29:27,292 INFO L451 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-25 13:29:27,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-25 13:29:27,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:29:27,293 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 41 states. [2018-07-25 13:29:27,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:27,565 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-25 13:29:27,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 13:29:27,566 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-07-25 13:29:27,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:27,567 INFO L225 Difference]: With dead ends: 85 [2018-07-25 13:29:27,567 INFO L226 Difference]: Without dead ends: 83 [2018-07-25 13:29:27,568 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:29:27,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-25 13:29:27,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-25 13:29:27,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 13:29:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-25 13:29:27,575 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-07-25 13:29:27,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:27,576 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-25 13:29:27,576 INFO L473 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-25 13:29:27,576 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-25 13:29:27,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-25 13:29:27,577 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:27,577 INFO L354 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2018-07-25 13:29:27,577 INFO L415 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:27,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1569595037, now seen corresponding path program 39 times [2018-07-25 13:29:27,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:27,810 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:29:27,811 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:27,811 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 13:29:27,811 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 13:29:27,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 13:29:27,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:29:27,813 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 42 states. [2018-07-25 13:29:28,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:28,094 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-25 13:29:28,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 13:29:28,094 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-07-25 13:29:28,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:28,095 INFO L225 Difference]: With dead ends: 87 [2018-07-25 13:29:28,095 INFO L226 Difference]: Without dead ends: 85 [2018-07-25 13:29:28,097 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:29:28,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-25 13:29:28,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-25 13:29:28,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 13:29:28,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-25 13:29:28,104 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-07-25 13:29:28,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:28,104 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-25 13:29:28,104 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 13:29:28,104 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-25 13:29:28,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-25 13:29:28,105 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:28,105 INFO L354 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2018-07-25 13:29:28,106 INFO L415 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:28,106 INFO L82 PathProgramCache]: Analyzing trace with hash 847361751, now seen corresponding path program 40 times [2018-07-25 13:29:28,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:28,356 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:29:28,357 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:28,357 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-25 13:29:28,357 INFO L451 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-25 13:29:28,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-25 13:29:28,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:29:28,359 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 43 states. [2018-07-25 13:29:28,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:28,663 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-25 13:29:28,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 13:29:28,663 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-07-25 13:29:28,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:28,664 INFO L225 Difference]: With dead ends: 89 [2018-07-25 13:29:28,664 INFO L226 Difference]: Without dead ends: 87 [2018-07-25 13:29:28,666 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:29:28,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-25 13:29:28,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-25 13:29:28,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 13:29:28,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-25 13:29:28,673 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-07-25 13:29:28,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:28,673 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-25 13:29:28,673 INFO L473 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-25 13:29:28,674 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-25 13:29:28,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-25 13:29:28,674 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:28,675 INFO L354 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2018-07-25 13:29:28,675 INFO L415 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:28,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1729091439, now seen corresponding path program 41 times [2018-07-25 13:29:28,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:28,955 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:29:28,955 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:28,956 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 13:29:28,956 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 13:29:28,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 13:29:28,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:29:28,957 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 44 states. [2018-07-25 13:29:29,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:29,254 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-25 13:29:29,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-25 13:29:29,255 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-07-25 13:29:29,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:29,256 INFO L225 Difference]: With dead ends: 91 [2018-07-25 13:29:29,256 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 13:29:29,257 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:29:29,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 13:29:29,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-25 13:29:29,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 13:29:29,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-25 13:29:29,264 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-07-25 13:29:29,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:29,265 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-25 13:29:29,265 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 13:29:29,265 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-25 13:29:29,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-25 13:29:29,266 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:29,266 INFO L354 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2018-07-25 13:29:29,266 INFO L415 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:29,267 INFO L82 PathProgramCache]: Analyzing trace with hash 495522763, now seen corresponding path program 42 times [2018-07-25 13:29:29,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:29,541 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:29:29,541 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:29,541 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-25 13:29:29,542 INFO L451 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-25 13:29:29,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-25 13:29:29,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:29:29,543 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 45 states. [2018-07-25 13:29:29,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:29,862 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-25 13:29:29,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 13:29:29,863 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-07-25 13:29:29,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:29,864 INFO L225 Difference]: With dead ends: 93 [2018-07-25 13:29:29,864 INFO L226 Difference]: Without dead ends: 91 [2018-07-25 13:29:29,865 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:29:29,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-25 13:29:29,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-25 13:29:29,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-25 13:29:29,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-25 13:29:29,873 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-07-25 13:29:29,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:29,874 INFO L472 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-25 13:29:29,874 INFO L473 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-25 13:29:29,874 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-25 13:29:29,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-25 13:29:29,875 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:29,875 INFO L354 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2018-07-25 13:29:29,875 INFO L415 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:29,876 INFO L82 PathProgramCache]: Analyzing trace with hash -543942523, now seen corresponding path program 43 times [2018-07-25 13:29:29,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:30,177 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:29:30,178 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:30,178 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-25 13:29:30,178 INFO L451 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-25 13:29:30,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-25 13:29:30,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:29:30,180 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 46 states. [2018-07-25 13:29:30,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:30,518 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-25 13:29:30,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 13:29:30,518 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-07-25 13:29:30,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:30,519 INFO L225 Difference]: With dead ends: 95 [2018-07-25 13:29:30,519 INFO L226 Difference]: Without dead ends: 93 [2018-07-25 13:29:30,521 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:29:30,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-25 13:29:30,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-25 13:29:30,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-25 13:29:30,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-25 13:29:30,528 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-07-25 13:29:30,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:30,529 INFO L472 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-25 13:29:30,529 INFO L473 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-25 13:29:30,529 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-25 13:29:30,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-25 13:29:30,530 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:30,530 INFO L354 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2018-07-25 13:29:30,530 INFO L415 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:30,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1257297599, now seen corresponding path program 44 times [2018-07-25 13:29:30,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:30,804 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:29:30,804 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:30,804 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-25 13:29:30,805 INFO L451 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-25 13:29:30,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-25 13:29:30,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:29:30,806 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 47 states. [2018-07-25 13:29:31,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:31,107 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-25 13:29:31,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-25 13:29:31,107 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-07-25 13:29:31,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:31,108 INFO L225 Difference]: With dead ends: 97 [2018-07-25 13:29:31,108 INFO L226 Difference]: Without dead ends: 95 [2018-07-25 13:29:31,109 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:29:31,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-25 13:29:31,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-25 13:29:31,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-25 13:29:31,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-25 13:29:31,115 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-07-25 13:29:31,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:31,116 INFO L472 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-25 13:29:31,116 INFO L473 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-25 13:29:31,116 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-25 13:29:31,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-25 13:29:31,117 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:31,117 INFO L354 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2018-07-25 13:29:31,117 INFO L415 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:31,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1377234553, now seen corresponding path program 45 times [2018-07-25 13:29:31,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:31,382 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:29:31,382 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:31,383 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-25 13:29:31,383 INFO L451 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-25 13:29:31,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-25 13:29:31,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:29:31,384 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 48 states. [2018-07-25 13:29:31,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:31,699 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-25 13:29:31,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-25 13:29:31,699 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-07-25 13:29:31,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:31,700 INFO L225 Difference]: With dead ends: 99 [2018-07-25 13:29:31,700 INFO L226 Difference]: Without dead ends: 97 [2018-07-25 13:29:31,701 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:29:31,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-25 13:29:31,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-25 13:29:31,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-25 13:29:31,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-25 13:29:31,707 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-07-25 13:29:31,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:31,708 INFO L472 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-25 13:29:31,708 INFO L473 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-25 13:29:31,708 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-25 13:29:31,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-25 13:29:31,709 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:31,709 INFO L354 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2018-07-25 13:29:31,709 INFO L415 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:31,710 INFO L82 PathProgramCache]: Analyzing trace with hash 672530355, now seen corresponding path program 46 times [2018-07-25 13:29:31,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:31,974 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:29:31,975 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:31,975 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-25 13:29:31,975 INFO L451 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-25 13:29:31,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-25 13:29:31,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:29:31,976 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 49 states. [2018-07-25 13:29:32,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:32,297 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-25 13:29:32,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-25 13:29:32,297 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-07-25 13:29:32,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:32,298 INFO L225 Difference]: With dead ends: 101 [2018-07-25 13:29:32,298 INFO L226 Difference]: Without dead ends: 99 [2018-07-25 13:29:32,299 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:29:32,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-25 13:29:32,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-25 13:29:32,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-25 13:29:32,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-25 13:29:32,306 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-07-25 13:29:32,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:32,306 INFO L472 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-25 13:29:32,306 INFO L473 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-25 13:29:32,306 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-25 13:29:32,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-25 13:29:32,307 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:32,307 INFO L354 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2018-07-25 13:29:32,308 INFO L415 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:32,308 INFO L82 PathProgramCache]: Analyzing trace with hash 2056628845, now seen corresponding path program 47 times [2018-07-25 13:29:32,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:32,556 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:29:32,557 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:32,557 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-25 13:29:32,557 INFO L451 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-25 13:29:32,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-25 13:29:32,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 13:29:32,559 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 50 states. [2018-07-25 13:29:32,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:32,891 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-25 13:29:32,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-25 13:29:32,891 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-07-25 13:29:32,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:32,892 INFO L225 Difference]: With dead ends: 103 [2018-07-25 13:29:32,893 INFO L226 Difference]: Without dead ends: 101 [2018-07-25 13:29:32,894 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 13:29:32,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-25 13:29:32,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-25 13:29:32,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-25 13:29:32,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-25 13:29:32,903 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-07-25 13:29:32,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:32,903 INFO L472 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-25 13:29:32,903 INFO L473 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-25 13:29:32,903 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-25 13:29:32,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-25 13:29:32,905 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:32,905 INFO L354 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2018-07-25 13:29:32,905 INFO L415 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:32,906 INFO L82 PathProgramCache]: Analyzing trace with hash 735415975, now seen corresponding path program 48 times [2018-07-25 13:29:32,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:33,152 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:29:33,153 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:33,153 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-25 13:29:33,153 INFO L451 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-25 13:29:33,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-25 13:29:33,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:29:33,155 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 51 states. [2018-07-25 13:29:33,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:33,494 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-25 13:29:33,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-25 13:29:33,494 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-07-25 13:29:33,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:33,495 INFO L225 Difference]: With dead ends: 105 [2018-07-25 13:29:33,495 INFO L226 Difference]: Without dead ends: 103 [2018-07-25 13:29:33,496 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:29:33,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-25 13:29:33,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-25 13:29:33,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-25 13:29:33,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-25 13:29:33,503 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-07-25 13:29:33,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:33,504 INFO L472 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-25 13:29:33,504 INFO L473 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-25 13:29:33,504 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-25 13:29:33,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-25 13:29:33,505 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:33,506 INFO L354 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2018-07-25 13:29:33,506 INFO L415 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:33,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1934799775, now seen corresponding path program 49 times [2018-07-25 13:29:33,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:33,759 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:29:33,760 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:33,760 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-25 13:29:33,761 INFO L451 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-25 13:29:33,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-25 13:29:33,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:29:33,762 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 52 states. [2018-07-25 13:29:34,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:34,089 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-25 13:29:34,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-25 13:29:34,090 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-07-25 13:29:34,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:34,091 INFO L225 Difference]: With dead ends: 107 [2018-07-25 13:29:34,091 INFO L226 Difference]: Without dead ends: 105 [2018-07-25 13:29:34,092 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:29:34,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-25 13:29:34,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-25 13:29:34,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-25 13:29:34,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-25 13:29:34,100 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-07-25 13:29:34,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:34,100 INFO L472 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-25 13:29:34,100 INFO L473 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-25 13:29:34,101 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-25 13:29:34,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-25 13:29:34,102 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:34,102 INFO L354 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2018-07-25 13:29:34,102 INFO L415 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:34,103 INFO L82 PathProgramCache]: Analyzing trace with hash 378307483, now seen corresponding path program 50 times [2018-07-25 13:29:34,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:34,363 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:29:34,364 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:34,364 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-25 13:29:34,364 INFO L451 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-25 13:29:34,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-25 13:29:34,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:29:34,366 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 53 states. [2018-07-25 13:29:34,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:34,704 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-07-25 13:29:34,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-25 13:29:34,704 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-07-25 13:29:34,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:34,705 INFO L225 Difference]: With dead ends: 109 [2018-07-25 13:29:34,705 INFO L226 Difference]: Without dead ends: 107 [2018-07-25 13:29:34,706 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:29:34,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-25 13:29:34,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-07-25 13:29:34,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-25 13:29:34,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-07-25 13:29:34,718 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-07-25 13:29:34,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:34,718 INFO L472 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-07-25 13:29:34,718 INFO L473 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-25 13:29:34,719 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-07-25 13:29:34,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-25 13:29:34,721 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:34,721 INFO L354 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2018-07-25 13:29:34,722 INFO L415 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:34,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1518676907, now seen corresponding path program 51 times [2018-07-25 13:29:34,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:34,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:34,981 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:29:34,982 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:34,982 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-25 13:29:34,982 INFO L451 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-25 13:29:34,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-25 13:29:34,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:29:34,984 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 54 states. [2018-07-25 13:29:35,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:35,336 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-07-25 13:29:35,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-25 13:29:35,337 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-07-25 13:29:35,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:35,338 INFO L225 Difference]: With dead ends: 111 [2018-07-25 13:29:35,338 INFO L226 Difference]: Without dead ends: 109 [2018-07-25 13:29:35,339 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:29:35,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-25 13:29:35,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-07-25 13:29:35,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-25 13:29:35,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-07-25 13:29:35,347 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-07-25 13:29:35,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:35,348 INFO L472 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-07-25 13:29:35,348 INFO L473 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-25 13:29:35,348 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-07-25 13:29:35,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-25 13:29:35,349 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:35,349 INFO L354 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2018-07-25 13:29:35,350 INFO L415 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:35,350 INFO L82 PathProgramCache]: Analyzing trace with hash 840425103, now seen corresponding path program 52 times [2018-07-25 13:29:35,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:35,624 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:29:35,624 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:35,625 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-25 13:29:35,625 INFO L451 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-25 13:29:35,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-25 13:29:35,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:29:35,626 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 55 states. [2018-07-25 13:29:35,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:35,968 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-07-25 13:29:35,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-25 13:29:35,968 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-07-25 13:29:35,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:35,970 INFO L225 Difference]: With dead ends: 113 [2018-07-25 13:29:35,970 INFO L226 Difference]: Without dead ends: 111 [2018-07-25 13:29:35,970 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:29:35,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-25 13:29:35,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-07-25 13:29:35,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-25 13:29:35,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-07-25 13:29:35,978 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2018-07-25 13:29:35,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:35,979 INFO L472 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-07-25 13:29:35,979 INFO L473 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-25 13:29:35,979 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-07-25 13:29:35,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-25 13:29:35,980 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:35,980 INFO L354 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2018-07-25 13:29:35,980 INFO L415 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:35,981 INFO L82 PathProgramCache]: Analyzing trace with hash 194724425, now seen corresponding path program 53 times [2018-07-25 13:29:35,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:36,334 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:29:36,335 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:36,336 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-25 13:29:36,336 INFO L451 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-25 13:29:36,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-25 13:29:36,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:29:36,337 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 56 states. [2018-07-25 13:29:36,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:36,758 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-07-25 13:29:36,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-25 13:29:36,758 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-07-25 13:29:36,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:36,759 INFO L225 Difference]: With dead ends: 115 [2018-07-25 13:29:36,759 INFO L226 Difference]: Without dead ends: 113 [2018-07-25 13:29:36,760 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:29:36,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-25 13:29:36,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-07-25 13:29:36,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-25 13:29:36,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-07-25 13:29:36,767 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2018-07-25 13:29:36,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:36,768 INFO L472 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-07-25 13:29:36,768 INFO L473 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-25 13:29:36,768 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-07-25 13:29:36,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-25 13:29:36,769 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:36,769 INFO L354 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2018-07-25 13:29:36,769 INFO L415 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:36,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1848336509, now seen corresponding path program 54 times [2018-07-25 13:29:36,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:37,058 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:29:37,058 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:37,059 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-25 13:29:37,059 INFO L451 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-25 13:29:37,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-25 13:29:37,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:29:37,060 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 57 states. [2018-07-25 13:29:37,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:37,439 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-07-25 13:29:37,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-25 13:29:37,439 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-07-25 13:29:37,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:37,440 INFO L225 Difference]: With dead ends: 117 [2018-07-25 13:29:37,440 INFO L226 Difference]: Without dead ends: 115 [2018-07-25 13:29:37,441 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:29:37,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-25 13:29:37,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-07-25 13:29:37,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-25 13:29:37,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-07-25 13:29:37,449 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2018-07-25 13:29:37,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:37,450 INFO L472 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-07-25 13:29:37,450 INFO L473 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-25 13:29:37,450 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-07-25 13:29:37,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-25 13:29:37,451 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:37,451 INFO L354 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2018-07-25 13:29:37,451 INFO L415 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:37,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1865127485, now seen corresponding path program 55 times [2018-07-25 13:29:37,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:37,752 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:29:37,752 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:37,753 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-25 13:29:37,753 INFO L451 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-25 13:29:37,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-25 13:29:37,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:29:37,757 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 58 states. [2018-07-25 13:29:38,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:38,125 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-07-25 13:29:38,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-25 13:29:38,125 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-07-25 13:29:38,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:38,126 INFO L225 Difference]: With dead ends: 119 [2018-07-25 13:29:38,126 INFO L226 Difference]: Without dead ends: 117 [2018-07-25 13:29:38,128 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:29:38,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-07-25 13:29:38,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-07-25 13:29:38,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-25 13:29:38,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-07-25 13:29:38,134 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2018-07-25 13:29:38,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:38,135 INFO L472 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-07-25 13:29:38,135 INFO L473 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-25 13:29:38,135 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-07-25 13:29:38,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-25 13:29:38,136 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:38,136 INFO L354 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2018-07-25 13:29:38,136 INFO L415 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:38,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1386202743, now seen corresponding path program 56 times [2018-07-25 13:29:38,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:38,433 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:29:38,434 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:38,434 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-25 13:29:38,434 INFO L451 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-25 13:29:38,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-25 13:29:38,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:29:38,438 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 59 states. [2018-07-25 13:29:38,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:38,812 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-07-25 13:29:38,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-25 13:29:38,812 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2018-07-25 13:29:38,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:38,813 INFO L225 Difference]: With dead ends: 121 [2018-07-25 13:29:38,813 INFO L226 Difference]: Without dead ends: 119 [2018-07-25 13:29:38,814 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:29:38,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-25 13:29:38,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-25 13:29:38,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-25 13:29:38,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-07-25 13:29:38,821 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2018-07-25 13:29:38,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:38,821 INFO L472 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-07-25 13:29:38,821 INFO L473 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-25 13:29:38,821 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-07-25 13:29:38,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-25 13:29:38,822 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:38,823 INFO L354 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2018-07-25 13:29:38,823 INFO L415 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:38,823 INFO L82 PathProgramCache]: Analyzing trace with hash 701026353, now seen corresponding path program 57 times [2018-07-25 13:29:38,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:39,162 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:29:39,162 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:39,162 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-25 13:29:39,163 INFO L451 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-25 13:29:39,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-25 13:29:39,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 13:29:39,164 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 60 states. [2018-07-25 13:29:39,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:39,592 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-07-25 13:29:39,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-25 13:29:39,593 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-07-25 13:29:39,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:39,594 INFO L225 Difference]: With dead ends: 123 [2018-07-25 13:29:39,594 INFO L226 Difference]: Without dead ends: 121 [2018-07-25 13:29:39,595 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 13:29:39,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-25 13:29:39,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-07-25 13:29:39,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 13:29:39,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-07-25 13:29:39,602 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2018-07-25 13:29:39,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:39,603 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-07-25 13:29:39,603 INFO L473 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-25 13:29:39,603 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-07-25 13:29:39,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-25 13:29:39,604 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:39,604 INFO L354 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2018-07-25 13:29:39,604 INFO L415 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:39,605 INFO L82 PathProgramCache]: Analyzing trace with hash -623488149, now seen corresponding path program 58 times [2018-07-25 13:29:39,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:39,918 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:29:39,919 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:39,919 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-25 13:29:39,919 INFO L451 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-25 13:29:39,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-25 13:29:39,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:29:39,920 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 61 states. [2018-07-25 13:29:40,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:40,270 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-07-25 13:29:40,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-25 13:29:40,271 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-07-25 13:29:40,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:40,272 INFO L225 Difference]: With dead ends: 125 [2018-07-25 13:29:40,272 INFO L226 Difference]: Without dead ends: 123 [2018-07-25 13:29:40,273 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:29:40,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-25 13:29:40,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-07-25 13:29:40,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-07-25 13:29:40,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-07-25 13:29:40,279 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2018-07-25 13:29:40,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:40,280 INFO L472 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-07-25 13:29:40,280 INFO L473 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-25 13:29:40,280 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-07-25 13:29:40,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-25 13:29:40,281 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:40,281 INFO L354 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2018-07-25 13:29:40,281 INFO L415 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:40,282 INFO L82 PathProgramCache]: Analyzing trace with hash 2123362341, now seen corresponding path program 59 times [2018-07-25 13:29:40,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:40,554 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:29:40,555 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:40,555 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-25 13:29:40,555 INFO L451 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-25 13:29:40,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-25 13:29:40,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:29:40,556 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 62 states. [2018-07-25 13:29:40,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:40,974 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-07-25 13:29:40,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 13:29:40,974 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-07-25 13:29:40,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:40,975 INFO L225 Difference]: With dead ends: 127 [2018-07-25 13:29:40,975 INFO L226 Difference]: Without dead ends: 125 [2018-07-25 13:29:40,976 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:29:40,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-25 13:29:40,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-07-25 13:29:40,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-25 13:29:40,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-07-25 13:29:40,983 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2018-07-25 13:29:40,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:40,984 INFO L472 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-07-25 13:29:40,984 INFO L473 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-25 13:29:40,984 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-07-25 13:29:40,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-25 13:29:40,984 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:40,985 INFO L354 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2018-07-25 13:29:40,985 INFO L415 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:40,985 INFO L82 PathProgramCache]: Analyzing trace with hash 441796191, now seen corresponding path program 60 times [2018-07-25 13:29:40,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:41,287 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:29:41,287 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:41,287 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-25 13:29:41,288 INFO L451 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-25 13:29:41,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-25 13:29:41,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:29:41,289 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 63 states. [2018-07-25 13:29:41,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:41,596 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-07-25 13:29:41,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-25 13:29:41,596 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-07-25 13:29:41,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:41,597 INFO L225 Difference]: With dead ends: 129 [2018-07-25 13:29:41,597 INFO L226 Difference]: Without dead ends: 127 [2018-07-25 13:29:41,598 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:29:41,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-25 13:29:41,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-07-25 13:29:41,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-25 13:29:41,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-07-25 13:29:41,606 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2018-07-25 13:29:41,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:41,606 INFO L472 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-07-25 13:29:41,606 INFO L473 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-25 13:29:41,607 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-07-25 13:29:41,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-25 13:29:41,607 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:41,607 INFO L354 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2018-07-25 13:29:41,608 INFO L415 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:41,608 INFO L82 PathProgramCache]: Analyzing trace with hash -635570663, now seen corresponding path program 61 times [2018-07-25 13:29:41,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:41,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:41,935 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:29:41,935 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:41,935 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-25 13:29:41,936 INFO L451 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-25 13:29:41,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-25 13:29:41,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:29:41,937 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 64 states. [2018-07-25 13:29:42,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:42,303 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-07-25 13:29:42,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-25 13:29:42,303 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-07-25 13:29:42,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:42,304 INFO L225 Difference]: With dead ends: 131 [2018-07-25 13:29:42,304 INFO L226 Difference]: Without dead ends: 129 [2018-07-25 13:29:42,305 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:29:42,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-25 13:29:42,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-07-25 13:29:42,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-25 13:29:42,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-07-25 13:29:42,320 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2018-07-25 13:29:42,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:42,320 INFO L472 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-07-25 13:29:42,320 INFO L473 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-25 13:29:42,320 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-07-25 13:29:42,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-25 13:29:42,321 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:42,321 INFO L354 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2018-07-25 13:29:42,322 INFO L415 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:42,322 INFO L82 PathProgramCache]: Analyzing trace with hash -897999021, now seen corresponding path program 62 times [2018-07-25 13:29:42,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:42,742 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:29:42,743 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:42,743 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-25 13:29:42,744 INFO L451 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-25 13:29:42,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-25 13:29:42,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:29:42,746 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 65 states. [2018-07-25 13:29:43,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:43,084 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-07-25 13:29:43,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-25 13:29:43,084 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-07-25 13:29:43,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:43,086 INFO L225 Difference]: With dead ends: 133 [2018-07-25 13:29:43,086 INFO L226 Difference]: Without dead ends: 131 [2018-07-25 13:29:43,086 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:29:43,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-25 13:29:43,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-07-25 13:29:43,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-25 13:29:43,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-07-25 13:29:43,103 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2018-07-25 13:29:43,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:43,110 INFO L472 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-07-25 13:29:43,111 INFO L473 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-25 13:29:43,111 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-07-25 13:29:43,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-25 13:29:43,112 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:43,112 INFO L354 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2018-07-25 13:29:43,112 INFO L415 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:43,113 INFO L82 PathProgramCache]: Analyzing trace with hash 311419405, now seen corresponding path program 63 times [2018-07-25 13:29:43,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:43,469 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:29:43,469 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:43,469 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-25 13:29:43,470 INFO L451 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-25 13:29:43,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-25 13:29:43,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:29:43,471 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 66 states. [2018-07-25 13:29:43,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:43,771 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-25 13:29:43,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-25 13:29:43,772 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-07-25 13:29:43,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:43,773 INFO L225 Difference]: With dead ends: 135 [2018-07-25 13:29:43,773 INFO L226 Difference]: Without dead ends: 133 [2018-07-25 13:29:43,774 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:29:43,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-25 13:29:43,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-07-25 13:29:43,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-25 13:29:43,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-07-25 13:29:43,782 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2018-07-25 13:29:43,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:43,782 INFO L472 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-07-25 13:29:43,783 INFO L473 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-25 13:29:43,783 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-07-25 13:29:43,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-25 13:29:43,784 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:43,784 INFO L354 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2018-07-25 13:29:43,784 INFO L415 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:43,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1373610425, now seen corresponding path program 64 times [2018-07-25 13:29:43,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:44,076 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:29:44,076 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:44,077 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-25 13:29:44,077 INFO L451 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-25 13:29:44,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-25 13:29:44,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:29:44,078 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 67 states. [2018-07-25 13:29:44,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:44,389 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-07-25 13:29:44,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-25 13:29:44,390 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-07-25 13:29:44,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:44,390 INFO L225 Difference]: With dead ends: 137 [2018-07-25 13:29:44,391 INFO L226 Difference]: Without dead ends: 135 [2018-07-25 13:29:44,391 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:29:44,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-25 13:29:44,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-07-25 13:29:44,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-07-25 13:29:44,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-07-25 13:29:44,398 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2018-07-25 13:29:44,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:44,398 INFO L472 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-07-25 13:29:44,398 INFO L473 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-25 13:29:44,398 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-07-25 13:29:44,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-25 13:29:44,399 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:44,399 INFO L354 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2018-07-25 13:29:44,400 INFO L415 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:44,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1484606463, now seen corresponding path program 65 times [2018-07-25 13:29:44,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:44,782 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:29:44,782 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:44,782 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-25 13:29:44,783 INFO L451 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-25 13:29:44,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-25 13:29:44,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 13:29:44,784 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 68 states. [2018-07-25 13:29:45,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:45,274 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-07-25 13:29:45,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-25 13:29:45,275 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-07-25 13:29:45,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:45,276 INFO L225 Difference]: With dead ends: 139 [2018-07-25 13:29:45,276 INFO L226 Difference]: Without dead ends: 137 [2018-07-25 13:29:45,277 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 13:29:45,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-25 13:29:45,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-07-25 13:29:45,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-25 13:29:45,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-07-25 13:29:45,315 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2018-07-25 13:29:45,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:45,315 INFO L472 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-07-25 13:29:45,315 INFO L473 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-25 13:29:45,315 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-07-25 13:29:45,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-25 13:29:45,316 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:45,316 INFO L354 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2018-07-25 13:29:45,317 INFO L415 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:45,317 INFO L82 PathProgramCache]: Analyzing trace with hash -777616581, now seen corresponding path program 66 times [2018-07-25 13:29:45,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:45,720 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:29:45,721 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:45,721 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-25 13:29:45,721 INFO L451 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-25 13:29:45,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-25 13:29:45,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:29:45,722 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 69 states. [2018-07-25 13:29:46,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:46,152 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-07-25 13:29:46,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-25 13:29:46,152 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-07-25 13:29:46,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:46,153 INFO L225 Difference]: With dead ends: 141 [2018-07-25 13:29:46,153 INFO L226 Difference]: Without dead ends: 139 [2018-07-25 13:29:46,154 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:29:46,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-25 13:29:46,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-07-25 13:29:46,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-07-25 13:29:46,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-07-25 13:29:46,161 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2018-07-25 13:29:46,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:46,161 INFO L472 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-07-25 13:29:46,161 INFO L473 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-25 13:29:46,161 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-07-25 13:29:46,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-25 13:29:46,162 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:46,162 INFO L354 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2018-07-25 13:29:46,162 INFO L415 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:46,163 INFO L82 PathProgramCache]: Analyzing trace with hash 34827253, now seen corresponding path program 67 times [2018-07-25 13:29:46,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:46,497 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:29:46,497 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:46,497 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-25 13:29:46,498 INFO L451 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-25 13:29:46,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-25 13:29:46,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:29:46,499 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 70 states. [2018-07-25 13:29:46,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:46,865 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-07-25 13:29:46,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-25 13:29:46,865 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-07-25 13:29:46,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:46,866 INFO L225 Difference]: With dead ends: 143 [2018-07-25 13:29:46,866 INFO L226 Difference]: Without dead ends: 141 [2018-07-25 13:29:46,867 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:29:46,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-25 13:29:46,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-07-25 13:29:46,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-25 13:29:46,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-07-25 13:29:46,874 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2018-07-25 13:29:46,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:46,875 INFO L472 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-07-25 13:29:46,875 INFO L473 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-25 13:29:46,875 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-07-25 13:29:46,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-25 13:29:46,876 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:46,876 INFO L354 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2018-07-25 13:29:46,876 INFO L415 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:46,877 INFO L82 PathProgramCache]: Analyzing trace with hash -890696145, now seen corresponding path program 68 times [2018-07-25 13:29:46,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:47,292 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:29:47,292 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:47,293 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-25 13:29:47,293 INFO L451 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-25 13:29:47,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-25 13:29:47,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:29:47,294 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 71 states. [2018-07-25 13:29:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:47,826 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-07-25 13:29:47,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-25 13:29:47,826 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2018-07-25 13:29:47,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:47,828 INFO L225 Difference]: With dead ends: 145 [2018-07-25 13:29:47,828 INFO L226 Difference]: Without dead ends: 143 [2018-07-25 13:29:47,829 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:29:47,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-25 13:29:47,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-07-25 13:29:47,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-25 13:29:47,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-07-25 13:29:47,838 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2018-07-25 13:29:47,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:47,838 INFO L472 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-07-25 13:29:47,838 INFO L473 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-25 13:29:47,838 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-07-25 13:29:47,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-25 13:29:47,839 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:47,839 INFO L354 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1] [2018-07-25 13:29:47,840 INFO L415 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:47,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1260451351, now seen corresponding path program 69 times [2018-07-25 13:29:47,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:48,227 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:29:48,228 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:48,228 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-25 13:29:48,228 INFO L451 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-25 13:29:48,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-25 13:29:48,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:29:48,229 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 72 states. [2018-07-25 13:29:48,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:48,688 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-07-25 13:29:48,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-25 13:29:48,689 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-07-25 13:29:48,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:48,689 INFO L225 Difference]: With dead ends: 147 [2018-07-25 13:29:48,690 INFO L226 Difference]: Without dead ends: 145 [2018-07-25 13:29:48,690 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:29:48,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-25 13:29:48,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-07-25 13:29:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-25 13:29:48,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-07-25 13:29:48,697 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2018-07-25 13:29:48,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:48,698 INFO L472 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-07-25 13:29:48,698 INFO L473 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-25 13:29:48,698 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-07-25 13:29:48,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-25 13:29:48,699 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:48,699 INFO L354 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1] [2018-07-25 13:29:48,699 INFO L415 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:48,700 INFO L82 PathProgramCache]: Analyzing trace with hash -112918749, now seen corresponding path program 70 times [2018-07-25 13:29:48,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:49,117 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:29:49,118 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:49,118 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-25 13:29:49,119 INFO L451 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-25 13:29:49,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-25 13:29:49,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:29:49,120 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 73 states. [2018-07-25 13:29:49,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:49,680 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-07-25 13:29:49,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-25 13:29:49,681 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-07-25 13:29:49,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:49,682 INFO L225 Difference]: With dead ends: 149 [2018-07-25 13:29:49,682 INFO L226 Difference]: Without dead ends: 147 [2018-07-25 13:29:49,683 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:29:49,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-25 13:29:49,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-07-25 13:29:49,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-25 13:29:49,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-07-25 13:29:49,691 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2018-07-25 13:29:49,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:49,691 INFO L472 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-07-25 13:29:49,691 INFO L473 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-25 13:29:49,691 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-07-25 13:29:49,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-25 13:29:49,692 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:49,692 INFO L354 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1] [2018-07-25 13:29:49,692 INFO L415 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:49,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1140683299, now seen corresponding path program 71 times [2018-07-25 13:29:49,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:50,026 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:29:50,027 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:50,027 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-25 13:29:50,027 INFO L451 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-25 13:29:50,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-25 13:29:50,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:29:50,028 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 74 states. [2018-07-25 13:29:50,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:50,408 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-07-25 13:29:50,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-25 13:29:50,409 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-07-25 13:29:50,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:50,410 INFO L225 Difference]: With dead ends: 151 [2018-07-25 13:29:50,410 INFO L226 Difference]: Without dead ends: 149 [2018-07-25 13:29:50,410 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:29:50,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-25 13:29:50,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-07-25 13:29:50,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-25 13:29:50,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-07-25 13:29:50,418 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2018-07-25 13:29:50,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:50,419 INFO L472 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-07-25 13:29:50,419 INFO L473 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-25 13:29:50,419 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-07-25 13:29:50,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-25 13:29:50,420 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:50,420 INFO L354 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1] [2018-07-25 13:29:50,420 INFO L415 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:50,421 INFO L82 PathProgramCache]: Analyzing trace with hash -979937769, now seen corresponding path program 72 times [2018-07-25 13:29:50,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:50,732 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:29:50,733 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:50,733 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-25 13:29:50,733 INFO L451 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-25 13:29:50,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-25 13:29:50,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:29:50,734 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 75 states. [2018-07-25 13:29:51,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:51,115 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-07-25 13:29:51,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-25 13:29:51,115 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-07-25 13:29:51,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:51,116 INFO L225 Difference]: With dead ends: 153 [2018-07-25 13:29:51,116 INFO L226 Difference]: Without dead ends: 151 [2018-07-25 13:29:51,117 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:29:51,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-25 13:29:51,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-07-25 13:29:51,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-25 13:29:51,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-07-25 13:29:51,127 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2018-07-25 13:29:51,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:51,127 INFO L472 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-07-25 13:29:51,127 INFO L473 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-25 13:29:51,127 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-07-25 13:29:51,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-25 13:29:51,128 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:51,128 INFO L354 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1] [2018-07-25 13:29:51,129 INFO L415 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:51,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1122306095, now seen corresponding path program 73 times [2018-07-25 13:29:51,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:51,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:51,618 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:29:51,619 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:51,619 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-25 13:29:51,619 INFO L451 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-25 13:29:51,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-25 13:29:51,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:29:51,620 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 76 states. [2018-07-25 13:29:52,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:52,041 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-07-25 13:29:52,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-25 13:29:52,041 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-07-25 13:29:52,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:52,042 INFO L225 Difference]: With dead ends: 155 [2018-07-25 13:29:52,043 INFO L226 Difference]: Without dead ends: 153 [2018-07-25 13:29:52,043 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:29:52,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-25 13:29:52,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-07-25 13:29:52,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-25 13:29:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-07-25 13:29:52,051 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2018-07-25 13:29:52,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:52,052 INFO L472 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-07-25 13:29:52,052 INFO L473 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-25 13:29:52,052 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-07-25 13:29:52,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-25 13:29:52,053 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:52,053 INFO L354 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1] [2018-07-25 13:29:52,053 INFO L415 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:52,054 INFO L82 PathProgramCache]: Analyzing trace with hash -499313909, now seen corresponding path program 74 times [2018-07-25 13:29:52,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:52,380 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:29:52,381 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:52,381 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-25 13:29:52,381 INFO L451 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-25 13:29:52,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-25 13:29:52,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:29:52,382 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 77 states. [2018-07-25 13:29:52,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:52,775 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-07-25 13:29:52,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-25 13:29:52,776 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2018-07-25 13:29:52,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:52,777 INFO L225 Difference]: With dead ends: 157 [2018-07-25 13:29:52,777 INFO L226 Difference]: Without dead ends: 155 [2018-07-25 13:29:52,778 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:29:52,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-25 13:29:52,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-25 13:29:52,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-25 13:29:52,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-07-25 13:29:52,786 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2018-07-25 13:29:52,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:52,787 INFO L472 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-07-25 13:29:52,787 INFO L473 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-25 13:29:52,787 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-07-25 13:29:52,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-25 13:29:52,788 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:52,788 INFO L354 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1] [2018-07-25 13:29:52,788 INFO L415 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:52,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1195722693, now seen corresponding path program 75 times [2018-07-25 13:29:52,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:53,136 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:29:53,136 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:53,136 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-25 13:29:53,136 INFO L451 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-25 13:29:53,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-25 13:29:53,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:29:53,137 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 78 states. [2018-07-25 13:29:53,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:53,547 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-07-25 13:29:53,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-25 13:29:53,547 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-07-25 13:29:53,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:53,548 INFO L225 Difference]: With dead ends: 159 [2018-07-25 13:29:53,548 INFO L226 Difference]: Without dead ends: 157 [2018-07-25 13:29:53,549 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:29:53,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-25 13:29:53,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-07-25 13:29:53,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-07-25 13:29:53,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-07-25 13:29:53,558 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2018-07-25 13:29:53,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:53,559 INFO L472 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-07-25 13:29:53,559 INFO L473 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-25 13:29:53,559 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-07-25 13:29:53,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-25 13:29:53,560 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:53,560 INFO L354 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1] [2018-07-25 13:29:53,560 INFO L415 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:53,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1961675265, now seen corresponding path program 76 times [2018-07-25 13:29:53,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:53,946 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:29:53,946 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:53,946 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-25 13:29:53,947 INFO L451 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-25 13:29:53,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-25 13:29:53,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:29:53,948 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 79 states. [2018-07-25 13:29:54,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:54,397 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-07-25 13:29:54,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-25 13:29:54,397 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-07-25 13:29:54,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:54,399 INFO L225 Difference]: With dead ends: 161 [2018-07-25 13:29:54,399 INFO L226 Difference]: Without dead ends: 159 [2018-07-25 13:29:54,400 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:29:54,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-07-25 13:29:54,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-07-25 13:29:54,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-07-25 13:29:54,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-07-25 13:29:54,407 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2018-07-25 13:29:54,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:54,407 INFO L472 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-07-25 13:29:54,407 INFO L473 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-25 13:29:54,407 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-07-25 13:29:54,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-25 13:29:54,408 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:54,408 INFO L354 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1] [2018-07-25 13:29:54,409 INFO L415 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:54,409 INFO L82 PathProgramCache]: Analyzing trace with hash 320765369, now seen corresponding path program 77 times [2018-07-25 13:29:54,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:54,745 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:29:54,746 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:54,746 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-25 13:29:54,746 INFO L451 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-25 13:29:54,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-25 13:29:54,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 13:29:54,747 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 80 states. [2018-07-25 13:29:55,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:55,185 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-07-25 13:29:55,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-25 13:29:55,185 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-07-25 13:29:55,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:55,186 INFO L225 Difference]: With dead ends: 163 [2018-07-25 13:29:55,186 INFO L226 Difference]: Without dead ends: 161 [2018-07-25 13:29:55,187 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 13:29:55,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-07-25 13:29:55,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-07-25 13:29:55,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-25 13:29:55,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-07-25 13:29:55,196 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2018-07-25 13:29:55,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:55,197 INFO L472 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-07-25 13:29:55,197 INFO L473 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-25 13:29:55,197 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-07-25 13:29:55,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-25 13:29:55,198 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:55,198 INFO L354 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1] [2018-07-25 13:29:55,198 INFO L415 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:55,198 INFO L82 PathProgramCache]: Analyzing trace with hash -982073613, now seen corresponding path program 78 times [2018-07-25 13:29:55,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:55,581 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:29:55,582 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:55,582 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-25 13:29:55,582 INFO L451 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-25 13:29:55,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-25 13:29:55,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:29:55,583 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 81 states. [2018-07-25 13:29:56,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:56,020 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-07-25 13:29:56,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-25 13:29:56,021 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-07-25 13:29:56,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:56,022 INFO L225 Difference]: With dead ends: 165 [2018-07-25 13:29:56,022 INFO L226 Difference]: Without dead ends: 163 [2018-07-25 13:29:56,023 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:29:56,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-25 13:29:56,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-07-25 13:29:56,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-25 13:29:56,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-07-25 13:29:56,031 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2018-07-25 13:29:56,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:56,031 INFO L472 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-07-25 13:29:56,031 INFO L473 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-25 13:29:56,032 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-07-25 13:29:56,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-25 13:29:56,032 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:56,033 INFO L354 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1] [2018-07-25 13:29:56,033 INFO L415 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:56,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1120115117, now seen corresponding path program 79 times [2018-07-25 13:29:56,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:56,410 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:29:56,410 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:56,410 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-25 13:29:56,411 INFO L451 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-25 13:29:56,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-25 13:29:56,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 13:29:56,412 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 82 states. [2018-07-25 13:29:56,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:56,880 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-07-25 13:29:56,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-25 13:29:56,881 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-07-25 13:29:56,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:56,882 INFO L225 Difference]: With dead ends: 167 [2018-07-25 13:29:56,882 INFO L226 Difference]: Without dead ends: 165 [2018-07-25 13:29:56,883 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 13:29:56,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-07-25 13:29:56,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-07-25 13:29:56,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-07-25 13:29:56,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-07-25 13:29:56,891 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2018-07-25 13:29:56,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:56,891 INFO L472 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-07-25 13:29:56,891 INFO L473 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-25 13:29:56,891 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-07-25 13:29:56,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-25 13:29:56,892 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:56,892 INFO L354 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1] [2018-07-25 13:29:56,893 INFO L415 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:56,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1606111769, now seen corresponding path program 80 times [2018-07-25 13:29:56,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:57,259 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:29:57,260 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:57,260 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-25 13:29:57,260 INFO L451 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-25 13:29:57,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-25 13:29:57,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:29:57,261 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 83 states. [2018-07-25 13:29:57,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:57,801 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-07-25 13:29:57,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-25 13:29:57,802 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2018-07-25 13:29:57,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:57,803 INFO L225 Difference]: With dead ends: 169 [2018-07-25 13:29:57,803 INFO L226 Difference]: Without dead ends: 167 [2018-07-25 13:29:57,805 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:29:57,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-25 13:29:57,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-07-25 13:29:57,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-07-25 13:29:57,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-07-25 13:29:57,814 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2018-07-25 13:29:57,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:57,814 INFO L472 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-07-25 13:29:57,814 INFO L473 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-25 13:29:57,814 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-07-25 13:29:57,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-07-25 13:29:57,815 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:57,816 INFO L354 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1] [2018-07-25 13:29:57,816 INFO L415 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:57,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1580098655, now seen corresponding path program 81 times [2018-07-25 13:29:57,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:58,371 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:29:58,372 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:58,372 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-25 13:29:58,372 INFO L451 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-25 13:29:58,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-25 13:29:58,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 13:29:58,374 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 84 states. [2018-07-25 13:29:58,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:58,894 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-07-25 13:29:58,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-25 13:29:58,894 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-07-25 13:29:58,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:58,895 INFO L225 Difference]: With dead ends: 171 [2018-07-25 13:29:58,895 INFO L226 Difference]: Without dead ends: 169 [2018-07-25 13:29:58,896 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 13:29:58,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-07-25 13:29:58,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-07-25 13:29:58,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-07-25 13:29:58,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-07-25 13:29:58,902 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2018-07-25 13:29:58,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:58,903 INFO L472 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-07-25 13:29:58,903 INFO L473 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-25 13:29:58,903 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-07-25 13:29:58,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-07-25 13:29:58,904 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:58,904 INFO L354 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1] [2018-07-25 13:29:58,904 INFO L415 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:58,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1943667419, now seen corresponding path program 82 times [2018-07-25 13:29:58,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:59,267 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:29:59,268 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:59,268 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-25 13:29:59,268 INFO L451 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-25 13:29:59,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-25 13:29:59,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:29:59,269 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 85 states. [2018-07-25 13:29:59,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:59,841 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-07-25 13:29:59,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-25 13:29:59,841 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2018-07-25 13:29:59,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:59,842 INFO L225 Difference]: With dead ends: 173 [2018-07-25 13:29:59,843 INFO L226 Difference]: Without dead ends: 171 [2018-07-25 13:29:59,844 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:29:59,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-07-25 13:29:59,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-07-25 13:29:59,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-07-25 13:29:59,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-07-25 13:29:59,855 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2018-07-25 13:29:59,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:59,856 INFO L472 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-07-25 13:29:59,856 INFO L473 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-25 13:29:59,856 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-07-25 13:29:59,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-25 13:29:59,857 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:59,857 INFO L354 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1] [2018-07-25 13:29:59,858 INFO L415 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:59,858 INFO L82 PathProgramCache]: Analyzing trace with hash -446332011, now seen corresponding path program 83 times [2018-07-25 13:29:59,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:00,434 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:30:00,435 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:00,435 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-25 13:30:00,436 INFO L451 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-25 13:30:00,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-25 13:30:00,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 13:30:00,437 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 86 states. [2018-07-25 13:30:00,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:00,952 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-07-25 13:30:00,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-25 13:30:00,952 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-07-25 13:30:00,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:00,953 INFO L225 Difference]: With dead ends: 175 [2018-07-25 13:30:00,953 INFO L226 Difference]: Without dead ends: 173 [2018-07-25 13:30:00,954 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 13:30:00,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-07-25 13:30:00,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-07-25 13:30:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-25 13:30:00,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-07-25 13:30:00,963 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2018-07-25 13:30:00,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:00,963 INFO L472 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-07-25 13:30:00,963 INFO L473 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-25 13:30:00,963 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-07-25 13:30:00,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-25 13:30:00,964 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:00,964 INFO L354 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1] [2018-07-25 13:30:00,964 INFO L415 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:00,965 INFO L82 PathProgramCache]: Analyzing trace with hash 571719119, now seen corresponding path program 84 times [2018-07-25 13:30:00,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:01,397 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:30:01,397 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:01,398 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-25 13:30:01,398 INFO L451 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-25 13:30:01,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-25 13:30:01,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:30:01,399 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 87 states. [2018-07-25 13:30:01,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:01,987 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-07-25 13:30:01,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-25 13:30:01,988 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2018-07-25 13:30:01,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:01,989 INFO L225 Difference]: With dead ends: 177 [2018-07-25 13:30:01,989 INFO L226 Difference]: Without dead ends: 175 [2018-07-25 13:30:01,990 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:30:01,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-07-25 13:30:01,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-07-25 13:30:01,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-07-25 13:30:01,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-07-25 13:30:01,999 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2018-07-25 13:30:01,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:01,999 INFO L472 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-07-25 13:30:01,999 INFO L473 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-25 13:30:01,999 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-07-25 13:30:02,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-07-25 13:30:02,000 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:02,000 INFO L354 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1] [2018-07-25 13:30:02,001 INFO L415 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:02,001 INFO L82 PathProgramCache]: Analyzing trace with hash -333688439, now seen corresponding path program 85 times [2018-07-25 13:30:02,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:02,417 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:30:02,417 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:02,417 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-25 13:30:02,418 INFO L451 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-25 13:30:02,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-25 13:30:02,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 13:30:02,419 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 88 states. [2018-07-25 13:30:02,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:02,948 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-07-25 13:30:02,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-25 13:30:02,949 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-07-25 13:30:02,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:02,950 INFO L225 Difference]: With dead ends: 179 [2018-07-25 13:30:02,950 INFO L226 Difference]: Without dead ends: 177 [2018-07-25 13:30:02,951 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 13:30:02,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-07-25 13:30:02,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-07-25 13:30:02,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-07-25 13:30:02,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-07-25 13:30:02,960 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2018-07-25 13:30:02,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:02,960 INFO L472 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-07-25 13:30:02,961 INFO L473 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-25 13:30:02,961 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-07-25 13:30:02,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-25 13:30:02,962 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:02,962 INFO L354 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1] [2018-07-25 13:30:02,962 INFO L415 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:02,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1448009411, now seen corresponding path program 86 times [2018-07-25 13:30:02,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:03,533 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:30:03,534 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:03,534 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-25 13:30:03,534 INFO L451 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-25 13:30:03,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-25 13:30:03,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:30:03,536 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 89 states. [2018-07-25 13:30:04,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:04,048 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-07-25 13:30:04,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-25 13:30:04,048 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2018-07-25 13:30:04,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:04,049 INFO L225 Difference]: With dead ends: 181 [2018-07-25 13:30:04,049 INFO L226 Difference]: Without dead ends: 179 [2018-07-25 13:30:04,050 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:30:04,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-25 13:30:04,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-07-25 13:30:04,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-07-25 13:30:04,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-07-25 13:30:04,056 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2018-07-25 13:30:04,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:04,057 INFO L472 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-07-25 13:30:04,057 INFO L473 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-25 13:30:04,057 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-07-25 13:30:04,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-25 13:30:04,058 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:04,058 INFO L354 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1] [2018-07-25 13:30:04,058 INFO L415 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:04,058 INFO L82 PathProgramCache]: Analyzing trace with hash -32307843, now seen corresponding path program 87 times [2018-07-25 13:30:04,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:04,467 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:30:04,467 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:04,468 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-25 13:30:04,468 INFO L451 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-25 13:30:04,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-25 13:30:04,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 13:30:04,469 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 90 states. [2018-07-25 13:30:05,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:05,013 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-07-25 13:30:05,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-25 13:30:05,014 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-07-25 13:30:05,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:05,014 INFO L225 Difference]: With dead ends: 183 [2018-07-25 13:30:05,014 INFO L226 Difference]: Without dead ends: 181 [2018-07-25 13:30:05,015 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 13:30:05,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-07-25 13:30:05,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-07-25 13:30:05,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-25 13:30:05,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-07-25 13:30:05,023 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2018-07-25 13:30:05,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:05,024 INFO L472 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-07-25 13:30:05,024 INFO L473 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-25 13:30:05,024 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-07-25 13:30:05,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-25 13:30:05,025 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:05,025 INFO L354 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1] [2018-07-25 13:30:05,025 INFO L415 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:05,026 INFO L82 PathProgramCache]: Analyzing trace with hash -983013961, now seen corresponding path program 88 times [2018-07-25 13:30:05,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:05,552 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:30:05,553 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:05,553 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-25 13:30:05,553 INFO L451 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-25 13:30:05,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-25 13:30:05,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:30:05,555 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 91 states. [2018-07-25 13:30:06,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:06,138 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-07-25 13:30:06,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-25 13:30:06,138 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2018-07-25 13:30:06,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:06,139 INFO L225 Difference]: With dead ends: 185 [2018-07-25 13:30:06,139 INFO L226 Difference]: Without dead ends: 183 [2018-07-25 13:30:06,140 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:30:06,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-25 13:30:06,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-07-25 13:30:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-25 13:30:06,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-07-25 13:30:06,150 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2018-07-25 13:30:06,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:06,151 INFO L472 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-07-25 13:30:06,151 INFO L473 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-25 13:30:06,151 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-07-25 13:30:06,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-07-25 13:30:06,152 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:06,152 INFO L354 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1] [2018-07-25 13:30:06,152 INFO L415 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:06,153 INFO L82 PathProgramCache]: Analyzing trace with hash 216440689, now seen corresponding path program 89 times [2018-07-25 13:30:06,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:06,675 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:30:06,676 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:06,676 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-25 13:30:06,676 INFO L451 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-25 13:30:06,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-25 13:30:06,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 13:30:06,678 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 92 states. [2018-07-25 13:30:07,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:07,242 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-07-25 13:30:07,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-25 13:30:07,242 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2018-07-25 13:30:07,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:07,243 INFO L225 Difference]: With dead ends: 187 [2018-07-25 13:30:07,243 INFO L226 Difference]: Without dead ends: 185 [2018-07-25 13:30:07,244 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 13:30:07,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-25 13:30:07,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-07-25 13:30:07,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-25 13:30:07,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-07-25 13:30:07,250 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2018-07-25 13:30:07,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:07,250 INFO L472 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-07-25 13:30:07,250 INFO L473 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-25 13:30:07,250 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-07-25 13:30:07,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-25 13:30:07,251 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:07,251 INFO L354 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1] [2018-07-25 13:30:07,252 INFO L415 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:07,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1841124011, now seen corresponding path program 90 times [2018-07-25 13:30:07,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:07,712 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:30:07,712 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:07,713 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-25 13:30:07,713 INFO L451 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-25 13:30:07,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-25 13:30:07,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:30:07,714 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 93 states. [2018-07-25 13:30:08,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:08,306 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-07-25 13:30:08,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-25 13:30:08,306 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2018-07-25 13:30:08,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:08,307 INFO L225 Difference]: With dead ends: 189 [2018-07-25 13:30:08,307 INFO L226 Difference]: Without dead ends: 187 [2018-07-25 13:30:08,308 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:30:08,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-07-25 13:30:08,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-07-25 13:30:08,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-07-25 13:30:08,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-07-25 13:30:08,314 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2018-07-25 13:30:08,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:08,314 INFO L472 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-07-25 13:30:08,314 INFO L473 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-25 13:30:08,314 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-07-25 13:30:08,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-07-25 13:30:08,315 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:08,315 INFO L354 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1] [2018-07-25 13:30:08,315 INFO L415 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:08,315 INFO L82 PathProgramCache]: Analyzing trace with hash -206299291, now seen corresponding path program 91 times [2018-07-25 13:30:08,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:08,740 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:30:08,740 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:08,740 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-25 13:30:08,741 INFO L451 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-25 13:30:08,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-25 13:30:08,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 13:30:08,742 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 94 states. [2018-07-25 13:30:09,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:09,342 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-07-25 13:30:09,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-25 13:30:09,343 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2018-07-25 13:30:09,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:09,344 INFO L225 Difference]: With dead ends: 191 [2018-07-25 13:30:09,344 INFO L226 Difference]: Without dead ends: 189 [2018-07-25 13:30:09,345 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 13:30:09,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-07-25 13:30:09,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-07-25 13:30:09,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-07-25 13:30:09,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-07-25 13:30:09,352 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2018-07-25 13:30:09,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:09,352 INFO L472 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-07-25 13:30:09,353 INFO L473 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-25 13:30:09,353 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-07-25 13:30:09,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-07-25 13:30:09,353 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:09,353 INFO L354 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1] [2018-07-25 13:30:09,354 INFO L415 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:09,354 INFO L82 PathProgramCache]: Analyzing trace with hash -685070945, now seen corresponding path program 92 times [2018-07-25 13:30:09,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:10,017 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:10,017 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:10,017 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-25 13:30:10,018 INFO L451 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-25 13:30:10,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-25 13:30:10,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:30:10,019 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 95 states. [2018-07-25 13:30:10,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:10,608 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-07-25 13:30:10,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-25 13:30:10,609 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2018-07-25 13:30:10,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:10,609 INFO L225 Difference]: With dead ends: 193 [2018-07-25 13:30:10,610 INFO L226 Difference]: Without dead ends: 191 [2018-07-25 13:30:10,610 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:30:10,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-07-25 13:30:10,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-07-25 13:30:10,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-07-25 13:30:10,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-07-25 13:30:10,617 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2018-07-25 13:30:10,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:10,617 INFO L472 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-07-25 13:30:10,617 INFO L473 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-25 13:30:10,617 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-07-25 13:30:10,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-07-25 13:30:10,618 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:10,618 INFO L354 BasicCegarLoop]: trace histogram [94, 93, 1, 1, 1] [2018-07-25 13:30:10,618 INFO L415 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:10,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1223129767, now seen corresponding path program 93 times [2018-07-25 13:30:10,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:11,110 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:11,110 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:11,110 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-25 13:30:11,111 INFO L451 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-25 13:30:11,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-25 13:30:11,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 13:30:11,112 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 96 states. [2018-07-25 13:30:11,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:11,719 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-07-25 13:30:11,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-25 13:30:11,719 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2018-07-25 13:30:11,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:11,720 INFO L225 Difference]: With dead ends: 195 [2018-07-25 13:30:11,720 INFO L226 Difference]: Without dead ends: 193 [2018-07-25 13:30:11,721 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 13:30:11,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-07-25 13:30:11,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-07-25 13:30:11,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-07-25 13:30:11,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-07-25 13:30:11,730 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 190 [2018-07-25 13:30:11,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:11,730 INFO L472 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-07-25 13:30:11,731 INFO L473 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-25 13:30:11,731 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-07-25 13:30:11,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-07-25 13:30:11,732 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:11,732 INFO L354 BasicCegarLoop]: trace histogram [95, 94, 1, 1, 1] [2018-07-25 13:30:11,732 INFO L415 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:11,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1393385107, now seen corresponding path program 94 times [2018-07-25 13:30:11,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:12,201 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:12,202 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:12,202 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-25 13:30:12,202 INFO L451 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-25 13:30:12,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-25 13:30:12,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:30:12,204 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 97 states. [2018-07-25 13:30:12,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:12,963 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-07-25 13:30:12,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-25 13:30:12,963 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2018-07-25 13:30:12,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:12,964 INFO L225 Difference]: With dead ends: 197 [2018-07-25 13:30:12,964 INFO L226 Difference]: Without dead ends: 195 [2018-07-25 13:30:12,965 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:30:12,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-07-25 13:30:12,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-07-25 13:30:12,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-07-25 13:30:12,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-07-25 13:30:12,973 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 192 [2018-07-25 13:30:12,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:12,973 INFO L472 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-07-25 13:30:12,974 INFO L473 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-25 13:30:12,974 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-07-25 13:30:12,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-07-25 13:30:12,975 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:12,975 INFO L354 BasicCegarLoop]: trace histogram [96, 95, 1, 1, 1] [2018-07-25 13:30:12,975 INFO L415 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:12,975 INFO L82 PathProgramCache]: Analyzing trace with hash -986656435, now seen corresponding path program 95 times [2018-07-25 13:30:12,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:13,435 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:13,435 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-25 13:30:13,435 INFO L451 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-25 13:30:13,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-25 13:30:13,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 13:30:13,436 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 98 states. [2018-07-25 13:30:14,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:14,063 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-07-25 13:30:14,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-25 13:30:14,064 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2018-07-25 13:30:14,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:14,065 INFO L225 Difference]: With dead ends: 199 [2018-07-25 13:30:14,065 INFO L226 Difference]: Without dead ends: 197 [2018-07-25 13:30:14,066 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 13:30:14,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-07-25 13:30:14,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-07-25 13:30:14,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-07-25 13:30:14,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-07-25 13:30:14,072 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 194 [2018-07-25 13:30:14,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:14,072 INFO L472 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-07-25 13:30:14,072 INFO L473 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-25 13:30:14,072 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-07-25 13:30:14,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-07-25 13:30:14,073 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:14,074 INFO L354 BasicCegarLoop]: trace histogram [97, 96, 1, 1, 1] [2018-07-25 13:30:14,074 INFO L415 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:14,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1010990471, now seen corresponding path program 96 times [2018-07-25 13:30:14,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:14,569 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:14,570 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:14,570 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-25 13:30:14,570 INFO L451 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-25 13:30:14,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-25 13:30:14,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 13:30:14,571 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 99 states. [2018-07-25 13:30:15,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:15,237 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-07-25 13:30:15,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-25 13:30:15,237 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2018-07-25 13:30:15,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:15,238 INFO L225 Difference]: With dead ends: 201 [2018-07-25 13:30:15,238 INFO L226 Difference]: Without dead ends: 199 [2018-07-25 13:30:15,239 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 13:30:15,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-07-25 13:30:15,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-07-25 13:30:15,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-07-25 13:30:15,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-07-25 13:30:15,245 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 196 [2018-07-25 13:30:15,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:15,245 INFO L472 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-07-25 13:30:15,246 INFO L473 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-25 13:30:15,246 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-07-25 13:30:15,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-07-25 13:30:15,246 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:15,246 INFO L354 BasicCegarLoop]: trace histogram [98, 97, 1, 1, 1] [2018-07-25 13:30:15,247 INFO L415 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:15,247 INFO L82 PathProgramCache]: Analyzing trace with hash 899285825, now seen corresponding path program 97 times [2018-07-25 13:30:15,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:15,769 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:15,770 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:15,770 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-25 13:30:15,770 INFO L451 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-25 13:30:15,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-25 13:30:15,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 13:30:15,771 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 100 states. [2018-07-25 13:30:16,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:16,439 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-07-25 13:30:16,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-25 13:30:16,439 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2018-07-25 13:30:16,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:16,440 INFO L225 Difference]: With dead ends: 203 [2018-07-25 13:30:16,441 INFO L226 Difference]: Without dead ends: 201 [2018-07-25 13:30:16,441 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 13:30:16,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-07-25 13:30:16,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-07-25 13:30:16,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-07-25 13:30:16,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-07-25 13:30:16,448 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 198 [2018-07-25 13:30:16,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:16,448 INFO L472 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-07-25 13:30:16,448 INFO L473 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-25 13:30:16,448 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-07-25 13:30:16,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-07-25 13:30:16,449 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:16,449 INFO L354 BasicCegarLoop]: trace histogram [99, 98, 1, 1, 1] [2018-07-25 13:30:16,449 INFO L415 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:16,450 INFO L82 PathProgramCache]: Analyzing trace with hash 925303419, now seen corresponding path program 98 times [2018-07-25 13:30:16,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:16,928 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:16,928 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:16,928 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-25 13:30:16,929 INFO L451 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-25 13:30:16,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-25 13:30:16,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 13:30:16,930 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 101 states. [2018-07-25 13:30:17,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:17,594 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-07-25 13:30:17,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-25 13:30:17,595 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2018-07-25 13:30:17,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:17,596 INFO L225 Difference]: With dead ends: 205 [2018-07-25 13:30:17,596 INFO L226 Difference]: Without dead ends: 203 [2018-07-25 13:30:17,597 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 13:30:17,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-07-25 13:30:17,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-07-25 13:30:17,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-25 13:30:17,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-07-25 13:30:17,606 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 200 [2018-07-25 13:30:17,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:17,607 INFO L472 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-07-25 13:30:17,607 INFO L473 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-25 13:30:17,607 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-07-25 13:30:17,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-07-25 13:30:17,608 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:17,608 INFO L354 BasicCegarLoop]: trace histogram [100, 99, 1, 1, 1] [2018-07-25 13:30:17,608 INFO L415 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:17,609 INFO L82 PathProgramCache]: Analyzing trace with hash 158407477, now seen corresponding path program 99 times [2018-07-25 13:30:17,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:18,123 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:18,123 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:18,123 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-25 13:30:18,123 INFO L451 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-25 13:30:18,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-25 13:30:18,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 13:30:18,125 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 102 states. [2018-07-25 13:30:18,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:18,796 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-07-25 13:30:18,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-25 13:30:18,796 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2018-07-25 13:30:18,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:18,797 INFO L225 Difference]: With dead ends: 207 [2018-07-25 13:30:18,797 INFO L226 Difference]: Without dead ends: 205 [2018-07-25 13:30:18,799 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 13:30:18,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-07-25 13:30:18,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-07-25 13:30:18,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-07-25 13:30:18,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-07-25 13:30:18,807 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 202 [2018-07-25 13:30:18,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:18,808 INFO L472 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-07-25 13:30:18,808 INFO L473 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-25 13:30:18,808 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-07-25 13:30:18,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-07-25 13:30:18,809 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:18,809 INFO L354 BasicCegarLoop]: trace histogram [101, 100, 1, 1, 1] [2018-07-25 13:30:18,809 INFO L415 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:18,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1905782127, now seen corresponding path program 100 times [2018-07-25 13:30:18,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:19,441 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:19,442 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:19,442 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-25 13:30:19,442 INFO L451 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-25 13:30:19,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-25 13:30:19,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 13:30:19,443 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 103 states. [2018-07-25 13:30:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:20,109 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-07-25 13:30:20,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-25 13:30:20,110 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2018-07-25 13:30:20,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:20,111 INFO L225 Difference]: With dead ends: 209 [2018-07-25 13:30:20,111 INFO L226 Difference]: Without dead ends: 207 [2018-07-25 13:30:20,112 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 13:30:20,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-07-25 13:30:20,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-07-25 13:30:20,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-07-25 13:30:20,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-07-25 13:30:20,120 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 204 [2018-07-25 13:30:20,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:20,121 INFO L472 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-07-25 13:30:20,121 INFO L473 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-25 13:30:20,121 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-07-25 13:30:20,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-07-25 13:30:20,122 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:20,122 INFO L354 BasicCegarLoop]: trace histogram [102, 101, 1, 1, 1] [2018-07-25 13:30:20,122 INFO L415 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:20,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1800608041, now seen corresponding path program 101 times [2018-07-25 13:30:20,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:20,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:20,623 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:20,623 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-25 13:30:20,624 INFO L451 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-25 13:30:20,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-25 13:30:20,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 13:30:20,625 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 104 states. [2018-07-25 13:30:21,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:21,322 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-07-25 13:30:21,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-25 13:30:21,322 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2018-07-25 13:30:21,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:21,323 INFO L225 Difference]: With dead ends: 211 [2018-07-25 13:30:21,323 INFO L226 Difference]: Without dead ends: 209 [2018-07-25 13:30:21,325 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 13:30:21,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-07-25 13:30:21,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-07-25 13:30:21,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-07-25 13:30:21,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-07-25 13:30:21,334 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 206 [2018-07-25 13:30:21,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:21,334 INFO L472 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-07-25 13:30:21,334 INFO L473 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-25 13:30:21,334 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-07-25 13:30:21,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-07-25 13:30:21,335 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:21,335 INFO L354 BasicCegarLoop]: trace histogram [103, 102, 1, 1, 1] [2018-07-25 13:30:21,335 INFO L415 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:21,335 INFO L82 PathProgramCache]: Analyzing trace with hash -487440797, now seen corresponding path program 102 times [2018-07-25 13:30:21,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:21,888 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:21,888 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:21,888 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-07-25 13:30:21,889 INFO L451 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-25 13:30:21,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-25 13:30:21,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 13:30:21,890 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 105 states. [2018-07-25 13:30:22,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:22,594 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-07-25 13:30:22,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-07-25 13:30:22,594 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2018-07-25 13:30:22,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:22,595 INFO L225 Difference]: With dead ends: 213 [2018-07-25 13:30:22,595 INFO L226 Difference]: Without dead ends: 211 [2018-07-25 13:30:22,597 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 13:30:22,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-07-25 13:30:22,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-07-25 13:30:22,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-07-25 13:30:22,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-07-25 13:30:22,605 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 208 [2018-07-25 13:30:22,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:22,606 INFO L472 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-07-25 13:30:22,606 INFO L473 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-25 13:30:22,606 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-07-25 13:30:22,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-07-25 13:30:22,607 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:22,607 INFO L354 BasicCegarLoop]: trace histogram [104, 103, 1, 1, 1] [2018-07-25 13:30:22,607 INFO L415 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:22,608 INFO L82 PathProgramCache]: Analyzing trace with hash -279118563, now seen corresponding path program 103 times [2018-07-25 13:30:22,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:23,163 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:23,163 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:23,163 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-25 13:30:23,164 INFO L451 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-07-25 13:30:23,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-07-25 13:30:23,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 13:30:23,165 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 106 states. [2018-07-25 13:30:23,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:23,879 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-07-25 13:30:23,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-25 13:30:23,879 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2018-07-25 13:30:23,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:23,880 INFO L225 Difference]: With dead ends: 215 [2018-07-25 13:30:23,880 INFO L226 Difference]: Without dead ends: 213 [2018-07-25 13:30:23,881 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 13:30:23,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-07-25 13:30:23,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-07-25 13:30:23,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-07-25 13:30:23,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-07-25 13:30:23,890 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 210 [2018-07-25 13:30:23,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:23,890 INFO L472 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-07-25 13:30:23,890 INFO L473 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-07-25 13:30:23,890 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-07-25 13:30:23,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-07-25 13:30:23,891 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:23,891 INFO L354 BasicCegarLoop]: trace histogram [105, 104, 1, 1, 1] [2018-07-25 13:30:23,892 INFO L415 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:23,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1944914601, now seen corresponding path program 104 times [2018-07-25 13:30:23,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:24,442 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:24,442 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:24,443 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-07-25 13:30:24,443 INFO L451 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-07-25 13:30:24,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-07-25 13:30:24,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 13:30:24,444 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 107 states. [2018-07-25 13:30:25,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:25,182 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-07-25 13:30:25,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-07-25 13:30:25,182 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 212 [2018-07-25 13:30:25,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:25,183 INFO L225 Difference]: With dead ends: 217 [2018-07-25 13:30:25,183 INFO L226 Difference]: Without dead ends: 215 [2018-07-25 13:30:25,184 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 13:30:25,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-07-25 13:30:25,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-07-25 13:30:25,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-07-25 13:30:25,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-07-25 13:30:25,193 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 212 [2018-07-25 13:30:25,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:25,193 INFO L472 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-07-25 13:30:25,193 INFO L473 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-07-25 13:30:25,193 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-07-25 13:30:25,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-07-25 13:30:25,194 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:25,194 INFO L354 BasicCegarLoop]: trace histogram [106, 105, 1, 1, 1] [2018-07-25 13:30:25,195 INFO L415 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:25,195 INFO L82 PathProgramCache]: Analyzing trace with hash -752105711, now seen corresponding path program 105 times [2018-07-25 13:30:25,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:25,752 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:25,753 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:25,753 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-07-25 13:30:25,753 INFO L451 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-07-25 13:30:25,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-07-25 13:30:25,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 13:30:25,755 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 108 states. [2018-07-25 13:30:26,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:26,586 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-07-25 13:30:26,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-25 13:30:26,587 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 214 [2018-07-25 13:30:26,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:26,587 INFO L225 Difference]: With dead ends: 219 [2018-07-25 13:30:26,587 INFO L226 Difference]: Without dead ends: 217 [2018-07-25 13:30:26,588 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 13:30:26,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-07-25 13:30:26,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-07-25 13:30:26,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-07-25 13:30:26,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-07-25 13:30:26,595 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 214 [2018-07-25 13:30:26,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:26,595 INFO L472 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-07-25 13:30:26,595 INFO L473 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-07-25 13:30:26,595 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-07-25 13:30:26,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-07-25 13:30:26,596 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:26,596 INFO L354 BasicCegarLoop]: trace histogram [107, 106, 1, 1, 1] [2018-07-25 13:30:26,596 INFO L415 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:26,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1219030453, now seen corresponding path program 106 times [2018-07-25 13:30:26,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:27,150 INFO L134 CoverageAnalysis]: Checked inductivity of 11342 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:27,151 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:27,151 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-07-25 13:30:27,151 INFO L451 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-07-25 13:30:27,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-07-25 13:30:27,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 13:30:27,153 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 109 states. [2018-07-25 13:30:27,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:27,935 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-07-25 13:30:27,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-07-25 13:30:27,935 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 216 [2018-07-25 13:30:27,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:27,935 INFO L225 Difference]: With dead ends: 221 [2018-07-25 13:30:27,936 INFO L226 Difference]: Without dead ends: 219 [2018-07-25 13:30:27,937 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 13:30:27,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-07-25 13:30:27,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-07-25 13:30:27,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-07-25 13:30:27,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-07-25 13:30:27,943 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 216 [2018-07-25 13:30:27,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:27,943 INFO L472 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-07-25 13:30:27,943 INFO L473 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-07-25 13:30:27,943 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-07-25 13:30:27,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-07-25 13:30:27,944 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:27,944 INFO L354 BasicCegarLoop]: trace histogram [108, 107, 1, 1, 1] [2018-07-25 13:30:27,944 INFO L415 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:27,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1037858565, now seen corresponding path program 107 times [2018-07-25 13:30:27,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:28,560 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:28,561 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:28,561 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-07-25 13:30:28,561 INFO L451 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-07-25 13:30:28,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-07-25 13:30:28,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 13:30:28,563 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 110 states. [2018-07-25 13:30:29,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:29,342 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-07-25 13:30:29,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-07-25 13:30:29,343 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 218 [2018-07-25 13:30:29,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:29,343 INFO L225 Difference]: With dead ends: 223 [2018-07-25 13:30:29,344 INFO L226 Difference]: Without dead ends: 221 [2018-07-25 13:30:29,345 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 13:30:29,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-07-25 13:30:29,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-07-25 13:30:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-07-25 13:30:29,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-07-25 13:30:29,353 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 218 [2018-07-25 13:30:29,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:29,354 INFO L472 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-07-25 13:30:29,354 INFO L473 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-07-25 13:30:29,354 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-07-25 13:30:29,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-07-25 13:30:29,355 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:29,355 INFO L354 BasicCegarLoop]: trace histogram [109, 108, 1, 1, 1] [2018-07-25 13:30:29,355 INFO L415 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:29,355 INFO L82 PathProgramCache]: Analyzing trace with hash 949720383, now seen corresponding path program 108 times [2018-07-25 13:30:29,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 11772 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:29,986 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:29,986 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-07-25 13:30:29,986 INFO L451 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-07-25 13:30:29,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-07-25 13:30:29,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 13:30:29,988 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 111 states. [2018-07-25 13:30:30,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:30,762 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-07-25 13:30:30,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-25 13:30:30,763 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 220 [2018-07-25 13:30:30,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:30,764 INFO L225 Difference]: With dead ends: 225 [2018-07-25 13:30:30,764 INFO L226 Difference]: Without dead ends: 223 [2018-07-25 13:30:30,764 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 13:30:30,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-07-25 13:30:30,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-07-25 13:30:30,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-07-25 13:30:30,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-07-25 13:30:30,773 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 220 [2018-07-25 13:30:30,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:30,773 INFO L472 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-07-25 13:30:30,773 INFO L473 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-07-25 13:30:30,774 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-07-25 13:30:30,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-07-25 13:30:30,774 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:30,775 INFO L354 BasicCegarLoop]: trace histogram [110, 109, 1, 1, 1] [2018-07-25 13:30:30,775 INFO L415 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:30,775 INFO L82 PathProgramCache]: Analyzing trace with hash -2146693895, now seen corresponding path program 109 times [2018-07-25 13:30:30,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 11990 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:31,582 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:31,582 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-07-25 13:30:31,582 INFO L451 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-07-25 13:30:31,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-07-25 13:30:31,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 13:30:31,584 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 112 states. [2018-07-25 13:30:32,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:32,391 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-07-25 13:30:32,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-25 13:30:32,391 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 222 [2018-07-25 13:30:32,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:32,392 INFO L225 Difference]: With dead ends: 227 [2018-07-25 13:30:32,392 INFO L226 Difference]: Without dead ends: 225 [2018-07-25 13:30:32,393 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 13:30:32,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-07-25 13:30:32,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-07-25 13:30:32,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-07-25 13:30:32,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-07-25 13:30:32,402 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 222 [2018-07-25 13:30:32,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:32,402 INFO L472 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-07-25 13:30:32,402 INFO L473 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-07-25 13:30:32,402 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-07-25 13:30:32,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-07-25 13:30:32,403 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:32,403 INFO L354 BasicCegarLoop]: trace histogram [111, 110, 1, 1, 1] [2018-07-25 13:30:32,403 INFO L415 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:32,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1388478925, now seen corresponding path program 110 times [2018-07-25 13:30:32,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:33,025 INFO L134 CoverageAnalysis]: Checked inductivity of 12210 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:33,025 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:33,025 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-07-25 13:30:33,025 INFO L451 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-07-25 13:30:33,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-07-25 13:30:33,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 13:30:33,027 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 113 states. [2018-07-25 13:30:33,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:33,937 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-07-25 13:30:33,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-25 13:30:33,938 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 224 [2018-07-25 13:30:33,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:33,938 INFO L225 Difference]: With dead ends: 229 [2018-07-25 13:30:33,938 INFO L226 Difference]: Without dead ends: 227 [2018-07-25 13:30:33,939 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 13:30:33,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-07-25 13:30:33,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-07-25 13:30:33,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-07-25 13:30:33,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-07-25 13:30:33,945 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 224 [2018-07-25 13:30:33,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:33,945 INFO L472 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-07-25 13:30:33,945 INFO L473 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-07-25 13:30:33,945 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-07-25 13:30:33,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-07-25 13:30:33,946 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:33,946 INFO L354 BasicCegarLoop]: trace histogram [112, 111, 1, 1, 1] [2018-07-25 13:30:33,946 INFO L415 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:33,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1406634221, now seen corresponding path program 111 times [2018-07-25 13:30:33,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:34,546 INFO L134 CoverageAnalysis]: Checked inductivity of 12432 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:34,546 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:34,547 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-07-25 13:30:34,547 INFO L451 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-07-25 13:30:34,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-07-25 13:30:34,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 13:30:34,548 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 114 states. [2018-07-25 13:30:35,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:35,384 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-07-25 13:30:35,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-07-25 13:30:35,385 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 226 [2018-07-25 13:30:35,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:35,385 INFO L225 Difference]: With dead ends: 231 [2018-07-25 13:30:35,385 INFO L226 Difference]: Without dead ends: 229 [2018-07-25 13:30:35,387 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 13:30:35,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-07-25 13:30:35,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-07-25 13:30:35,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-07-25 13:30:35,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-07-25 13:30:35,393 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 226 [2018-07-25 13:30:35,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:35,393 INFO L472 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-07-25 13:30:35,393 INFO L473 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-07-25 13:30:35,393 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-07-25 13:30:35,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-07-25 13:30:35,394 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:35,394 INFO L354 BasicCegarLoop]: trace histogram [113, 112, 1, 1, 1] [2018-07-25 13:30:35,394 INFO L415 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:35,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1139159769, now seen corresponding path program 112 times [2018-07-25 13:30:35,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:36,048 INFO L134 CoverageAnalysis]: Checked inductivity of 12656 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:36,048 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:36,048 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-07-25 13:30:36,048 INFO L451 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-07-25 13:30:36,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-07-25 13:30:36,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 13:30:36,050 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 115 states. [2018-07-25 13:30:36,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:36,908 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-07-25 13:30:36,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-07-25 13:30:36,908 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 228 [2018-07-25 13:30:36,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:36,909 INFO L225 Difference]: With dead ends: 233 [2018-07-25 13:30:36,909 INFO L226 Difference]: Without dead ends: 231 [2018-07-25 13:30:36,910 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 13:30:36,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-07-25 13:30:36,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-07-25 13:30:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-07-25 13:30:36,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-07-25 13:30:36,917 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 228 [2018-07-25 13:30:36,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:36,917 INFO L472 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-07-25 13:30:36,917 INFO L473 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-07-25 13:30:36,918 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-07-25 13:30:36,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-07-25 13:30:36,918 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:36,919 INFO L354 BasicCegarLoop]: trace histogram [114, 113, 1, 1, 1] [2018-07-25 13:30:36,919 INFO L415 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:36,919 INFO L82 PathProgramCache]: Analyzing trace with hash 484174561, now seen corresponding path program 113 times [2018-07-25 13:30:36,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:37,603 INFO L134 CoverageAnalysis]: Checked inductivity of 12882 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:37,604 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:37,604 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-07-25 13:30:37,604 INFO L451 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-07-25 13:30:37,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-07-25 13:30:37,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 13:30:37,605 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 116 states. [2018-07-25 13:30:38,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:38,450 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-07-25 13:30:38,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-25 13:30:38,450 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 230 [2018-07-25 13:30:38,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:38,451 INFO L225 Difference]: With dead ends: 235 [2018-07-25 13:30:38,451 INFO L226 Difference]: Without dead ends: 233 [2018-07-25 13:30:38,452 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 13:30:38,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-07-25 13:30:38,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-07-25 13:30:38,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-07-25 13:30:38,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-07-25 13:30:38,459 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 230 [2018-07-25 13:30:38,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:38,459 INFO L472 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-07-25 13:30:38,459 INFO L473 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-07-25 13:30:38,459 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-07-25 13:30:38,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-07-25 13:30:38,460 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:38,460 INFO L354 BasicCegarLoop]: trace histogram [115, 114, 1, 1, 1] [2018-07-25 13:30:38,461 INFO L415 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:38,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1435337243, now seen corresponding path program 114 times [2018-07-25 13:30:38,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:39,149 INFO L134 CoverageAnalysis]: Checked inductivity of 13110 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:39,149 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:39,149 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-07-25 13:30:39,150 INFO L451 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-07-25 13:30:39,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-07-25 13:30:39,151 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 13:30:39,151 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 117 states. [2018-07-25 13:30:40,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:40,027 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-07-25 13:30:40,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-07-25 13:30:40,027 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 232 [2018-07-25 13:30:40,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:40,028 INFO L225 Difference]: With dead ends: 237 [2018-07-25 13:30:40,028 INFO L226 Difference]: Without dead ends: 235 [2018-07-25 13:30:40,030 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 13:30:40,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-07-25 13:30:40,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-07-25 13:30:40,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-07-25 13:30:40,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-07-25 13:30:40,036 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 232 [2018-07-25 13:30:40,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:40,036 INFO L472 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-07-25 13:30:40,036 INFO L473 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-07-25 13:30:40,036 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-07-25 13:30:40,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-07-25 13:30:40,037 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:40,037 INFO L354 BasicCegarLoop]: trace histogram [116, 115, 1, 1, 1] [2018-07-25 13:30:40,037 INFO L415 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:40,037 INFO L82 PathProgramCache]: Analyzing trace with hash 674640597, now seen corresponding path program 115 times [2018-07-25 13:30:40,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:40,729 INFO L134 CoverageAnalysis]: Checked inductivity of 13340 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:40,729 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:40,729 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-07-25 13:30:40,729 INFO L451 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-07-25 13:30:40,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-07-25 13:30:40,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 13:30:40,731 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 118 states. [2018-07-25 13:30:41,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:41,679 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-07-25 13:30:41,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-25 13:30:41,679 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 234 [2018-07-25 13:30:41,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:41,680 INFO L225 Difference]: With dead ends: 239 [2018-07-25 13:30:41,680 INFO L226 Difference]: Without dead ends: 237 [2018-07-25 13:30:41,681 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 13:30:41,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-07-25 13:30:41,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-07-25 13:30:41,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-07-25 13:30:41,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-07-25 13:30:41,687 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 234 [2018-07-25 13:30:41,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:41,687 INFO L472 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-07-25 13:30:41,687 INFO L473 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-07-25 13:30:41,687 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-07-25 13:30:41,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-07-25 13:30:41,688 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:41,688 INFO L354 BasicCegarLoop]: trace histogram [117, 116, 1, 1, 1] [2018-07-25 13:30:41,688 INFO L415 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:41,689 INFO L82 PathProgramCache]: Analyzing trace with hash -210395889, now seen corresponding path program 116 times [2018-07-25 13:30:41,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:42,372 INFO L134 CoverageAnalysis]: Checked inductivity of 13572 backedges. 0 proven. 13572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:42,373 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:42,373 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-07-25 13:30:42,373 INFO L451 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-07-25 13:30:42,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-07-25 13:30:42,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 13:30:42,374 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 119 states. [2018-07-25 13:30:43,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:43,296 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-07-25 13:30:43,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-07-25 13:30:43,297 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 236 [2018-07-25 13:30:43,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:43,297 INFO L225 Difference]: With dead ends: 241 [2018-07-25 13:30:43,297 INFO L226 Difference]: Without dead ends: 239 [2018-07-25 13:30:43,299 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 13:30:43,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-07-25 13:30:43,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-07-25 13:30:43,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-07-25 13:30:43,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-07-25 13:30:43,308 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 236 [2018-07-25 13:30:43,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:43,308 INFO L472 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-07-25 13:30:43,308 INFO L473 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-07-25 13:30:43,308 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-07-25 13:30:43,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-07-25 13:30:43,309 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:43,309 INFO L354 BasicCegarLoop]: trace histogram [118, 117, 1, 1, 1] [2018-07-25 13:30:43,309 INFO L415 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:43,310 INFO L82 PathProgramCache]: Analyzing trace with hash -326934327, now seen corresponding path program 117 times [2018-07-25 13:30:43,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:43,984 INFO L134 CoverageAnalysis]: Checked inductivity of 13806 backedges. 0 proven. 13806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:43,985 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:43,985 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-07-25 13:30:43,985 INFO L451 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-07-25 13:30:43,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-07-25 13:30:43,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 13:30:43,987 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 120 states. [2018-07-25 13:30:44,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:44,945 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-07-25 13:30:44,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-07-25 13:30:44,945 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 238 [2018-07-25 13:30:44,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:44,946 INFO L225 Difference]: With dead ends: 243 [2018-07-25 13:30:44,946 INFO L226 Difference]: Without dead ends: 241 [2018-07-25 13:30:44,947 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 13:30:44,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-07-25 13:30:44,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-07-25 13:30:44,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-07-25 13:30:44,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-07-25 13:30:44,954 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 238 [2018-07-25 13:30:44,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:44,954 INFO L472 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-07-25 13:30:44,954 INFO L473 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-07-25 13:30:44,954 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-07-25 13:30:44,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-07-25 13:30:44,955 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:44,955 INFO L354 BasicCegarLoop]: trace histogram [119, 118, 1, 1, 1] [2018-07-25 13:30:44,956 INFO L415 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:44,956 INFO L82 PathProgramCache]: Analyzing trace with hash -651223549, now seen corresponding path program 118 times [2018-07-25 13:30:44,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:45,673 INFO L134 CoverageAnalysis]: Checked inductivity of 14042 backedges. 0 proven. 14042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:45,673 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:45,674 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-07-25 13:30:45,674 INFO L451 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-07-25 13:30:45,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-07-25 13:30:45,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 13:30:45,675 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 121 states. [2018-07-25 13:30:46,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:46,621 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-07-25 13:30:46,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-07-25 13:30:46,621 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 240 [2018-07-25 13:30:46,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:46,622 INFO L225 Difference]: With dead ends: 245 [2018-07-25 13:30:46,622 INFO L226 Difference]: Without dead ends: 243 [2018-07-25 13:30:46,624 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 13:30:46,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-07-25 13:30:46,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-07-25 13:30:46,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-07-25 13:30:46,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-07-25 13:30:46,630 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 240 [2018-07-25 13:30:46,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:46,630 INFO L472 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-07-25 13:30:46,630 INFO L473 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-07-25 13:30:46,630 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-07-25 13:30:46,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-07-25 13:30:46,631 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:46,631 INFO L354 BasicCegarLoop]: trace histogram [120, 119, 1, 1, 1] [2018-07-25 13:30:46,631 INFO L415 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:46,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1239446717, now seen corresponding path program 119 times [2018-07-25 13:30:46,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:47,335 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 14280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:47,335 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:47,335 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-07-25 13:30:47,336 INFO L451 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-07-25 13:30:47,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-07-25 13:30:47,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 13:30:47,337 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 122 states. [2018-07-25 13:30:48,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:48,315 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-07-25 13:30:48,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-07-25 13:30:48,316 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 242 [2018-07-25 13:30:48,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:48,316 INFO L225 Difference]: With dead ends: 247 [2018-07-25 13:30:48,316 INFO L226 Difference]: Without dead ends: 245 [2018-07-25 13:30:48,318 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 13:30:48,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-07-25 13:30:48,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-07-25 13:30:48,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-07-25 13:30:48,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-07-25 13:30:48,324 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 242 [2018-07-25 13:30:48,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:48,324 INFO L472 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-07-25 13:30:48,324 INFO L473 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-07-25 13:30:48,324 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-07-25 13:30:48,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-07-25 13:30:48,325 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:48,325 INFO L354 BasicCegarLoop]: trace histogram [121, 120, 1, 1, 1] [2018-07-25 13:30:48,325 INFO L415 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:48,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1402406135, now seen corresponding path program 120 times [2018-07-25 13:30:48,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:49,096 INFO L134 CoverageAnalysis]: Checked inductivity of 14520 backedges. 0 proven. 14520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:49,096 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:49,096 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-07-25 13:30:49,096 INFO L451 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-07-25 13:30:49,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-07-25 13:30:49,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 13:30:49,097 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 123 states. [2018-07-25 13:30:50,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:50,060 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-07-25 13:30:50,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-07-25 13:30:50,060 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 244 [2018-07-25 13:30:50,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:50,060 INFO L225 Difference]: With dead ends: 249 [2018-07-25 13:30:50,061 INFO L226 Difference]: Without dead ends: 247 [2018-07-25 13:30:50,061 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 13:30:50,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-07-25 13:30:50,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-07-25 13:30:50,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-07-25 13:30:50,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-07-25 13:30:50,068 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 244 [2018-07-25 13:30:50,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:50,068 INFO L472 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-07-25 13:30:50,068 INFO L473 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-07-25 13:30:50,068 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-07-25 13:30:50,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-07-25 13:30:50,069 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:50,069 INFO L354 BasicCegarLoop]: trace histogram [122, 121, 1, 1, 1] [2018-07-25 13:30:50,069 INFO L415 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:50,069 INFO L82 PathProgramCache]: Analyzing trace with hash -907383119, now seen corresponding path program 121 times [2018-07-25 13:30:50,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:50,791 INFO L134 CoverageAnalysis]: Checked inductivity of 14762 backedges. 0 proven. 14762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:50,791 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:50,791 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-07-25 13:30:50,792 INFO L451 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-07-25 13:30:50,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-07-25 13:30:50,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 13:30:50,793 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 124 states. [2018-07-25 13:30:51,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:51,817 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-07-25 13:30:51,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-07-25 13:30:51,818 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 246 [2018-07-25 13:30:51,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:51,819 INFO L225 Difference]: With dead ends: 251 [2018-07-25 13:30:51,819 INFO L226 Difference]: Without dead ends: 249 [2018-07-25 13:30:51,821 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 13:30:51,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-07-25 13:30:51,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-07-25 13:30:51,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-07-25 13:30:51,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-07-25 13:30:51,829 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 246 [2018-07-25 13:30:51,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:51,829 INFO L472 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-07-25 13:30:51,830 INFO L473 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-07-25 13:30:51,830 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-07-25 13:30:51,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-07-25 13:30:51,831 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:51,831 INFO L354 BasicCegarLoop]: trace histogram [123, 122, 1, 1, 1] [2018-07-25 13:30:51,831 INFO L415 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:51,831 INFO L82 PathProgramCache]: Analyzing trace with hash -116764181, now seen corresponding path program 122 times [2018-07-25 13:30:51,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:52,571 INFO L134 CoverageAnalysis]: Checked inductivity of 15006 backedges. 0 proven. 15006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:52,572 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:52,572 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-07-25 13:30:52,572 INFO L451 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-07-25 13:30:52,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-07-25 13:30:52,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 13:30:52,573 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 125 states. [2018-07-25 13:30:53,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:53,594 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-07-25 13:30:53,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-07-25 13:30:53,594 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 248 [2018-07-25 13:30:53,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:53,595 INFO L225 Difference]: With dead ends: 253 [2018-07-25 13:30:53,595 INFO L226 Difference]: Without dead ends: 251 [2018-07-25 13:30:53,595 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 13:30:53,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-07-25 13:30:53,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-07-25 13:30:53,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-07-25 13:30:53,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-07-25 13:30:53,602 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 248 [2018-07-25 13:30:53,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:53,602 INFO L472 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-07-25 13:30:53,602 INFO L473 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-07-25 13:30:53,602 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-07-25 13:30:53,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-07-25 13:30:53,603 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:53,603 INFO L354 BasicCegarLoop]: trace histogram [124, 123, 1, 1, 1] [2018-07-25 13:30:53,603 INFO L415 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:53,604 INFO L82 PathProgramCache]: Analyzing trace with hash -541176155, now seen corresponding path program 123 times [2018-07-25 13:30:53,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:54,327 INFO L134 CoverageAnalysis]: Checked inductivity of 15252 backedges. 0 proven. 15252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:54,328 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:54,328 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-07-25 13:30:54,328 INFO L451 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-07-25 13:30:54,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-07-25 13:30:54,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 13:30:54,329 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 126 states. [2018-07-25 13:30:55,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:55,376 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-07-25 13:30:55,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-07-25 13:30:55,376 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 250 [2018-07-25 13:30:55,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:55,377 INFO L225 Difference]: With dead ends: 255 [2018-07-25 13:30:55,377 INFO L226 Difference]: Without dead ends: 253 [2018-07-25 13:30:55,378 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 13:30:55,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-07-25 13:30:55,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-07-25 13:30:55,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-07-25 13:30:55,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-07-25 13:30:55,385 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 250 [2018-07-25 13:30:55,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:55,385 INFO L472 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-07-25 13:30:55,386 INFO L473 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-07-25 13:30:55,386 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-07-25 13:30:55,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-07-25 13:30:55,387 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:55,387 INFO L354 BasicCegarLoop]: trace histogram [125, 124, 1, 1, 1] [2018-07-25 13:30:55,387 INFO L415 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:55,387 INFO L82 PathProgramCache]: Analyzing trace with hash -379190049, now seen corresponding path program 124 times [2018-07-25 13:30:55,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:56,137 INFO L134 CoverageAnalysis]: Checked inductivity of 15500 backedges. 0 proven. 15500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:56,137 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:56,137 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-07-25 13:30:56,138 INFO L451 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-07-25 13:30:56,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-07-25 13:30:56,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 13:30:56,139 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 127 states. [2018-07-25 13:30:57,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:57,273 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-07-25 13:30:57,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-07-25 13:30:57,274 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 252 [2018-07-25 13:30:57,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:57,274 INFO L225 Difference]: With dead ends: 257 [2018-07-25 13:30:57,274 INFO L226 Difference]: Without dead ends: 255 [2018-07-25 13:30:57,275 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 13:30:57,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-07-25 13:30:57,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-07-25 13:30:57,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-07-25 13:30:57,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-07-25 13:30:57,282 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 252 [2018-07-25 13:30:57,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:57,282 INFO L472 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-07-25 13:30:57,282 INFO L473 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-07-25 13:30:57,282 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-07-25 13:30:57,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-07-25 13:30:57,283 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:57,283 INFO L354 BasicCegarLoop]: trace histogram [126, 125, 1, 1, 1] [2018-07-25 13:30:57,283 INFO L415 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:57,283 INFO L82 PathProgramCache]: Analyzing trace with hash 670635161, now seen corresponding path program 125 times [2018-07-25 13:30:57,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:58,026 INFO L134 CoverageAnalysis]: Checked inductivity of 15750 backedges. 0 proven. 15750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:58,026 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:58,026 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-07-25 13:30:58,027 INFO L451 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-07-25 13:30:58,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-07-25 13:30:58,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 13:30:58,028 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 128 states. [2018-07-25 13:30:59,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:30:59,109 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-07-25 13:30:59,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-07-25 13:30:59,110 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 254 [2018-07-25 13:30:59,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:30:59,110 INFO L225 Difference]: With dead ends: 259 [2018-07-25 13:30:59,110 INFO L226 Difference]: Without dead ends: 257 [2018-07-25 13:30:59,112 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 13:30:59,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-07-25 13:30:59,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2018-07-25 13:30:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-07-25 13:30:59,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-07-25 13:30:59,119 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 254 [2018-07-25 13:30:59,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:30:59,119 INFO L472 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-07-25 13:30:59,119 INFO L473 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-07-25 13:30:59,119 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-07-25 13:30:59,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-07-25 13:30:59,120 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:30:59,120 INFO L354 BasicCegarLoop]: trace histogram [127, 126, 1, 1, 1] [2018-07-25 13:30:59,120 INFO L415 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:30:59,120 INFO L82 PathProgramCache]: Analyzing trace with hash 235347411, now seen corresponding path program 126 times [2018-07-25 13:30:59,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:30:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:30:59,999 INFO L134 CoverageAnalysis]: Checked inductivity of 16002 backedges. 0 proven. 16002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:30:59,999 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:30:59,999 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-07-25 13:31:00,000 INFO L451 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-07-25 13:31:00,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-07-25 13:31:00,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 13:31:00,002 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 129 states. [2018-07-25 13:31:01,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:01,102 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-07-25 13:31:01,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-07-25 13:31:01,102 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 256 [2018-07-25 13:31:01,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:01,103 INFO L225 Difference]: With dead ends: 261 [2018-07-25 13:31:01,103 INFO L226 Difference]: Without dead ends: 259 [2018-07-25 13:31:01,105 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 13:31:01,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-07-25 13:31:01,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-07-25 13:31:01,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-07-25 13:31:01,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2018-07-25 13:31:01,112 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 256 [2018-07-25 13:31:01,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:01,112 INFO L472 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2018-07-25 13:31:01,112 INFO L473 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-07-25 13:31:01,113 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2018-07-25 13:31:01,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-07-25 13:31:01,113 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:01,113 INFO L354 BasicCegarLoop]: trace histogram [128, 127, 1, 1, 1] [2018-07-25 13:31:01,114 INFO L415 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:01,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1464352627, now seen corresponding path program 127 times [2018-07-25 13:31:01,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:01,938 INFO L134 CoverageAnalysis]: Checked inductivity of 16256 backedges. 0 proven. 16256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:01,938 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:01,938 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-07-25 13:31:01,939 INFO L451 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-07-25 13:31:01,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-07-25 13:31:01,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 13:31:01,941 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 130 states. [2018-07-25 13:31:03,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:03,063 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-07-25 13:31:03,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-07-25 13:31:03,063 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 258 [2018-07-25 13:31:03,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:03,064 INFO L225 Difference]: With dead ends: 263 [2018-07-25 13:31:03,064 INFO L226 Difference]: Without dead ends: 261 [2018-07-25 13:31:03,066 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 13:31:03,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-07-25 13:31:03,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2018-07-25 13:31:03,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-07-25 13:31:03,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-07-25 13:31:03,074 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 258 [2018-07-25 13:31:03,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:03,074 INFO L472 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-07-25 13:31:03,074 INFO L473 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-07-25 13:31:03,074 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-07-25 13:31:03,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-07-25 13:31:03,075 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:03,075 INFO L354 BasicCegarLoop]: trace histogram [129, 128, 1, 1, 1] [2018-07-25 13:31:03,076 INFO L415 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:03,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1506450631, now seen corresponding path program 128 times [2018-07-25 13:31:03,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:03,880 INFO L134 CoverageAnalysis]: Checked inductivity of 16512 backedges. 0 proven. 16512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:03,880 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:03,880 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-07-25 13:31:03,881 INFO L451 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-07-25 13:31:03,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-07-25 13:31:03,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 13:31:03,883 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 131 states. [2018-07-25 13:31:05,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:05,021 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-07-25 13:31:05,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-07-25 13:31:05,022 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 260 [2018-07-25 13:31:05,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:05,023 INFO L225 Difference]: With dead ends: 265 [2018-07-25 13:31:05,023 INFO L226 Difference]: Without dead ends: 263 [2018-07-25 13:31:05,024 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 13:31:05,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-07-25 13:31:05,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-07-25 13:31:05,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-07-25 13:31:05,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-07-25 13:31:05,031 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 260 [2018-07-25 13:31:05,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:05,032 INFO L472 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-07-25 13:31:05,032 INFO L473 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-07-25 13:31:05,032 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-07-25 13:31:05,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-07-25 13:31:05,032 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:05,032 INFO L354 BasicCegarLoop]: trace histogram [130, 129, 1, 1, 1] [2018-07-25 13:31:05,033 INFO L415 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:05,033 INFO L82 PathProgramCache]: Analyzing trace with hash 295129729, now seen corresponding path program 129 times [2018-07-25 13:31:05,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 16770 backedges. 0 proven. 16770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:05,894 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:05,894 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-07-25 13:31:05,894 INFO L451 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-07-25 13:31:05,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-07-25 13:31:05,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 13:31:05,896 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 132 states. [2018-07-25 13:31:07,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:07,025 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-07-25 13:31:07,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-07-25 13:31:07,025 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 262 [2018-07-25 13:31:07,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:07,026 INFO L225 Difference]: With dead ends: 267 [2018-07-25 13:31:07,026 INFO L226 Difference]: Without dead ends: 265 [2018-07-25 13:31:07,027 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 13:31:07,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-07-25 13:31:07,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2018-07-25 13:31:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-07-25 13:31:07,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-07-25 13:31:07,033 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 262 [2018-07-25 13:31:07,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:07,034 INFO L472 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-07-25 13:31:07,034 INFO L473 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-07-25 13:31:07,034 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-07-25 13:31:07,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-07-25 13:31:07,035 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:07,035 INFO L354 BasicCegarLoop]: trace histogram [131, 130, 1, 1, 1] [2018-07-25 13:31:07,035 INFO L415 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:07,035 INFO L82 PathProgramCache]: Analyzing trace with hash 151880123, now seen corresponding path program 130 times [2018-07-25 13:31:07,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:07,851 INFO L134 CoverageAnalysis]: Checked inductivity of 17030 backedges. 0 proven. 17030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:07,851 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:07,851 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-07-25 13:31:07,851 INFO L451 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-07-25 13:31:07,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-07-25 13:31:07,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 13:31:07,853 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 133 states. [2018-07-25 13:31:09,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:09,021 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-07-25 13:31:09,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-07-25 13:31:09,021 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 264 [2018-07-25 13:31:09,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:09,022 INFO L225 Difference]: With dead ends: 269 [2018-07-25 13:31:09,022 INFO L226 Difference]: Without dead ends: 267 [2018-07-25 13:31:09,023 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 13:31:09,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-07-25 13:31:09,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-07-25 13:31:09,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-07-25 13:31:09,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-07-25 13:31:09,030 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 264 [2018-07-25 13:31:09,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:09,030 INFO L472 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-07-25 13:31:09,030 INFO L473 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-07-25 13:31:09,030 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-07-25 13:31:09,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-07-25 13:31:09,031 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:09,031 INFO L354 BasicCegarLoop]: trace histogram [132, 131, 1, 1, 1] [2018-07-25 13:31:09,031 INFO L415 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:09,032 INFO L82 PathProgramCache]: Analyzing trace with hash -72037771, now seen corresponding path program 131 times [2018-07-25 13:31:09,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:09,877 INFO L134 CoverageAnalysis]: Checked inductivity of 17292 backedges. 0 proven. 17292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:09,877 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:09,877 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-07-25 13:31:09,878 INFO L451 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-07-25 13:31:09,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-07-25 13:31:09,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 13:31:09,879 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 134 states. [2018-07-25 13:31:11,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:11,008 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-07-25 13:31:11,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-07-25 13:31:11,009 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 266 [2018-07-25 13:31:11,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:11,009 INFO L225 Difference]: With dead ends: 271 [2018-07-25 13:31:11,009 INFO L226 Difference]: Without dead ends: 269 [2018-07-25 13:31:11,011 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 13:31:11,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-07-25 13:31:11,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-07-25 13:31:11,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-07-25 13:31:11,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-07-25 13:31:11,018 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 266 [2018-07-25 13:31:11,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:11,018 INFO L472 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-07-25 13:31:11,018 INFO L473 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-07-25 13:31:11,018 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-07-25 13:31:11,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-07-25 13:31:11,019 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:11,019 INFO L354 BasicCegarLoop]: trace histogram [133, 132, 1, 1, 1] [2018-07-25 13:31:11,019 INFO L415 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:11,019 INFO L82 PathProgramCache]: Analyzing trace with hash -508769105, now seen corresponding path program 132 times [2018-07-25 13:31:11,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:11,823 INFO L134 CoverageAnalysis]: Checked inductivity of 17556 backedges. 0 proven. 17556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:11,824 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:11,824 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-07-25 13:31:11,824 INFO L451 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-07-25 13:31:11,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-07-25 13:31:11,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 13:31:11,826 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 135 states. [2018-07-25 13:31:13,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:13,016 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-07-25 13:31:13,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-07-25 13:31:13,017 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 268 [2018-07-25 13:31:13,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:13,017 INFO L225 Difference]: With dead ends: 273 [2018-07-25 13:31:13,017 INFO L226 Difference]: Without dead ends: 271 [2018-07-25 13:31:13,019 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 13:31:13,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-07-25 13:31:13,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-07-25 13:31:13,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-07-25 13:31:13,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-07-25 13:31:13,027 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 268 [2018-07-25 13:31:13,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:13,027 INFO L472 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-07-25 13:31:13,027 INFO L473 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-07-25 13:31:13,027 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-07-25 13:31:13,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-07-25 13:31:13,028 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:13,028 INFO L354 BasicCegarLoop]: trace histogram [134, 133, 1, 1, 1] [2018-07-25 13:31:13,028 INFO L415 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:13,028 INFO L82 PathProgramCache]: Analyzing trace with hash 699213929, now seen corresponding path program 133 times [2018-07-25 13:31:13,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:14,050 INFO L134 CoverageAnalysis]: Checked inductivity of 17822 backedges. 0 proven. 17822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:14,050 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:14,050 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-07-25 13:31:14,050 INFO L451 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-07-25 13:31:14,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-07-25 13:31:14,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 13:31:14,052 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 136 states. [2018-07-25 13:31:15,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:15,231 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-07-25 13:31:15,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-07-25 13:31:15,232 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 270 [2018-07-25 13:31:15,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:15,232 INFO L225 Difference]: With dead ends: 275 [2018-07-25 13:31:15,232 INFO L226 Difference]: Without dead ends: 273 [2018-07-25 13:31:15,234 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 13:31:15,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-07-25 13:31:15,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-07-25 13:31:15,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-07-25 13:31:15,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-07-25 13:31:15,240 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 270 [2018-07-25 13:31:15,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:15,241 INFO L472 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-07-25 13:31:15,241 INFO L473 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-07-25 13:31:15,241 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-07-25 13:31:15,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-07-25 13:31:15,242 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:15,242 INFO L354 BasicCegarLoop]: trace histogram [135, 134, 1, 1, 1] [2018-07-25 13:31:15,242 INFO L415 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:15,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1929739683, now seen corresponding path program 134 times [2018-07-25 13:31:15,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:16,194 INFO L134 CoverageAnalysis]: Checked inductivity of 18090 backedges. 0 proven. 18090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:16,194 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:16,195 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-07-25 13:31:16,195 INFO L451 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-07-25 13:31:16,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-07-25 13:31:16,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 13:31:16,197 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 137 states. [2018-07-25 13:31:17,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:17,425 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2018-07-25 13:31:17,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-07-25 13:31:17,425 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 272 [2018-07-25 13:31:17,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:17,426 INFO L225 Difference]: With dead ends: 277 [2018-07-25 13:31:17,426 INFO L226 Difference]: Without dead ends: 275 [2018-07-25 13:31:17,428 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 13:31:17,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-07-25 13:31:17,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-07-25 13:31:17,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-07-25 13:31:17,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-07-25 13:31:17,439 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 272 [2018-07-25 13:31:17,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:17,440 INFO L472 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-07-25 13:31:17,440 INFO L473 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-07-25 13:31:17,440 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-07-25 13:31:17,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-07-25 13:31:17,441 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:17,441 INFO L354 BasicCegarLoop]: trace histogram [136, 135, 1, 1, 1] [2018-07-25 13:31:17,441 INFO L415 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:17,441 INFO L82 PathProgramCache]: Analyzing trace with hash -945984419, now seen corresponding path program 135 times [2018-07-25 13:31:17,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:18,407 INFO L134 CoverageAnalysis]: Checked inductivity of 18360 backedges. 0 proven. 18360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:18,407 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:18,407 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-07-25 13:31:18,407 INFO L451 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-07-25 13:31:18,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-07-25 13:31:18,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 13:31:18,409 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 138 states. [2018-07-25 13:31:19,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:19,627 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-07-25 13:31:19,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-07-25 13:31:19,627 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 274 [2018-07-25 13:31:19,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:19,628 INFO L225 Difference]: With dead ends: 279 [2018-07-25 13:31:19,628 INFO L226 Difference]: Without dead ends: 277 [2018-07-25 13:31:19,629 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 13:31:19,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-07-25 13:31:19,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-07-25 13:31:19,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-07-25 13:31:19,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-07-25 13:31:19,636 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 274 [2018-07-25 13:31:19,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:19,636 INFO L472 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-07-25 13:31:19,636 INFO L473 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-07-25 13:31:19,636 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-07-25 13:31:19,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-07-25 13:31:19,637 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:19,637 INFO L354 BasicCegarLoop]: trace histogram [137, 136, 1, 1, 1] [2018-07-25 13:31:19,637 INFO L415 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:19,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1442092183, now seen corresponding path program 136 times [2018-07-25 13:31:19,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 18632 backedges. 0 proven. 18632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:20,565 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:20,565 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-07-25 13:31:20,565 INFO L451 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-07-25 13:31:20,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-07-25 13:31:20,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=18907, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 13:31:20,567 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 139 states. [2018-07-25 13:31:21,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:21,829 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-07-25 13:31:21,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-07-25 13:31:21,829 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 276 [2018-07-25 13:31:21,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:21,830 INFO L225 Difference]: With dead ends: 281 [2018-07-25 13:31:21,830 INFO L226 Difference]: Without dead ends: 279 [2018-07-25 13:31:21,832 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=275, Invalid=18907, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 13:31:21,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-07-25 13:31:21,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-07-25 13:31:21,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-07-25 13:31:21,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 279 transitions. [2018-07-25 13:31:21,839 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 279 transitions. Word has length 276 [2018-07-25 13:31:21,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:21,839 INFO L472 AbstractCegarLoop]: Abstraction has 279 states and 279 transitions. [2018-07-25 13:31:21,839 INFO L473 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-07-25 13:31:21,839 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 279 transitions. [2018-07-25 13:31:21,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-07-25 13:31:21,840 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:21,840 INFO L354 BasicCegarLoop]: trace histogram [138, 137, 1, 1, 1] [2018-07-25 13:31:21,840 INFO L415 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:21,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1423796655, now seen corresponding path program 137 times [2018-07-25 13:31:21,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:22,781 INFO L134 CoverageAnalysis]: Checked inductivity of 18906 backedges. 0 proven. 18906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:22,782 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:22,782 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-07-25 13:31:22,782 INFO L451 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-07-25 13:31:22,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-07-25 13:31:22,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 13:31:22,784 INFO L87 Difference]: Start difference. First operand 279 states and 279 transitions. Second operand 140 states. [2018-07-25 13:31:24,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:24,031 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-07-25 13:31:24,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-07-25 13:31:24,031 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 278 [2018-07-25 13:31:24,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:24,032 INFO L225 Difference]: With dead ends: 283 [2018-07-25 13:31:24,032 INFO L226 Difference]: Without dead ends: 281 [2018-07-25 13:31:24,033 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 13:31:24,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-07-25 13:31:24,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-07-25 13:31:24,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-07-25 13:31:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-07-25 13:31:24,040 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 278 [2018-07-25 13:31:24,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:24,041 INFO L472 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-07-25 13:31:24,041 INFO L473 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-07-25 13:31:24,041 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-07-25 13:31:24,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-07-25 13:31:24,041 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:24,042 INFO L354 BasicCegarLoop]: trace histogram [139, 138, 1, 1, 1] [2018-07-25 13:31:24,042 INFO L415 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:24,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1826034059, now seen corresponding path program 138 times [2018-07-25 13:31:24,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:24,967 INFO L134 CoverageAnalysis]: Checked inductivity of 19182 backedges. 0 proven. 19182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:24,968 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:24,968 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-07-25 13:31:24,968 INFO L451 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-07-25 13:31:24,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-07-25 13:31:24,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=19461, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 13:31:24,970 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 141 states. [2018-07-25 13:31:26,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:26,265 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-07-25 13:31:26,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-07-25 13:31:26,266 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 280 [2018-07-25 13:31:26,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:26,266 INFO L225 Difference]: With dead ends: 285 [2018-07-25 13:31:26,266 INFO L226 Difference]: Without dead ends: 283 [2018-07-25 13:31:26,268 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=279, Invalid=19461, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 13:31:26,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-07-25 13:31:26,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-07-25 13:31:26,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-07-25 13:31:26,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-07-25 13:31:26,275 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 280 [2018-07-25 13:31:26,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:26,275 INFO L472 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-07-25 13:31:26,276 INFO L473 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-07-25 13:31:26,276 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-07-25 13:31:26,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-07-25 13:31:26,276 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:26,276 INFO L354 BasicCegarLoop]: trace histogram [140, 139, 1, 1, 1] [2018-07-25 13:31:26,277 INFO L415 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:26,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1822841275, now seen corresponding path program 139 times [2018-07-25 13:31:26,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:27,218 INFO L134 CoverageAnalysis]: Checked inductivity of 19460 backedges. 0 proven. 19460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:27,219 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:27,219 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-07-25 13:31:27,219 INFO L451 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-07-25 13:31:27,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-07-25 13:31:27,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 13:31:27,221 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 142 states. [2018-07-25 13:31:28,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:28,513 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-07-25 13:31:28,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-07-25 13:31:28,513 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 282 [2018-07-25 13:31:28,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:28,514 INFO L225 Difference]: With dead ends: 287 [2018-07-25 13:31:28,514 INFO L226 Difference]: Without dead ends: 285 [2018-07-25 13:31:28,516 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 13:31:28,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-07-25 13:31:28,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-07-25 13:31:28,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-07-25 13:31:28,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-07-25 13:31:28,523 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 282 [2018-07-25 13:31:28,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:28,523 INFO L472 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-07-25 13:31:28,523 INFO L473 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-07-25 13:31:28,523 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-07-25 13:31:28,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-07-25 13:31:28,524 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:28,524 INFO L354 BasicCegarLoop]: trace histogram [141, 140, 1, 1, 1] [2018-07-25 13:31:28,524 INFO L415 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:28,524 INFO L82 PathProgramCache]: Analyzing trace with hash 596243583, now seen corresponding path program 140 times [2018-07-25 13:31:28,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:29,455 INFO L134 CoverageAnalysis]: Checked inductivity of 19740 backedges. 0 proven. 19740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:29,455 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:29,455 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-07-25 13:31:29,456 INFO L451 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-07-25 13:31:29,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-07-25 13:31:29,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 13:31:29,459 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 143 states. [2018-07-25 13:31:30,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:30,825 INFO L93 Difference]: Finished difference Result 289 states and 289 transitions. [2018-07-25 13:31:30,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-07-25 13:31:30,826 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 284 [2018-07-25 13:31:30,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:30,826 INFO L225 Difference]: With dead ends: 289 [2018-07-25 13:31:30,826 INFO L226 Difference]: Without dead ends: 287 [2018-07-25 13:31:30,827 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 13:31:30,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-07-25 13:31:30,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-07-25 13:31:30,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-07-25 13:31:30,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-07-25 13:31:30,838 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 284 [2018-07-25 13:31:30,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:30,838 INFO L472 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-07-25 13:31:30,839 INFO L473 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-07-25 13:31:30,839 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-07-25 13:31:30,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-07-25 13:31:30,840 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:30,840 INFO L354 BasicCegarLoop]: trace histogram [142, 141, 1, 1, 1] [2018-07-25 13:31:30,840 INFO L415 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:30,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1759484985, now seen corresponding path program 141 times [2018-07-25 13:31:30,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:31,827 INFO L134 CoverageAnalysis]: Checked inductivity of 20022 backedges. 0 proven. 20022 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:31,827 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:31,827 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-07-25 13:31:31,828 INFO L451 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-07-25 13:31:31,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-07-25 13:31:31,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=20307, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 13:31:31,830 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 144 states. [2018-07-25 13:31:33,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:33,223 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-07-25 13:31:33,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-07-25 13:31:33,223 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 286 [2018-07-25 13:31:33,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:33,224 INFO L225 Difference]: With dead ends: 291 [2018-07-25 13:31:33,224 INFO L226 Difference]: Without dead ends: 289 [2018-07-25 13:31:33,226 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=285, Invalid=20307, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 13:31:33,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-07-25 13:31:33,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2018-07-25 13:31:33,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-07-25 13:31:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-07-25 13:31:33,233 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 286 [2018-07-25 13:31:33,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:33,234 INFO L472 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-07-25 13:31:33,234 INFO L473 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-07-25 13:31:33,234 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-07-25 13:31:33,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-07-25 13:31:33,234 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:33,235 INFO L354 BasicCegarLoop]: trace histogram [143, 142, 1, 1, 1] [2018-07-25 13:31:33,235 INFO L415 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:33,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1351991949, now seen corresponding path program 142 times [2018-07-25 13:31:33,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:34,208 INFO L134 CoverageAnalysis]: Checked inductivity of 20306 backedges. 0 proven. 20306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:34,208 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:34,208 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-07-25 13:31:34,208 INFO L451 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-07-25 13:31:34,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-07-25 13:31:34,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=20593, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 13:31:34,210 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 145 states. [2018-07-25 13:31:35,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:35,621 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-07-25 13:31:35,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-07-25 13:31:35,621 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 288 [2018-07-25 13:31:35,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:35,622 INFO L225 Difference]: With dead ends: 293 [2018-07-25 13:31:35,622 INFO L226 Difference]: Without dead ends: 291 [2018-07-25 13:31:35,623 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=20593, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 13:31:35,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-07-25 13:31:35,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2018-07-25 13:31:35,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-07-25 13:31:35,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-07-25 13:31:35,630 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 288 [2018-07-25 13:31:35,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:35,630 INFO L472 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-07-25 13:31:35,631 INFO L473 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-07-25 13:31:35,631 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-07-25 13:31:35,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-07-25 13:31:35,631 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:35,632 INFO L354 BasicCegarLoop]: trace histogram [144, 143, 1, 1, 1] [2018-07-25 13:31:35,632 INFO L415 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:35,632 INFO L82 PathProgramCache]: Analyzing trace with hash 2110879789, now seen corresponding path program 143 times [2018-07-25 13:31:35,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:36,597 INFO L134 CoverageAnalysis]: Checked inductivity of 20592 backedges. 0 proven. 20592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:36,597 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:36,597 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-07-25 13:31:36,598 INFO L451 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-07-25 13:31:36,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-07-25 13:31:36,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=20881, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 13:31:36,600 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 146 states. [2018-07-25 13:31:38,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:38,021 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-07-25 13:31:38,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-07-25 13:31:38,021 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 290 [2018-07-25 13:31:38,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:38,022 INFO L225 Difference]: With dead ends: 295 [2018-07-25 13:31:38,022 INFO L226 Difference]: Without dead ends: 293 [2018-07-25 13:31:38,024 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=289, Invalid=20881, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 13:31:38,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-07-25 13:31:38,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-07-25 13:31:38,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-07-25 13:31:38,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-07-25 13:31:38,031 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 290 [2018-07-25 13:31:38,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:38,031 INFO L472 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-07-25 13:31:38,031 INFO L473 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-07-25 13:31:38,032 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-07-25 13:31:38,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-07-25 13:31:38,032 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:38,032 INFO L354 BasicCegarLoop]: trace histogram [145, 144, 1, 1, 1] [2018-07-25 13:31:38,033 INFO L415 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:38,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1330965607, now seen corresponding path program 144 times [2018-07-25 13:31:38,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:39,062 INFO L134 CoverageAnalysis]: Checked inductivity of 20880 backedges. 0 proven. 20880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:39,063 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:39,063 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-07-25 13:31:39,063 INFO L451 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-07-25 13:31:39,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-07-25 13:31:39,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=21171, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 13:31:39,064 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 147 states. [2018-07-25 13:31:40,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:40,452 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2018-07-25 13:31:40,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-07-25 13:31:40,452 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 292 [2018-07-25 13:31:40,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:40,453 INFO L225 Difference]: With dead ends: 297 [2018-07-25 13:31:40,453 INFO L226 Difference]: Without dead ends: 295 [2018-07-25 13:31:40,454 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=291, Invalid=21171, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 13:31:40,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-07-25 13:31:40,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-07-25 13:31:40,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-07-25 13:31:40,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2018-07-25 13:31:40,461 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 292 [2018-07-25 13:31:40,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:40,462 INFO L472 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2018-07-25 13:31:40,462 INFO L473 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-07-25 13:31:40,462 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2018-07-25 13:31:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-07-25 13:31:40,463 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:40,463 INFO L354 BasicCegarLoop]: trace histogram [146, 145, 1, 1, 1] [2018-07-25 13:31:40,463 INFO L415 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:40,463 INFO L82 PathProgramCache]: Analyzing trace with hash -842253791, now seen corresponding path program 145 times [2018-07-25 13:31:40,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 21170 backedges. 0 proven. 21170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:41,453 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:41,453 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-07-25 13:31:41,453 INFO L451 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-07-25 13:31:41,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-07-25 13:31:41,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=21463, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 13:31:41,455 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 148 states. [2018-07-25 13:31:42,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:42,915 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-07-25 13:31:42,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-07-25 13:31:42,916 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 294 [2018-07-25 13:31:42,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:42,916 INFO L225 Difference]: With dead ends: 299 [2018-07-25 13:31:42,916 INFO L226 Difference]: Without dead ends: 297 [2018-07-25 13:31:42,918 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=21463, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 13:31:42,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-07-25 13:31:42,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2018-07-25 13:31:42,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-07-25 13:31:42,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-07-25 13:31:42,926 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 294 [2018-07-25 13:31:42,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:42,926 INFO L472 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-07-25 13:31:42,926 INFO L473 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-07-25 13:31:42,926 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-07-25 13:31:42,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-07-25 13:31:42,927 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:42,927 INFO L354 BasicCegarLoop]: trace histogram [147, 146, 1, 1, 1] [2018-07-25 13:31:42,927 INFO L415 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:42,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1951989413, now seen corresponding path program 146 times [2018-07-25 13:31:42,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:43,957 INFO L134 CoverageAnalysis]: Checked inductivity of 21462 backedges. 0 proven. 21462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:43,958 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:43,958 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-07-25 13:31:43,958 INFO L451 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-07-25 13:31:43,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-07-25 13:31:43,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=21757, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 13:31:43,959 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 149 states. [2018-07-25 13:31:45,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:45,410 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2018-07-25 13:31:45,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-07-25 13:31:45,410 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 296 [2018-07-25 13:31:45,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:45,411 INFO L225 Difference]: With dead ends: 301 [2018-07-25 13:31:45,411 INFO L226 Difference]: Without dead ends: 299 [2018-07-25 13:31:45,413 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=295, Invalid=21757, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 13:31:45,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-07-25 13:31:45,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2018-07-25 13:31:45,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-07-25 13:31:45,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2018-07-25 13:31:45,425 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 296 [2018-07-25 13:31:45,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:45,425 INFO L472 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2018-07-25 13:31:45,425 INFO L473 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-07-25 13:31:45,425 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2018-07-25 13:31:45,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-07-25 13:31:45,426 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:45,427 INFO L354 BasicCegarLoop]: trace histogram [148, 147, 1, 1, 1] [2018-07-25 13:31:45,427 INFO L415 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:45,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1038934549, now seen corresponding path program 147 times [2018-07-25 13:31:45,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:46,478 INFO L134 CoverageAnalysis]: Checked inductivity of 21756 backedges. 0 proven. 21756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:46,479 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:46,479 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-07-25 13:31:46,479 INFO L451 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-07-25 13:31:46,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-07-25 13:31:46,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=22053, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 13:31:46,481 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 150 states. [2018-07-25 13:31:47,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:47,985 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-07-25 13:31:47,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-07-25 13:31:47,985 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 298 [2018-07-25 13:31:47,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:47,986 INFO L225 Difference]: With dead ends: 303 [2018-07-25 13:31:47,986 INFO L226 Difference]: Without dead ends: 301 [2018-07-25 13:31:47,987 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=297, Invalid=22053, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 13:31:47,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-07-25 13:31:47,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-07-25 13:31:47,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-07-25 13:31:47,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-07-25 13:31:47,994 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 298 [2018-07-25 13:31:47,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:47,994 INFO L472 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-07-25 13:31:47,995 INFO L473 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-07-25 13:31:47,995 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-07-25 13:31:47,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-07-25 13:31:47,995 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:47,996 INFO L354 BasicCegarLoop]: trace histogram [149, 148, 1, 1, 1] [2018-07-25 13:31:47,996 INFO L415 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:47,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1983741007, now seen corresponding path program 148 times [2018-07-25 13:31:47,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:49,028 INFO L134 CoverageAnalysis]: Checked inductivity of 22052 backedges. 0 proven. 22052 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:49,028 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:49,029 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-07-25 13:31:49,029 INFO L451 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-07-25 13:31:49,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-07-25 13:31:49,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=22351, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 13:31:49,031 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 151 states. [2018-07-25 13:31:50,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:50,544 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-07-25 13:31:50,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-07-25 13:31:50,545 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 300 [2018-07-25 13:31:50,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:50,545 INFO L225 Difference]: With dead ends: 305 [2018-07-25 13:31:50,545 INFO L226 Difference]: Without dead ends: 303 [2018-07-25 13:31:50,548 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=299, Invalid=22351, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 13:31:50,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-07-25 13:31:50,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-07-25 13:31:50,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-07-25 13:31:50,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2018-07-25 13:31:50,556 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 300 [2018-07-25 13:31:50,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:50,556 INFO L472 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2018-07-25 13:31:50,556 INFO L473 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-07-25 13:31:50,556 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2018-07-25 13:31:50,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-07-25 13:31:50,557 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:50,557 INFO L354 BasicCegarLoop]: trace histogram [150, 149, 1, 1, 1] [2018-07-25 13:31:50,557 INFO L415 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:50,558 INFO L82 PathProgramCache]: Analyzing trace with hash -590319607, now seen corresponding path program 149 times [2018-07-25 13:31:50,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:51,667 INFO L134 CoverageAnalysis]: Checked inductivity of 22350 backedges. 0 proven. 22350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:51,667 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:51,667 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-07-25 13:31:51,667 INFO L451 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-07-25 13:31:51,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-07-25 13:31:51,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=22651, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 13:31:51,668 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 152 states. [2018-07-25 13:31:53,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:53,149 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-07-25 13:31:53,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-07-25 13:31:53,149 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 302 [2018-07-25 13:31:53,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:53,150 INFO L225 Difference]: With dead ends: 307 [2018-07-25 13:31:53,150 INFO L226 Difference]: Without dead ends: 305 [2018-07-25 13:31:53,151 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=301, Invalid=22651, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 13:31:53,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-07-25 13:31:53,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2018-07-25 13:31:53,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-07-25 13:31:53,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-07-25 13:31:53,159 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 302 [2018-07-25 13:31:53,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:53,159 INFO L472 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-07-25 13:31:53,159 INFO L473 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-07-25 13:31:53,159 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-07-25 13:31:53,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-07-25 13:31:53,160 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:53,161 INFO L354 BasicCegarLoop]: trace histogram [151, 150, 1, 1, 1] [2018-07-25 13:31:53,161 INFO L415 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:53,161 INFO L82 PathProgramCache]: Analyzing trace with hash -361407165, now seen corresponding path program 150 times [2018-07-25 13:31:53,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:53,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 22650 backedges. 0 proven. 22650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:54,231 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:54,231 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-07-25 13:31:54,231 INFO L451 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-07-25 13:31:54,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-07-25 13:31:54,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=22953, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 13:31:54,233 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 153 states. [2018-07-25 13:31:55,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:55,772 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2018-07-25 13:31:55,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-07-25 13:31:55,773 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 304 [2018-07-25 13:31:55,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:55,773 INFO L225 Difference]: With dead ends: 309 [2018-07-25 13:31:55,774 INFO L226 Difference]: Without dead ends: 307 [2018-07-25 13:31:55,776 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=303, Invalid=22953, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 13:31:55,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-07-25 13:31:55,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-07-25 13:31:55,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-07-25 13:31:55,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2018-07-25 13:31:55,783 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 304 [2018-07-25 13:31:55,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:55,784 INFO L472 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2018-07-25 13:31:55,784 INFO L473 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-07-25 13:31:55,784 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2018-07-25 13:31:55,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-07-25 13:31:55,785 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:55,785 INFO L354 BasicCegarLoop]: trace histogram [152, 151, 1, 1, 1] [2018-07-25 13:31:55,785 INFO L415 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:55,785 INFO L82 PathProgramCache]: Analyzing trace with hash 580117501, now seen corresponding path program 151 times [2018-07-25 13:31:55,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:56,916 INFO L134 CoverageAnalysis]: Checked inductivity of 22952 backedges. 0 proven. 22952 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:56,916 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:56,916 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-07-25 13:31:56,917 INFO L451 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-07-25 13:31:56,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-07-25 13:31:56,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=23257, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 13:31:56,918 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 154 states. [2018-07-25 13:31:58,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:58,522 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-07-25 13:31:58,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-07-25 13:31:58,522 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 306 [2018-07-25 13:31:58,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:58,523 INFO L225 Difference]: With dead ends: 311 [2018-07-25 13:31:58,524 INFO L226 Difference]: Without dead ends: 309 [2018-07-25 13:31:58,526 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=305, Invalid=23257, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 13:31:58,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-07-25 13:31:58,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2018-07-25 13:31:58,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-07-25 13:31:58,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2018-07-25 13:31:58,538 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 306 [2018-07-25 13:31:58,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:58,538 INFO L472 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2018-07-25 13:31:58,538 INFO L473 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-07-25 13:31:58,539 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2018-07-25 13:31:58,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-07-25 13:31:58,540 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:58,540 INFO L354 BasicCegarLoop]: trace histogram [153, 152, 1, 1, 1] [2018-07-25 13:31:58,540 INFO L415 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:58,540 INFO L82 PathProgramCache]: Analyzing trace with hash -852777929, now seen corresponding path program 152 times [2018-07-25 13:31:58,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:59,810 INFO L134 CoverageAnalysis]: Checked inductivity of 23256 backedges. 0 proven. 23256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:31:59,810 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:59,810 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2018-07-25 13:31:59,811 INFO L451 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-07-25 13:31:59,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-07-25 13:31:59,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=23563, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 13:31:59,813 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 155 states. [2018-07-25 13:32:01,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:01,371 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2018-07-25 13:32:01,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-07-25 13:32:01,371 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 308 [2018-07-25 13:32:01,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:01,372 INFO L225 Difference]: With dead ends: 313 [2018-07-25 13:32:01,372 INFO L226 Difference]: Without dead ends: 311 [2018-07-25 13:32:01,373 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=307, Invalid=23563, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 13:32:01,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-07-25 13:32:01,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2018-07-25 13:32:01,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-07-25 13:32:01,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-07-25 13:32:01,380 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 308 [2018-07-25 13:32:01,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:01,381 INFO L472 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-07-25 13:32:01,381 INFO L473 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-07-25 13:32:01,381 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-07-25 13:32:01,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-07-25 13:32:01,382 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:01,382 INFO L354 BasicCegarLoop]: trace histogram [154, 153, 1, 1, 1] [2018-07-25 13:32:01,382 INFO L415 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:01,382 INFO L82 PathProgramCache]: Analyzing trace with hash 819215857, now seen corresponding path program 153 times [2018-07-25 13:32:01,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:02,515 INFO L134 CoverageAnalysis]: Checked inductivity of 23562 backedges. 0 proven. 23562 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:02,515 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:02,515 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-07-25 13:32:02,515 INFO L451 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-07-25 13:32:02,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-07-25 13:32:02,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=23871, Unknown=0, NotChecked=0, Total=24180 [2018-07-25 13:32:02,517 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 156 states. [2018-07-25 13:32:04,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:04,119 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2018-07-25 13:32:04,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-07-25 13:32:04,120 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 310 [2018-07-25 13:32:04,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:04,120 INFO L225 Difference]: With dead ends: 315 [2018-07-25 13:32:04,120 INFO L226 Difference]: Without dead ends: 313 [2018-07-25 13:32:04,122 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=309, Invalid=23871, Unknown=0, NotChecked=0, Total=24180 [2018-07-25 13:32:04,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-07-25 13:32:04,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2018-07-25 13:32:04,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-07-25 13:32:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2018-07-25 13:32:04,130 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 310 [2018-07-25 13:32:04,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:04,130 INFO L472 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2018-07-25 13:32:04,130 INFO L473 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-07-25 13:32:04,131 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2018-07-25 13:32:04,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-07-25 13:32:04,131 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:04,132 INFO L354 BasicCegarLoop]: trace histogram [155, 154, 1, 1, 1] [2018-07-25 13:32:04,132 INFO L415 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:04,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1287475499, now seen corresponding path program 154 times [2018-07-25 13:32:04,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:05,295 INFO L134 CoverageAnalysis]: Checked inductivity of 23870 backedges. 0 proven. 23870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:05,295 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:05,295 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2018-07-25 13:32:05,296 INFO L451 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-07-25 13:32:05,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-07-25 13:32:05,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=24181, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 13:32:05,297 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 157 states. [2018-07-25 13:32:06,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:06,882 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2018-07-25 13:32:06,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-07-25 13:32:06,882 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 312 [2018-07-25 13:32:06,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:06,883 INFO L225 Difference]: With dead ends: 317 [2018-07-25 13:32:06,883 INFO L226 Difference]: Without dead ends: 315 [2018-07-25 13:32:06,885 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=311, Invalid=24181, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 13:32:06,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-07-25 13:32:06,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2018-07-25 13:32:06,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-07-25 13:32:06,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 315 transitions. [2018-07-25 13:32:06,897 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 315 transitions. Word has length 312 [2018-07-25 13:32:06,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:06,897 INFO L472 AbstractCegarLoop]: Abstraction has 315 states and 315 transitions. [2018-07-25 13:32:06,897 INFO L473 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-07-25 13:32:06,898 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 315 transitions. [2018-07-25 13:32:06,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-07-25 13:32:06,899 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:06,899 INFO L354 BasicCegarLoop]: trace histogram [156, 155, 1, 1, 1] [2018-07-25 13:32:06,899 INFO L415 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:06,899 INFO L82 PathProgramCache]: Analyzing trace with hash 313425381, now seen corresponding path program 155 times [2018-07-25 13:32:06,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:08,198 INFO L134 CoverageAnalysis]: Checked inductivity of 24180 backedges. 0 proven. 24180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:08,198 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:08,199 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2018-07-25 13:32:08,199 INFO L451 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-07-25 13:32:08,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-07-25 13:32:08,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=24493, Unknown=0, NotChecked=0, Total=24806 [2018-07-25 13:32:08,200 INFO L87 Difference]: Start difference. First operand 315 states and 315 transitions. Second operand 158 states. [2018-07-25 13:32:09,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:09,780 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2018-07-25 13:32:09,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-07-25 13:32:09,780 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 314 [2018-07-25 13:32:09,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:09,781 INFO L225 Difference]: With dead ends: 319 [2018-07-25 13:32:09,781 INFO L226 Difference]: Without dead ends: 317 [2018-07-25 13:32:09,782 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=313, Invalid=24493, Unknown=0, NotChecked=0, Total=24806 [2018-07-25 13:32:09,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-07-25 13:32:09,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2018-07-25 13:32:09,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-07-25 13:32:09,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2018-07-25 13:32:09,790 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 314 [2018-07-25 13:32:09,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:09,790 INFO L472 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2018-07-25 13:32:09,790 INFO L473 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-07-25 13:32:09,790 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2018-07-25 13:32:09,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-07-25 13:32:09,791 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:09,791 INFO L354 BasicCegarLoop]: trace histogram [157, 156, 1, 1, 1] [2018-07-25 13:32:09,792 INFO L415 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:09,792 INFO L82 PathProgramCache]: Analyzing trace with hash 554132511, now seen corresponding path program 156 times [2018-07-25 13:32:09,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:10,959 INFO L134 CoverageAnalysis]: Checked inductivity of 24492 backedges. 0 proven. 24492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:10,960 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:10,960 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2018-07-25 13:32:10,960 INFO L451 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-07-25 13:32:10,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-07-25 13:32:10,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=24807, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 13:32:10,962 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 159 states. [2018-07-25 13:32:12,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:12,620 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2018-07-25 13:32:12,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-07-25 13:32:12,620 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 316 [2018-07-25 13:32:12,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:12,621 INFO L225 Difference]: With dead ends: 321 [2018-07-25 13:32:12,621 INFO L226 Difference]: Without dead ends: 319 [2018-07-25 13:32:12,623 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=315, Invalid=24807, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 13:32:12,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-07-25 13:32:12,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2018-07-25 13:32:12,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-07-25 13:32:12,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 319 transitions. [2018-07-25 13:32:12,631 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 319 transitions. Word has length 316 [2018-07-25 13:32:12,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:12,631 INFO L472 AbstractCegarLoop]: Abstraction has 319 states and 319 transitions. [2018-07-25 13:32:12,631 INFO L473 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-07-25 13:32:12,631 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 319 transitions. [2018-07-25 13:32:12,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-07-25 13:32:12,632 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:12,632 INFO L354 BasicCegarLoop]: trace histogram [158, 157, 1, 1, 1] [2018-07-25 13:32:12,632 INFO L415 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:12,632 INFO L82 PathProgramCache]: Analyzing trace with hash -54549543, now seen corresponding path program 157 times [2018-07-25 13:32:12,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:13,820 INFO L134 CoverageAnalysis]: Checked inductivity of 24806 backedges. 0 proven. 24806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:13,820 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:13,821 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-07-25 13:32:13,821 INFO L451 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-07-25 13:32:13,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-07-25 13:32:13,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=25123, Unknown=0, NotChecked=0, Total=25440 [2018-07-25 13:32:13,824 INFO L87 Difference]: Start difference. First operand 319 states and 319 transitions. Second operand 160 states. [2018-07-25 13:32:15,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:15,521 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-07-25 13:32:15,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-07-25 13:32:15,522 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 318 [2018-07-25 13:32:15,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:15,522 INFO L225 Difference]: With dead ends: 323 [2018-07-25 13:32:15,523 INFO L226 Difference]: Without dead ends: 321 [2018-07-25 13:32:15,525 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=317, Invalid=25123, Unknown=0, NotChecked=0, Total=25440 [2018-07-25 13:32:15,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-07-25 13:32:15,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2018-07-25 13:32:15,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-07-25 13:32:15,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2018-07-25 13:32:15,533 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 318 [2018-07-25 13:32:15,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:15,533 INFO L472 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2018-07-25 13:32:15,533 INFO L473 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-07-25 13:32:15,533 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2018-07-25 13:32:15,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-07-25 13:32:15,534 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:15,534 INFO L354 BasicCegarLoop]: trace histogram [159, 158, 1, 1, 1] [2018-07-25 13:32:15,534 INFO L415 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:15,535 INFO L82 PathProgramCache]: Analyzing trace with hash -882451181, now seen corresponding path program 158 times [2018-07-25 13:32:15,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:16,784 INFO L134 CoverageAnalysis]: Checked inductivity of 25122 backedges. 0 proven. 25122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:16,784 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:16,784 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2018-07-25 13:32:16,785 INFO L451 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-07-25 13:32:16,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-07-25 13:32:16,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=25441, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 13:32:16,786 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 161 states. [2018-07-25 13:32:18,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:18,371 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2018-07-25 13:32:18,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-07-25 13:32:18,372 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 320 [2018-07-25 13:32:18,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:18,372 INFO L225 Difference]: With dead ends: 325 [2018-07-25 13:32:18,372 INFO L226 Difference]: Without dead ends: 323 [2018-07-25 13:32:18,373 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=319, Invalid=25441, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 13:32:18,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-07-25 13:32:18,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2018-07-25 13:32:18,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-07-25 13:32:18,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2018-07-25 13:32:18,381 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 320 [2018-07-25 13:32:18,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:18,382 INFO L472 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2018-07-25 13:32:18,382 INFO L473 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-07-25 13:32:18,382 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2018-07-25 13:32:18,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-07-25 13:32:18,383 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:18,383 INFO L354 BasicCegarLoop]: trace histogram [160, 159, 1, 1, 1] [2018-07-25 13:32:18,383 INFO L415 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:18,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1926975539, now seen corresponding path program 159 times [2018-07-25 13:32:18,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:19,580 INFO L134 CoverageAnalysis]: Checked inductivity of 25440 backedges. 0 proven. 25440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:19,581 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:19,581 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2018-07-25 13:32:19,581 INFO L451 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-07-25 13:32:19,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-07-25 13:32:19,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=25761, Unknown=0, NotChecked=0, Total=26082 [2018-07-25 13:32:19,584 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 162 states. [2018-07-25 13:32:21,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:21,349 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2018-07-25 13:32:21,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-07-25 13:32:21,350 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 322 [2018-07-25 13:32:21,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:21,350 INFO L225 Difference]: With dead ends: 327 [2018-07-25 13:32:21,350 INFO L226 Difference]: Without dead ends: 325 [2018-07-25 13:32:21,351 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=321, Invalid=25761, Unknown=0, NotChecked=0, Total=26082 [2018-07-25 13:32:21,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-07-25 13:32:21,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2018-07-25 13:32:21,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-07-25 13:32:21,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2018-07-25 13:32:21,359 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 322 [2018-07-25 13:32:21,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:21,360 INFO L472 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2018-07-25 13:32:21,360 INFO L473 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-07-25 13:32:21,360 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2018-07-25 13:32:21,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-07-25 13:32:21,361 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:21,361 INFO L354 BasicCegarLoop]: trace histogram [161, 160, 1, 1, 1] [2018-07-25 13:32:21,361 INFO L415 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:21,361 INFO L82 PathProgramCache]: Analyzing trace with hash -692536313, now seen corresponding path program 160 times [2018-07-25 13:32:21,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:22,571 INFO L134 CoverageAnalysis]: Checked inductivity of 25760 backedges. 0 proven. 25760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:22,572 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:22,572 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2018-07-25 13:32:22,572 INFO L451 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-07-25 13:32:22,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-07-25 13:32:22,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=26083, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 13:32:22,574 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 163 states. [2018-07-25 13:32:24,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:24,367 INFO L93 Difference]: Finished difference Result 329 states and 329 transitions. [2018-07-25 13:32:24,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-07-25 13:32:24,368 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 324 [2018-07-25 13:32:24,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:24,368 INFO L225 Difference]: With dead ends: 329 [2018-07-25 13:32:24,368 INFO L226 Difference]: Without dead ends: 327 [2018-07-25 13:32:24,371 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=323, Invalid=26083, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 13:32:24,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-07-25 13:32:24,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2018-07-25 13:32:24,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-07-25 13:32:24,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 327 transitions. [2018-07-25 13:32:24,380 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 327 transitions. Word has length 324 [2018-07-25 13:32:24,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:24,380 INFO L472 AbstractCegarLoop]: Abstraction has 327 states and 327 transitions. [2018-07-25 13:32:24,380 INFO L473 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-07-25 13:32:24,380 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 327 transitions. [2018-07-25 13:32:24,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-07-25 13:32:24,381 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:24,381 INFO L354 BasicCegarLoop]: trace histogram [162, 161, 1, 1, 1] [2018-07-25 13:32:24,381 INFO L415 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:24,382 INFO L82 PathProgramCache]: Analyzing trace with hash 192586177, now seen corresponding path program 161 times [2018-07-25 13:32:24,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:25,632 INFO L134 CoverageAnalysis]: Checked inductivity of 26082 backedges. 0 proven. 26082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:25,633 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:25,633 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-07-25 13:32:25,633 INFO L451 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-07-25 13:32:25,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-07-25 13:32:25,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=26407, Unknown=0, NotChecked=0, Total=26732 [2018-07-25 13:32:25,635 INFO L87 Difference]: Start difference. First operand 327 states and 327 transitions. Second operand 164 states. [2018-07-25 13:32:27,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:27,382 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2018-07-25 13:32:27,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-07-25 13:32:27,382 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 326 [2018-07-25 13:32:27,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:27,383 INFO L225 Difference]: With dead ends: 331 [2018-07-25 13:32:27,383 INFO L226 Difference]: Without dead ends: 329 [2018-07-25 13:32:27,385 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=325, Invalid=26407, Unknown=0, NotChecked=0, Total=26732 [2018-07-25 13:32:27,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-07-25 13:32:27,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2018-07-25 13:32:27,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-07-25 13:32:27,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2018-07-25 13:32:27,392 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 326 [2018-07-25 13:32:27,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:27,393 INFO L472 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2018-07-25 13:32:27,393 INFO L473 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-07-25 13:32:27,393 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2018-07-25 13:32:27,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-07-25 13:32:27,394 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:27,394 INFO L354 BasicCegarLoop]: trace histogram [163, 162, 1, 1, 1] [2018-07-25 13:32:27,394 INFO L415 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:27,394 INFO L82 PathProgramCache]: Analyzing trace with hash 391774459, now seen corresponding path program 162 times [2018-07-25 13:32:27,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:28,628 INFO L134 CoverageAnalysis]: Checked inductivity of 26406 backedges. 0 proven. 26406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:28,628 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:28,628 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2018-07-25 13:32:28,628 INFO L451 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-07-25 13:32:28,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-07-25 13:32:28,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=26733, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 13:32:28,631 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 165 states. [2018-07-25 13:32:30,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:30,428 INFO L93 Difference]: Finished difference Result 333 states and 333 transitions. [2018-07-25 13:32:30,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-07-25 13:32:30,428 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 328 [2018-07-25 13:32:30,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:30,428 INFO L225 Difference]: With dead ends: 333 [2018-07-25 13:32:30,429 INFO L226 Difference]: Without dead ends: 331 [2018-07-25 13:32:30,430 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=327, Invalid=26733, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 13:32:30,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-07-25 13:32:30,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2018-07-25 13:32:30,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-07-25 13:32:30,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2018-07-25 13:32:30,438 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 328 [2018-07-25 13:32:30,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:30,438 INFO L472 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2018-07-25 13:32:30,438 INFO L473 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-07-25 13:32:30,438 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2018-07-25 13:32:30,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-07-25 13:32:30,439 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:30,439 INFO L354 BasicCegarLoop]: trace histogram [164, 163, 1, 1, 1] [2018-07-25 13:32:30,439 INFO L415 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:30,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1461814859, now seen corresponding path program 163 times [2018-07-25 13:32:30,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:31,690 INFO L134 CoverageAnalysis]: Checked inductivity of 26732 backedges. 0 proven. 26732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:31,691 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:31,691 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2018-07-25 13:32:31,691 INFO L451 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-07-25 13:32:31,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-07-25 13:32:31,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=27061, Unknown=0, NotChecked=0, Total=27390 [2018-07-25 13:32:31,693 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 166 states. [2018-07-25 13:32:33,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:33,553 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2018-07-25 13:32:33,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-07-25 13:32:33,553 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 330 [2018-07-25 13:32:33,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:33,554 INFO L225 Difference]: With dead ends: 335 [2018-07-25 13:32:33,554 INFO L226 Difference]: Without dead ends: 333 [2018-07-25 13:32:33,555 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=329, Invalid=27061, Unknown=0, NotChecked=0, Total=27390 [2018-07-25 13:32:33,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-07-25 13:32:33,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2018-07-25 13:32:33,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-07-25 13:32:33,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2018-07-25 13:32:33,567 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 330 [2018-07-25 13:32:33,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:33,568 INFO L472 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2018-07-25 13:32:33,568 INFO L473 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-07-25 13:32:33,568 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2018-07-25 13:32:33,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-07-25 13:32:33,569 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:33,570 INFO L354 BasicCegarLoop]: trace histogram [165, 164, 1, 1, 1] [2018-07-25 13:32:33,570 INFO L415 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:33,570 INFO L82 PathProgramCache]: Analyzing trace with hash -349721617, now seen corresponding path program 164 times [2018-07-25 13:32:33,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:35,068 INFO L134 CoverageAnalysis]: Checked inductivity of 27060 backedges. 0 proven. 27060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:35,068 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:35,068 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166] total 166 [2018-07-25 13:32:35,069 INFO L451 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-07-25 13:32:35,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-07-25 13:32:35,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=27391, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 13:32:35,071 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 167 states. [2018-07-25 13:32:36,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:36,916 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2018-07-25 13:32:36,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-07-25 13:32:36,917 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 332 [2018-07-25 13:32:36,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:36,917 INFO L225 Difference]: With dead ends: 337 [2018-07-25 13:32:36,918 INFO L226 Difference]: Without dead ends: 335 [2018-07-25 13:32:36,920 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=331, Invalid=27391, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 13:32:36,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-07-25 13:32:36,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2018-07-25 13:32:36,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-07-25 13:32:36,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 335 transitions. [2018-07-25 13:32:36,929 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 335 transitions. Word has length 332 [2018-07-25 13:32:36,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:36,929 INFO L472 AbstractCegarLoop]: Abstraction has 335 states and 335 transitions. [2018-07-25 13:32:36,929 INFO L473 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-07-25 13:32:36,929 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 335 transitions. [2018-07-25 13:32:36,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-07-25 13:32:36,930 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:36,930 INFO L354 BasicCegarLoop]: trace histogram [166, 165, 1, 1, 1] [2018-07-25 13:32:36,930 INFO L415 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:36,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1074972759, now seen corresponding path program 165 times [2018-07-25 13:32:36,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:38,278 INFO L134 CoverageAnalysis]: Checked inductivity of 27390 backedges. 0 proven. 27390 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:38,278 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:38,279 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2018-07-25 13:32:38,279 INFO L451 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-07-25 13:32:38,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-07-25 13:32:38,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=27723, Unknown=0, NotChecked=0, Total=28056 [2018-07-25 13:32:38,280 INFO L87 Difference]: Start difference. First operand 335 states and 335 transitions. Second operand 168 states. [2018-07-25 13:32:40,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:40,092 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2018-07-25 13:32:40,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-07-25 13:32:40,093 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 334 [2018-07-25 13:32:40,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:40,093 INFO L225 Difference]: With dead ends: 339 [2018-07-25 13:32:40,093 INFO L226 Difference]: Without dead ends: 337 [2018-07-25 13:32:40,095 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=333, Invalid=27723, Unknown=0, NotChecked=0, Total=28056 [2018-07-25 13:32:40,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-07-25 13:32:40,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2018-07-25 13:32:40,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-07-25 13:32:40,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2018-07-25 13:32:40,103 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 334 [2018-07-25 13:32:40,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:40,104 INFO L472 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2018-07-25 13:32:40,104 INFO L473 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-07-25 13:32:40,104 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2018-07-25 13:32:40,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-07-25 13:32:40,105 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:40,105 INFO L354 BasicCegarLoop]: trace histogram [167, 166, 1, 1, 1] [2018-07-25 13:32:40,105 INFO L415 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:40,105 INFO L82 PathProgramCache]: Analyzing trace with hash 2038349027, now seen corresponding path program 166 times [2018-07-25 13:32:40,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:41,478 INFO L134 CoverageAnalysis]: Checked inductivity of 27722 backedges. 0 proven. 27722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:41,478 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:41,478 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168] total 168 [2018-07-25 13:32:41,478 INFO L451 AbstractCegarLoop]: Interpolant automaton has 169 states [2018-07-25 13:32:41,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2018-07-25 13:32:41,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=28057, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 13:32:41,480 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 169 states. [2018-07-25 13:32:43,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:43,293 INFO L93 Difference]: Finished difference Result 341 states and 341 transitions. [2018-07-25 13:32:43,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-07-25 13:32:43,293 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 336 [2018-07-25 13:32:43,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:43,294 INFO L225 Difference]: With dead ends: 341 [2018-07-25 13:32:43,294 INFO L226 Difference]: Without dead ends: 339 [2018-07-25 13:32:43,295 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=335, Invalid=28057, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 13:32:43,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-07-25 13:32:43,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2018-07-25 13:32:43,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-07-25 13:32:43,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2018-07-25 13:32:43,303 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 336 [2018-07-25 13:32:43,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:43,304 INFO L472 AbstractCegarLoop]: Abstraction has 339 states and 339 transitions. [2018-07-25 13:32:43,304 INFO L473 AbstractCegarLoop]: Interpolant automaton has 169 states. [2018-07-25 13:32:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 339 transitions. [2018-07-25 13:32:43,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-07-25 13:32:43,305 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:43,305 INFO L354 BasicCegarLoop]: trace histogram [168, 167, 1, 1, 1] [2018-07-25 13:32:43,305 INFO L415 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:43,305 INFO L82 PathProgramCache]: Analyzing trace with hash 348380061, now seen corresponding path program 167 times [2018-07-25 13:32:43,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:44,747 INFO L134 CoverageAnalysis]: Checked inductivity of 28056 backedges. 0 proven. 28056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:44,748 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:44,748 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2018-07-25 13:32:44,748 INFO L451 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-07-25 13:32:44,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-07-25 13:32:44,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=28393, Unknown=0, NotChecked=0, Total=28730 [2018-07-25 13:32:44,751 INFO L87 Difference]: Start difference. First operand 339 states and 339 transitions. Second operand 170 states. [2018-07-25 13:32:46,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:46,665 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2018-07-25 13:32:46,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-07-25 13:32:46,665 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 338 [2018-07-25 13:32:46,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:46,666 INFO L225 Difference]: With dead ends: 343 [2018-07-25 13:32:46,666 INFO L226 Difference]: Without dead ends: 341 [2018-07-25 13:32:46,667 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=337, Invalid=28393, Unknown=0, NotChecked=0, Total=28730 [2018-07-25 13:32:46,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-07-25 13:32:46,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2018-07-25 13:32:46,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-07-25 13:32:46,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2018-07-25 13:32:46,675 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 338 [2018-07-25 13:32:46,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:46,675 INFO L472 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2018-07-25 13:32:46,675 INFO L473 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-07-25 13:32:46,675 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2018-07-25 13:32:46,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-07-25 13:32:46,676 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:46,676 INFO L354 BasicCegarLoop]: trace histogram [169, 168, 1, 1, 1] [2018-07-25 13:32:46,677 INFO L415 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:46,677 INFO L82 PathProgramCache]: Analyzing trace with hash -214158377, now seen corresponding path program 168 times [2018-07-25 13:32:46,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:48,035 INFO L134 CoverageAnalysis]: Checked inductivity of 28392 backedges. 0 proven. 28392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:48,036 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:48,036 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170] total 170 [2018-07-25 13:32:48,036 INFO L451 AbstractCegarLoop]: Interpolant automaton has 171 states [2018-07-25 13:32:48,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2018-07-25 13:32:48,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=28731, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 13:32:48,039 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 171 states. [2018-07-25 13:32:49,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:49,972 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2018-07-25 13:32:49,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-07-25 13:32:49,973 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 340 [2018-07-25 13:32:49,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:49,974 INFO L225 Difference]: With dead ends: 345 [2018-07-25 13:32:49,974 INFO L226 Difference]: Without dead ends: 343 [2018-07-25 13:32:49,977 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=339, Invalid=28731, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 13:32:49,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-07-25 13:32:49,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-07-25 13:32:49,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-07-25 13:32:49,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 343 transitions. [2018-07-25 13:32:49,985 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 343 transitions. Word has length 340 [2018-07-25 13:32:49,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:49,985 INFO L472 AbstractCegarLoop]: Abstraction has 343 states and 343 transitions. [2018-07-25 13:32:49,985 INFO L473 AbstractCegarLoop]: Interpolant automaton has 171 states. [2018-07-25 13:32:49,985 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 343 transitions. [2018-07-25 13:32:49,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-07-25 13:32:49,986 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:49,986 INFO L354 BasicCegarLoop]: trace histogram [170, 169, 1, 1, 1] [2018-07-25 13:32:49,987 INFO L415 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:49,987 INFO L82 PathProgramCache]: Analyzing trace with hash 352282001, now seen corresponding path program 169 times [2018-07-25 13:32:49,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:51,392 INFO L134 CoverageAnalysis]: Checked inductivity of 28730 backedges. 0 proven. 28730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:51,393 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:51,393 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2018-07-25 13:32:51,393 INFO L451 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-07-25 13:32:51,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-07-25 13:32:51,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=29071, Unknown=0, NotChecked=0, Total=29412 [2018-07-25 13:32:51,396 INFO L87 Difference]: Start difference. First operand 343 states and 343 transitions. Second operand 172 states. [2018-07-25 13:32:53,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:53,367 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2018-07-25 13:32:53,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-07-25 13:32:53,367 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 342 [2018-07-25 13:32:53,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:53,368 INFO L225 Difference]: With dead ends: 347 [2018-07-25 13:32:53,368 INFO L226 Difference]: Without dead ends: 345 [2018-07-25 13:32:53,371 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=341, Invalid=29071, Unknown=0, NotChecked=0, Total=29412 [2018-07-25 13:32:53,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-07-25 13:32:53,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2018-07-25 13:32:53,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-07-25 13:32:53,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2018-07-25 13:32:53,379 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 342 [2018-07-25 13:32:53,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:53,379 INFO L472 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2018-07-25 13:32:53,380 INFO L473 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-07-25 13:32:53,380 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2018-07-25 13:32:53,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-07-25 13:32:53,381 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:53,381 INFO L354 BasicCegarLoop]: trace histogram [171, 170, 1, 1, 1] [2018-07-25 13:32:53,381 INFO L415 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:53,381 INFO L82 PathProgramCache]: Analyzing trace with hash -759361333, now seen corresponding path program 170 times [2018-07-25 13:32:53,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:54,799 INFO L134 CoverageAnalysis]: Checked inductivity of 29070 backedges. 0 proven. 29070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:54,800 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:54,800 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172] total 172 [2018-07-25 13:32:54,800 INFO L451 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-07-25 13:32:54,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-07-25 13:32:54,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=29413, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 13:32:54,803 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 173 states. [2018-07-25 13:32:56,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:56,782 INFO L93 Difference]: Finished difference Result 349 states and 349 transitions. [2018-07-25 13:32:56,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-07-25 13:32:56,782 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 344 [2018-07-25 13:32:56,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:56,783 INFO L225 Difference]: With dead ends: 349 [2018-07-25 13:32:56,783 INFO L226 Difference]: Without dead ends: 347 [2018-07-25 13:32:56,785 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=343, Invalid=29413, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 13:32:56,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-07-25 13:32:56,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2018-07-25 13:32:56,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-07-25 13:32:56,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2018-07-25 13:32:56,794 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 344 [2018-07-25 13:32:56,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:56,794 INFO L472 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2018-07-25 13:32:56,794 INFO L473 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-07-25 13:32:56,794 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2018-07-25 13:32:56,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-07-25 13:32:56,795 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:56,795 INFO L354 BasicCegarLoop]: trace histogram [172, 171, 1, 1, 1] [2018-07-25 13:32:56,795 INFO L415 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:56,796 INFO L82 PathProgramCache]: Analyzing trace with hash 398251397, now seen corresponding path program 171 times [2018-07-25 13:32:56,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:58,240 INFO L134 CoverageAnalysis]: Checked inductivity of 29412 backedges. 0 proven. 29412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:32:58,240 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:58,240 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2018-07-25 13:32:58,241 INFO L451 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-07-25 13:32:58,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-07-25 13:32:58,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=29757, Unknown=0, NotChecked=0, Total=30102 [2018-07-25 13:32:58,242 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 174 states. [2018-07-25 13:33:00,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:00,248 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2018-07-25 13:33:00,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-07-25 13:33:00,248 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 346 [2018-07-25 13:33:00,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:00,249 INFO L225 Difference]: With dead ends: 351 [2018-07-25 13:33:00,249 INFO L226 Difference]: Without dead ends: 349 [2018-07-25 13:33:00,251 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=345, Invalid=29757, Unknown=0, NotChecked=0, Total=30102 [2018-07-25 13:33:00,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-07-25 13:33:00,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2018-07-25 13:33:00,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-07-25 13:33:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2018-07-25 13:33:00,265 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 346 [2018-07-25 13:33:00,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:00,265 INFO L472 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2018-07-25 13:33:00,265 INFO L473 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-07-25 13:33:00,265 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2018-07-25 13:33:00,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-07-25 13:33:00,267 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:00,267 INFO L354 BasicCegarLoop]: trace histogram [173, 172, 1, 1, 1] [2018-07-25 13:33:00,267 INFO L415 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:00,268 INFO L82 PathProgramCache]: Analyzing trace with hash 467555263, now seen corresponding path program 172 times [2018-07-25 13:33:00,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:01,784 INFO L134 CoverageAnalysis]: Checked inductivity of 29756 backedges. 0 proven. 29756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:01,784 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:01,784 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [174] total 174 [2018-07-25 13:33:01,784 INFO L451 AbstractCegarLoop]: Interpolant automaton has 175 states [2018-07-25 13:33:01,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2018-07-25 13:33:01,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=30103, Unknown=0, NotChecked=0, Total=30450 [2018-07-25 13:33:01,787 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 175 states. [2018-07-25 13:33:03,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:03,850 INFO L93 Difference]: Finished difference Result 353 states and 353 transitions. [2018-07-25 13:33:03,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-07-25 13:33:03,850 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 348 [2018-07-25 13:33:03,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:03,851 INFO L225 Difference]: With dead ends: 353 [2018-07-25 13:33:03,851 INFO L226 Difference]: Without dead ends: 351 [2018-07-25 13:33:03,852 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=347, Invalid=30103, Unknown=0, NotChecked=0, Total=30450 [2018-07-25 13:33:03,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-07-25 13:33:03,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2018-07-25 13:33:03,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-07-25 13:33:03,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2018-07-25 13:33:03,861 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 348 [2018-07-25 13:33:03,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:03,861 INFO L472 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2018-07-25 13:33:03,861 INFO L473 AbstractCegarLoop]: Interpolant automaton has 175 states. [2018-07-25 13:33:03,861 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2018-07-25 13:33:03,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-07-25 13:33:03,862 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:03,862 INFO L354 BasicCegarLoop]: trace histogram [174, 173, 1, 1, 1] [2018-07-25 13:33:03,863 INFO L415 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:03,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1650906247, now seen corresponding path program 173 times [2018-07-25 13:33:03,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:05,296 INFO L134 CoverageAnalysis]: Checked inductivity of 30102 backedges. 0 proven. 30102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:05,296 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:05,296 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2018-07-25 13:33:05,296 INFO L451 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-07-25 13:33:05,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-07-25 13:33:05,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=30451, Unknown=0, NotChecked=0, Total=30800 [2018-07-25 13:33:05,299 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 176 states. [2018-07-25 13:33:07,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:07,453 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2018-07-25 13:33:07,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-07-25 13:33:07,453 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 350 [2018-07-25 13:33:07,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:07,454 INFO L225 Difference]: With dead ends: 355 [2018-07-25 13:33:07,454 INFO L226 Difference]: Without dead ends: 353 [2018-07-25 13:33:07,455 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=349, Invalid=30451, Unknown=0, NotChecked=0, Total=30800 [2018-07-25 13:33:07,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-07-25 13:33:07,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2018-07-25 13:33:07,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-07-25 13:33:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2018-07-25 13:33:07,463 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 350 [2018-07-25 13:33:07,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:07,463 INFO L472 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2018-07-25 13:33:07,464 INFO L473 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-07-25 13:33:07,464 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2018-07-25 13:33:07,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-07-25 13:33:07,465 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:07,465 INFO L354 BasicCegarLoop]: trace histogram [175, 174, 1, 1, 1] [2018-07-25 13:33:07,465 INFO L415 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:07,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1677919053, now seen corresponding path program 174 times [2018-07-25 13:33:07,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:08,933 INFO L134 CoverageAnalysis]: Checked inductivity of 30450 backedges. 0 proven. 30450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:08,933 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:08,933 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [176] total 176 [2018-07-25 13:33:08,934 INFO L451 AbstractCegarLoop]: Interpolant automaton has 177 states [2018-07-25 13:33:08,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2018-07-25 13:33:08,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=30801, Unknown=0, NotChecked=0, Total=31152 [2018-07-25 13:33:08,937 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 177 states. [2018-07-25 13:33:11,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:11,085 INFO L93 Difference]: Finished difference Result 357 states and 357 transitions. [2018-07-25 13:33:11,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-07-25 13:33:11,085 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 352 [2018-07-25 13:33:11,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:11,086 INFO L225 Difference]: With dead ends: 357 [2018-07-25 13:33:11,086 INFO L226 Difference]: Without dead ends: 355 [2018-07-25 13:33:11,089 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=351, Invalid=30801, Unknown=0, NotChecked=0, Total=31152 [2018-07-25 13:33:11,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-07-25 13:33:11,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2018-07-25 13:33:11,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-07-25 13:33:11,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 355 transitions. [2018-07-25 13:33:11,098 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 355 transitions. Word has length 352 [2018-07-25 13:33:11,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:11,098 INFO L472 AbstractCegarLoop]: Abstraction has 355 states and 355 transitions. [2018-07-25 13:33:11,098 INFO L473 AbstractCegarLoop]: Interpolant automaton has 177 states. [2018-07-25 13:33:11,098 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 355 transitions. [2018-07-25 13:33:11,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-07-25 13:33:11,099 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:11,100 INFO L354 BasicCegarLoop]: trace histogram [176, 175, 1, 1, 1] [2018-07-25 13:33:11,100 INFO L415 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:11,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1867421843, now seen corresponding path program 175 times [2018-07-25 13:33:11,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:12,626 INFO L134 CoverageAnalysis]: Checked inductivity of 30800 backedges. 0 proven. 30800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:12,626 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:12,626 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [177] total 177 [2018-07-25 13:33:12,626 INFO L451 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-07-25 13:33:12,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-07-25 13:33:12,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=31153, Unknown=0, NotChecked=0, Total=31506 [2018-07-25 13:33:12,629 INFO L87 Difference]: Start difference. First operand 355 states and 355 transitions. Second operand 178 states. [2018-07-25 13:33:14,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:14,754 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2018-07-25 13:33:14,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-07-25 13:33:14,754 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 354 [2018-07-25 13:33:14,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:14,755 INFO L225 Difference]: With dead ends: 359 [2018-07-25 13:33:14,755 INFO L226 Difference]: Without dead ends: 357 [2018-07-25 13:33:14,758 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=353, Invalid=31153, Unknown=0, NotChecked=0, Total=31506 [2018-07-25 13:33:14,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-07-25 13:33:14,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2018-07-25 13:33:14,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-07-25 13:33:14,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2018-07-25 13:33:14,767 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 354 [2018-07-25 13:33:14,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:14,768 INFO L472 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2018-07-25 13:33:14,768 INFO L473 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-07-25 13:33:14,768 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2018-07-25 13:33:14,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-07-25 13:33:14,769 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:14,769 INFO L354 BasicCegarLoop]: trace histogram [177, 176, 1, 1, 1] [2018-07-25 13:33:14,769 INFO L415 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:14,770 INFO L82 PathProgramCache]: Analyzing trace with hash 703990695, now seen corresponding path program 176 times [2018-07-25 13:33:14,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:16,335 INFO L134 CoverageAnalysis]: Checked inductivity of 31152 backedges. 0 proven. 31152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:16,335 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:16,335 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [178] total 178 [2018-07-25 13:33:16,336 INFO L451 AbstractCegarLoop]: Interpolant automaton has 179 states [2018-07-25 13:33:16,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2018-07-25 13:33:16,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=31507, Unknown=0, NotChecked=0, Total=31862 [2018-07-25 13:33:16,337 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 179 states. [2018-07-25 13:33:18,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:18,442 INFO L93 Difference]: Finished difference Result 361 states and 361 transitions. [2018-07-25 13:33:18,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-07-25 13:33:18,442 INFO L78 Accepts]: Start accepts. Automaton has 179 states. Word has length 356 [2018-07-25 13:33:18,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:18,443 INFO L225 Difference]: With dead ends: 361 [2018-07-25 13:33:18,443 INFO L226 Difference]: Without dead ends: 359 [2018-07-25 13:33:18,445 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=355, Invalid=31507, Unknown=0, NotChecked=0, Total=31862 [2018-07-25 13:33:18,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-07-25 13:33:18,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2018-07-25 13:33:18,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-07-25 13:33:18,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 359 transitions. [2018-07-25 13:33:18,453 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 359 transitions. Word has length 356 [2018-07-25 13:33:18,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:18,454 INFO L472 AbstractCegarLoop]: Abstraction has 359 states and 359 transitions. [2018-07-25 13:33:18,454 INFO L473 AbstractCegarLoop]: Interpolant automaton has 179 states. [2018-07-25 13:33:18,454 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 359 transitions. [2018-07-25 13:33:18,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-07-25 13:33:18,455 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:18,455 INFO L354 BasicCegarLoop]: trace histogram [178, 177, 1, 1, 1] [2018-07-25 13:33:18,455 INFO L415 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:18,455 INFO L82 PathProgramCache]: Analyzing trace with hash -2069722783, now seen corresponding path program 177 times [2018-07-25 13:33:18,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:18,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:20,080 INFO L134 CoverageAnalysis]: Checked inductivity of 31506 backedges. 0 proven. 31506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:20,080 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:20,081 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [179] total 179 [2018-07-25 13:33:20,081 INFO L451 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-07-25 13:33:20,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-07-25 13:33:20,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=31863, Unknown=0, NotChecked=0, Total=32220 [2018-07-25 13:33:20,082 INFO L87 Difference]: Start difference. First operand 359 states and 359 transitions. Second operand 180 states. [2018-07-25 13:33:22,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:22,295 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2018-07-25 13:33:22,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-07-25 13:33:22,295 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 358 [2018-07-25 13:33:22,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:22,296 INFO L225 Difference]: With dead ends: 363 [2018-07-25 13:33:22,296 INFO L226 Difference]: Without dead ends: 361 [2018-07-25 13:33:22,298 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=357, Invalid=31863, Unknown=0, NotChecked=0, Total=32220 [2018-07-25 13:33:22,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-07-25 13:33:22,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2018-07-25 13:33:22,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-07-25 13:33:22,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2018-07-25 13:33:22,307 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 358 [2018-07-25 13:33:22,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:22,307 INFO L472 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2018-07-25 13:33:22,307 INFO L473 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-07-25 13:33:22,307 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2018-07-25 13:33:22,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-07-25 13:33:22,308 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:22,308 INFO L354 BasicCegarLoop]: trace histogram [179, 178, 1, 1, 1] [2018-07-25 13:33:22,308 INFO L415 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:22,309 INFO L82 PathProgramCache]: Analyzing trace with hash -433684325, now seen corresponding path program 178 times [2018-07-25 13:33:22,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:23,972 INFO L134 CoverageAnalysis]: Checked inductivity of 31862 backedges. 0 proven. 31862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:33:23,972 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:23,973 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [180] total 180 [2018-07-25 13:33:23,973 INFO L451 AbstractCegarLoop]: Interpolant automaton has 181 states [2018-07-25 13:33:23,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 181 interpolants. [2018-07-25 13:33:23,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=32221, Unknown=0, NotChecked=0, Total=32580 [2018-07-25 13:33:23,974 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 181 states. Received shutdown request... [2018-07-25 13:33:25,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-07-25 13:33:25,460 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 13:33:25,467 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 13:33:25,468 INFO L202 PluginConnector]: Adding new model simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:33:25 BoogieIcfgContainer [2018-07-25 13:33:25,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:33:25,469 INFO L168 Benchmark]: Toolchain (without parser) took 250470.50 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 959.6 MB. Max. memory is 7.1 GB. [2018-07-25 13:33:25,474 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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:33:25,474 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.31 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:33:25,475 INFO L168 Benchmark]: Boogie Preprocessor took 25.49 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:33:25,475 INFO L168 Benchmark]: RCFGBuilder took 285.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 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:33:25,476 INFO L168 Benchmark]: TraceAbstraction took 250107.47 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 949.1 MB. Max. memory is 7.1 GB. [2018-07-25 13:33:25,479 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.19 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 46.31 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 25.49 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 285.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 250107.47 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 949.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 30). Cancelled while BasicCegarLoop was constructing difference of abstraction (361states) and interpolant automaton (currently 122 states, 181 states before enhancement), while ReachableStatesComputation was computing reachable states (239 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 250.0s OverallTime, 179 OverallIterations, 179 TraceHistogramMax, 140.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16585 SDtfs, 0 SDslu, 1916972 SDs, 0 SdLazy, 1949043 SolverSat, 0 SolverUnsat, 87 SolverUnknown, 0 SolverNotchecked, 92.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16289 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 16110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 83.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=361occurred in iteration=178, 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: 1.4s AutomataMinimizationTime, 178 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 93.4s InterpolantComputationTime, 32578 NumberOfCodeBlocks, 32578 NumberOfCodeBlocksAsserted, 179 NumberOfCheckSat, 32399 ConstructedInterpolants, 0 QuantifiedInterpolants, 54237179 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 179 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1911720 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/simple4.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-33-25-499.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/simple4.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-33-25-499.csv Completed graceful shutdown