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/invert_string.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:25:37,789 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:25:37,791 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:25:37,804 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:25:37,804 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:25:37,806 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:25:37,807 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:25:37,809 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:25:37,810 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:25:37,811 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:25:37,812 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:25:37,813 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:25:37,814 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:25:37,815 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:25:37,816 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:25:37,817 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:25:37,817 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:25:37,819 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:25:37,821 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:25:37,823 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:25:37,824 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:25:37,826 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:25:37,828 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:25:37,828 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:25:37,828 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:25:37,829 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:25:37,830 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:25:37,831 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:25:37,832 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:25:37,833 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:25:37,833 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:25:37,834 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:25:37,834 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:25:37,835 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:25:37,836 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:25:37,836 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:25:37,837 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:25:37,845 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:25:37,845 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:25:37,847 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:25:37,847 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:25:37,847 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:25:37,847 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:25:37,848 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:25:37,848 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:25:37,898 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:25:37,924 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:25:37,931 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:25:37,933 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:25:37,933 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:25:37,934 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl [2018-07-25 13:25:37,934 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl' [2018-07-25 13:25:38,016 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:25:38,018 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:25:38,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:25:38,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:25:38,019 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:25:38,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:25:38" (1/1) ... [2018-07-25 13:25:38,056 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:25:38" (1/1) ... [2018-07-25 13:25:38,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:25:38,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:25:38,063 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:25:38,064 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:25:38,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:25:38" (1/1) ... [2018-07-25 13:25:38,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:25:38" (1/1) ... [2018-07-25 13:25:38,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:25:38" (1/1) ... [2018-07-25 13:25:38,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:25:38" (1/1) ... [2018-07-25 13:25:38,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:25:38" (1/1) ... [2018-07-25 13:25:38,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:25:38" (1/1) ... [2018-07-25 13:25:38,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:25:38" (1/1) ... [2018-07-25 13:25:38,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:25:38,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:25:38,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:25:38,087 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:25:38,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:25:38" (1/1) ... [2018-07-25 13:25:38,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 13:25:38,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 13:25:38,337 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 13:25:38,338 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:25:38 BoogieIcfgContainer [2018-07-25 13:25:38,338 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:25:38,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:25:38,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:25:38,345 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:25:38,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:25:38" (1/2) ... [2018-07-25 13:25:38,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32904d24 and model type invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:25:38, skipping insertion in model container [2018-07-25 13:25:38,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:25:38" (2/2) ... [2018-07-25 13:25:38,350 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string.i_4.bpl [2018-07-25 13:25:38,360 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:25:38,369 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:25:38,417 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:25:38,417 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:25:38,418 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:25:38,418 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:25:38,418 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:25:38,418 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:25:38,419 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:25:38,419 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:25:38,419 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:25:38,434 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-07-25 13:25:38,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:25:38,443 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:38,444 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:25:38,445 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:38,451 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2018-07-25 13:25:38,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:38,546 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:25:38,549 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:25:38,550 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:25:38,555 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:25:38,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:25:38,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:25:38,574 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 4 states. [2018-07-25 13:25:38,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:38,648 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-07-25 13:25:38,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:25:38,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-07-25 13:25:38,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:38,662 INFO L225 Difference]: With dead ends: 14 [2018-07-25 13:25:38,662 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 13:25:38,666 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:25:38,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 13:25:38,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 13:25:38,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 13:25:38,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-07-25 13:25:38,705 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-07-25 13:25:38,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:38,705 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-07-25 13:25:38,706 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:25:38,706 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-07-25 13:25:38,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:25:38,707 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:38,707 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:25:38,707 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:38,708 INFO L82 PathProgramCache]: Analyzing trace with hash 198621957, now seen corresponding path program 1 times [2018-07-25 13:25:38,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:38,786 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:25:38,786 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:38,786 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:25:38,789 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:25:38,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:25:38,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:25:38,790 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-07-25 13:25:38,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:38,859 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-07-25 13:25:38,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:25:38,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-07-25 13:25:38,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:38,860 INFO L225 Difference]: With dead ends: 13 [2018-07-25 13:25:38,860 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 13:25:38,862 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:25:38,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 13:25:38,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 13:25:38,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 13:25:38,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-07-25 13:25:38,867 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-07-25 13:25:38,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:38,867 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-07-25 13:25:38,867 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:25:38,867 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-07-25 13:25:38,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:25:38,868 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:38,868 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:25:38,869 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:38,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1897191999, now seen corresponding path program 1 times [2018-07-25 13:25:38,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:39,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:39,010 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:39,010 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:25:39,011 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:25:39,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:25:39,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:25:39,012 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2018-07-25 13:25:39,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:39,156 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-07-25 13:25:39,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:25:39,157 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-07-25 13:25:39,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:39,158 INFO L225 Difference]: With dead ends: 19 [2018-07-25 13:25:39,158 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 13:25:39,159 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:25:39,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 13:25:39,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 13:25:39,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 13:25:39,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-07-25 13:25:39,166 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-07-25 13:25:39,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:39,166 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-07-25 13:25:39,166 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:25:39,167 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-07-25 13:25:39,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:25:39,167 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:39,168 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2018-07-25 13:25:39,168 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:39,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1765270407, now seen corresponding path program 2 times [2018-07-25 13:25:39,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:39,200 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:39,201 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:39,201 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:25:39,201 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:25:39,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:25:39,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:25:39,202 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 6 states. [2018-07-25 13:25:39,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:39,273 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-07-25 13:25:39,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:25:39,273 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-07-25 13:25:39,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:39,274 INFO L225 Difference]: With dead ends: 17 [2018-07-25 13:25:39,274 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 13:25:39,275 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:25:39,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 13:25:39,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 13:25:39,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 13:25:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-07-25 13:25:39,283 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-07-25 13:25:39,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:39,283 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-07-25 13:25:39,284 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:25:39,284 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-07-25 13:25:39,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 13:25:39,284 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:39,285 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-07-25 13:25:39,285 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:39,285 INFO L82 PathProgramCache]: Analyzing trace with hash 87273139, now seen corresponding path program 3 times [2018-07-25 13:25:39,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:39,370 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:25:39,371 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:39,371 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:25:39,372 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:25:39,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:25:39,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:25:39,373 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2018-07-25 13:25:39,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:39,561 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-07-25 13:25:39,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:25:39,562 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-25 13:25:39,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:39,563 INFO L225 Difference]: With dead ends: 25 [2018-07-25 13:25:39,563 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 13:25:39,564 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:25:39,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 13:25:39,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 13:25:39,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 13:25:39,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-07-25 13:25:39,577 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-07-25 13:25:39,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:39,577 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-07-25 13:25:39,577 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:25:39,578 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-07-25 13:25:39,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:25:39,582 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:39,582 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1] [2018-07-25 13:25:39,582 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:39,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1096334355, now seen corresponding path program 4 times [2018-07-25 13:25:39,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:39,639 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:39,639 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:39,639 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:25:39,640 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:25:39,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:25:39,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:25:39,649 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2018-07-25 13:25:39,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:39,703 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-07-25 13:25:39,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:25:39,704 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-07-25 13:25:39,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:39,705 INFO L225 Difference]: With dead ends: 21 [2018-07-25 13:25:39,705 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 13:25:39,706 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:25:39,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 13:25:39,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 13:25:39,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 13:25:39,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-07-25 13:25:39,715 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-07-25 13:25:39,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:39,716 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-07-25 13:25:39,716 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:25:39,716 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-07-25 13:25:39,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:25:39,717 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:39,717 INFO L354 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2018-07-25 13:25:39,717 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:39,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1310275289, now seen corresponding path program 5 times [2018-07-25 13:25:39,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:39,788 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:39,789 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:39,789 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:25:39,790 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:25:39,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:25:39,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:25:39,791 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2018-07-25 13:25:39,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:39,939 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-07-25 13:25:39,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:25:39,939 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-25 13:25:39,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:39,942 INFO L225 Difference]: With dead ends: 31 [2018-07-25 13:25:39,942 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 13:25:39,943 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:25:39,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 13:25:39,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 13:25:39,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 13:25:39,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-07-25 13:25:39,954 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-07-25 13:25:39,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:39,956 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-07-25 13:25:39,956 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:25:39,956 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-07-25 13:25:39,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:25:39,957 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:39,958 INFO L354 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1] [2018-07-25 13:25:39,958 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:39,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1330040479, now seen corresponding path program 6 times [2018-07-25 13:25:39,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:40,006 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:40,006 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:40,006 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:25:40,007 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:25:40,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:25:40,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:25:40,008 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 8 states. [2018-07-25 13:25:40,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:40,043 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-07-25 13:25:40,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:25:40,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-07-25 13:25:40,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:40,045 INFO L225 Difference]: With dead ends: 25 [2018-07-25 13:25:40,045 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 13:25:40,045 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:25:40,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 13:25:40,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 13:25:40,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 13:25:40,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-07-25 13:25:40,061 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-07-25 13:25:40,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:40,063 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-07-25 13:25:40,063 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:25:40,063 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-07-25 13:25:40,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:25:40,064 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:40,064 INFO L354 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2018-07-25 13:25:40,068 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:40,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1731406235, now seen corresponding path program 7 times [2018-07-25 13:25:40,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:40,170 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:40,170 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:40,171 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:25:40,171 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:25:40,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:25:40,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:25:40,173 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2018-07-25 13:25:40,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:40,326 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-07-25 13:25:40,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:25:40,327 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-07-25 13:25:40,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:40,328 INFO L225 Difference]: With dead ends: 37 [2018-07-25 13:25:40,328 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 13:25:40,329 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:25:40,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 13:25:40,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 13:25:40,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 13:25:40,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-07-25 13:25:40,339 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-07-25 13:25:40,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:40,339 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-07-25 13:25:40,340 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:25:40,340 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-07-25 13:25:40,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 13:25:40,341 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:40,341 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1] [2018-07-25 13:25:40,341 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:40,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1774380245, now seen corresponding path program 8 times [2018-07-25 13:25:40,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:40,374 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:40,374 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:40,375 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:25:40,375 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:25:40,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:25:40,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:25:40,376 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 9 states. [2018-07-25 13:25:40,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:40,416 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-07-25 13:25:40,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:25:40,417 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-07-25 13:25:40,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:40,418 INFO L225 Difference]: With dead ends: 29 [2018-07-25 13:25:40,418 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 13:25:40,419 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:25:40,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 13:25:40,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 13:25:40,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 13:25:40,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-07-25 13:25:40,432 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-07-25 13:25:40,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:40,433 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-07-25 13:25:40,433 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:25:40,433 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-07-25 13:25:40,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 13:25:40,434 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:40,434 INFO L354 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2018-07-25 13:25:40,435 INFO L415 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:40,435 INFO L82 PathProgramCache]: Analyzing trace with hash 77451279, now seen corresponding path program 9 times [2018-07-25 13:25:40,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:40,512 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:40,512 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:40,513 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:25:40,513 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:25:40,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:25:40,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:25:40,514 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2018-07-25 13:25:40,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:40,688 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-07-25 13:25:40,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:25:40,689 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-07-25 13:25:40,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:40,689 INFO L225 Difference]: With dead ends: 43 [2018-07-25 13:25:40,690 INFO L226 Difference]: Without dead ends: 29 [2018-07-25 13:25:40,693 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:25:40,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-25 13:25:40,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-25 13:25:40,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 13:25:40,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-07-25 13:25:40,708 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-07-25 13:25:40,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:40,709 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-07-25 13:25:40,709 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:25:40,709 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-07-25 13:25:40,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 13:25:40,710 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:40,711 INFO L354 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1] [2018-07-25 13:25:40,711 INFO L415 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:40,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1980325449, now seen corresponding path program 10 times [2018-07-25 13:25:40,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:40,748 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:40,749 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:40,749 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:25:40,749 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:25:40,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:25:40,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:25:40,750 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 10 states. [2018-07-25 13:25:40,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:40,794 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-07-25 13:25:40,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:25:40,794 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-07-25 13:25:40,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:40,795 INFO L225 Difference]: With dead ends: 33 [2018-07-25 13:25:40,796 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 13:25:40,796 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:25:40,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 13:25:40,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-25 13:25:40,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 13:25:40,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-07-25 13:25:40,810 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-07-25 13:25:40,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:40,810 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-07-25 13:25:40,811 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:25:40,811 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-07-25 13:25:40,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 13:25:40,812 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:40,812 INFO L354 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1] [2018-07-25 13:25:40,812 INFO L415 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:40,813 INFO L82 PathProgramCache]: Analyzing trace with hash 422296707, now seen corresponding path program 11 times [2018-07-25 13:25:40,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:40,916 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:40,917 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:40,917 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:25:40,917 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:25:40,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:25:40,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:25:40,919 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2018-07-25 13:25:41,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:41,146 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2018-07-25 13:25:41,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:25:41,146 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-07-25 13:25:41,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:41,147 INFO L225 Difference]: With dead ends: 49 [2018-07-25 13:25:41,147 INFO L226 Difference]: Without dead ends: 33 [2018-07-25 13:25:41,149 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:25:41,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-25 13:25:41,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-25 13:25:41,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-25 13:25:41,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-07-25 13:25:41,169 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2018-07-25 13:25:41,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:41,170 INFO L472 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-07-25 13:25:41,170 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:25:41,170 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-07-25 13:25:41,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-25 13:25:41,171 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:41,171 INFO L354 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 1, 1, 1, 1] [2018-07-25 13:25:41,171 INFO L415 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:41,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1320051267, now seen corresponding path program 12 times [2018-07-25 13:25:41,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 42 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:41,212 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:41,212 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:25:41,213 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:25:41,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:25:41,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:25:41,214 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2018-07-25 13:25:41,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:41,267 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-07-25 13:25:41,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:25:41,267 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-07-25 13:25:41,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:41,268 INFO L225 Difference]: With dead ends: 37 [2018-07-25 13:25:41,268 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 13:25:41,269 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:25:41,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 13:25:41,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 13:25:41,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 13:25:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-07-25 13:25:41,289 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-07-25 13:25:41,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:41,290 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-07-25 13:25:41,290 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:25:41,290 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-07-25 13:25:41,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 13:25:41,291 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:41,291 INFO L354 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1] [2018-07-25 13:25:41,291 INFO L415 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:41,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1553862921, now seen corresponding path program 13 times [2018-07-25 13:25:41,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:41,411 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:41,412 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:41,412 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 13:25:41,412 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 13:25:41,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 13:25:41,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:25:41,414 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2018-07-25 13:25:41,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:41,690 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-07-25 13:25:41,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:25:41,690 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-07-25 13:25:41,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:41,691 INFO L225 Difference]: With dead ends: 55 [2018-07-25 13:25:41,691 INFO L226 Difference]: Without dead ends: 37 [2018-07-25 13:25:41,692 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:25:41,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-25 13:25:41,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-25 13:25:41,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 13:25:41,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-07-25 13:25:41,717 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2018-07-25 13:25:41,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:41,717 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-07-25 13:25:41,718 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 13:25:41,718 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-07-25 13:25:41,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 13:25:41,721 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:41,721 INFO L354 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 1, 1, 1, 1] [2018-07-25 13:25:41,722 INFO L415 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:41,722 INFO L82 PathProgramCache]: Analyzing trace with hash 115385137, now seen corresponding path program 14 times [2018-07-25 13:25:41,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:41,770 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 56 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:41,771 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:41,771 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:25:41,772 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:25:41,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:25:41,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:25:41,776 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 12 states. [2018-07-25 13:25:41,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:41,841 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-07-25 13:25:41,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:25:41,841 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-07-25 13:25:41,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:41,842 INFO L225 Difference]: With dead ends: 41 [2018-07-25 13:25:41,842 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 13:25:41,845 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:25:41,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 13:25:41,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-25 13:25:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-25 13:25:41,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-07-25 13:25:41,875 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-07-25 13:25:41,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:41,875 INFO L472 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-07-25 13:25:41,876 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:25:41,876 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-07-25 13:25:41,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-25 13:25:41,878 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:41,878 INFO L354 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1] [2018-07-25 13:25:41,880 INFO L415 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:41,880 INFO L82 PathProgramCache]: Analyzing trace with hash -783980693, now seen corresponding path program 15 times [2018-07-25 13:25:41,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:42,017 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:42,017 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:42,018 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 13:25:42,018 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 13:25:42,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 13:25:42,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:25:42,019 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2018-07-25 13:25:42,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:42,322 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-07-25 13:25:42,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:25:42,323 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-07-25 13:25:42,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:42,323 INFO L225 Difference]: With dead ends: 61 [2018-07-25 13:25:42,324 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 13:25:42,325 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=830, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:25:42,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 13:25:42,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-25 13:25:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 13:25:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-07-25 13:25:42,346 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-07-25 13:25:42,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:42,347 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-07-25 13:25:42,347 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 13:25:42,347 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-07-25 13:25:42,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 13:25:42,348 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:42,348 INFO L354 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 1, 1, 1, 1] [2018-07-25 13:25:42,348 INFO L415 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:42,349 INFO L82 PathProgramCache]: Analyzing trace with hash 830172837, now seen corresponding path program 16 times [2018-07-25 13:25:42,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:42,401 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 72 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:42,401 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:42,401 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:25:42,402 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:25:42,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:25:42,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:25:42,403 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 13 states. [2018-07-25 13:25:42,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:42,477 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-07-25 13:25:42,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:25:42,477 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-07-25 13:25:42,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:42,478 INFO L225 Difference]: With dead ends: 45 [2018-07-25 13:25:42,478 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 13:25:42,482 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:25:42,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 13:25:42,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-25 13:25:42,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 13:25:42,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-07-25 13:25:42,509 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-07-25 13:25:42,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:42,510 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-07-25 13:25:42,510 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:25:42,510 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-07-25 13:25:42,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 13:25:42,511 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:42,511 INFO L354 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1] [2018-07-25 13:25:42,511 INFO L415 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:42,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1067768353, now seen corresponding path program 17 times [2018-07-25 13:25:42,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:42,705 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:42,706 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:42,706 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 13:25:42,706 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 13:25:42,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 13:25:42,707 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:25:42,707 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2018-07-25 13:25:43,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:43,023 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-07-25 13:25:43,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:25:43,023 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-07-25 13:25:43,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:43,024 INFO L225 Difference]: With dead ends: 67 [2018-07-25 13:25:43,024 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 13:25:43,025 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=1012, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:25:43,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 13:25:43,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 13:25:43,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 13:25:43,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-07-25 13:25:43,051 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-07-25 13:25:43,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:43,051 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-07-25 13:25:43,051 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 13:25:43,051 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-07-25 13:25:43,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 13:25:43,052 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:43,052 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 1, 1, 1, 1] [2018-07-25 13:25:43,052 INFO L415 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:43,053 INFO L82 PathProgramCache]: Analyzing trace with hash 2070347801, now seen corresponding path program 18 times [2018-07-25 13:25:43,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:43,102 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 90 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:43,102 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:43,102 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:25:43,103 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:25:43,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:25:43,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:25:43,103 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 14 states. [2018-07-25 13:25:43,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:43,178 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-07-25 13:25:43,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:25:43,178 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-07-25 13:25:43,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:43,179 INFO L225 Difference]: With dead ends: 49 [2018-07-25 13:25:43,179 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 13:25:43,180 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:25:43,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 13:25:43,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-25 13:25:43,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 13:25:43,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-07-25 13:25:43,208 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-07-25 13:25:43,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:43,208 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-07-25 13:25:43,208 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:25:43,209 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-07-25 13:25:43,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 13:25:43,209 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:43,210 INFO L354 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1] [2018-07-25 13:25:43,210 INFO L415 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:43,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1034431059, now seen corresponding path program 19 times [2018-07-25 13:25:43,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:43,364 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:43,364 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:43,364 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 13:25:43,365 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 13:25:43,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 13:25:43,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:25:43,366 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2018-07-25 13:25:43,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:43,739 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2018-07-25 13:25:43,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 13:25:43,739 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-07-25 13:25:43,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:43,740 INFO L225 Difference]: With dead ends: 73 [2018-07-25 13:25:43,740 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 13:25:43,741 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=1212, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:25:43,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 13:25:43,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-25 13:25:43,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-25 13:25:43,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-07-25 13:25:43,770 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2018-07-25 13:25:43,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:43,770 INFO L472 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-07-25 13:25:43,770 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 13:25:43,770 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-07-25 13:25:43,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 13:25:43,771 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:43,771 INFO L354 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 1, 1, 1, 1] [2018-07-25 13:25:43,771 INFO L415 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:43,771 INFO L82 PathProgramCache]: Analyzing trace with hash 2120767373, now seen corresponding path program 20 times [2018-07-25 13:25:43,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:43,825 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 110 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:43,825 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:43,826 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:25:43,826 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:25:43,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:25:43,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:25:43,827 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 15 states. [2018-07-25 13:25:43,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:43,913 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-07-25 13:25:43,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 13:25:43,914 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-07-25 13:25:43,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:43,914 INFO L225 Difference]: With dead ends: 53 [2018-07-25 13:25:43,914 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 13:25:43,915 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:25:43,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 13:25:43,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-25 13:25:43,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 13:25:43,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-07-25 13:25:43,944 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2018-07-25 13:25:43,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:43,945 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-07-25 13:25:43,945 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:25:43,945 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-07-25 13:25:43,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 13:25:43,946 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:43,946 INFO L354 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1] [2018-07-25 13:25:43,946 INFO L415 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:43,946 INFO L82 PathProgramCache]: Analyzing trace with hash -2051967801, now seen corresponding path program 21 times [2018-07-25 13:25:43,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:44,112 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:44,113 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:44,113 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 13:25:44,113 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 13:25:44,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 13:25:44,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:25:44,115 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2018-07-25 13:25:44,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:44,525 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2018-07-25 13:25:44,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 13:25:44,525 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-07-25 13:25:44,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:44,526 INFO L225 Difference]: With dead ends: 79 [2018-07-25 13:25:44,526 INFO L226 Difference]: Without dead ends: 53 [2018-07-25 13:25:44,527 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=1430, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:25:44,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-25 13:25:44,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-25 13:25:44,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-25 13:25:44,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-07-25 13:25:44,560 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2018-07-25 13:25:44,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:44,561 INFO L472 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-07-25 13:25:44,561 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 13:25:44,561 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-07-25 13:25:44,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-25 13:25:44,561 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:44,562 INFO L354 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 1, 1, 1, 1] [2018-07-25 13:25:44,562 INFO L415 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:44,562 INFO L82 PathProgramCache]: Analyzing trace with hash -473664255, now seen corresponding path program 22 times [2018-07-25 13:25:44,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:44,624 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 132 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:44,624 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:44,624 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:25:44,624 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:25:44,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:25:44,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=132, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:25:44,625 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 16 states. [2018-07-25 13:25:44,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:44,717 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-07-25 13:25:44,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 13:25:44,718 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-07-25 13:25:44,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:44,718 INFO L225 Difference]: With dead ends: 57 [2018-07-25 13:25:44,718 INFO L226 Difference]: Without dead ends: 55 [2018-07-25 13:25:44,719 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:25:44,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-25 13:25:44,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-25 13:25:44,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-25 13:25:44,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-07-25 13:25:44,755 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2018-07-25 13:25:44,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:44,756 INFO L472 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-07-25 13:25:44,756 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:25:44,756 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-07-25 13:25:44,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-25 13:25:44,756 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:44,756 INFO L354 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1] [2018-07-25 13:25:44,757 INFO L415 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:44,757 INFO L82 PathProgramCache]: Analyzing trace with hash 75236667, now seen corresponding path program 23 times [2018-07-25 13:25:44,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:44,928 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:44,929 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:44,929 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 13:25:44,929 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 13:25:44,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 13:25:44,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:25:44,930 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2018-07-25 13:25:45,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:45,420 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2018-07-25 13:25:45,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 13:25:45,420 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-07-25 13:25:45,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:45,421 INFO L225 Difference]: With dead ends: 85 [2018-07-25 13:25:45,421 INFO L226 Difference]: Without dead ends: 57 [2018-07-25 13:25:45,423 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=1666, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:25:45,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-25 13:25:45,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-25 13:25:45,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-25 13:25:45,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-07-25 13:25:45,464 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2018-07-25 13:25:45,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:45,465 INFO L472 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-07-25 13:25:45,465 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 13:25:45,465 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-07-25 13:25:45,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-25 13:25:45,465 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:45,466 INFO L354 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 1, 1, 1, 1] [2018-07-25 13:25:45,466 INFO L415 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:45,466 INFO L82 PathProgramCache]: Analyzing trace with hash 608196725, now seen corresponding path program 24 times [2018-07-25 13:25:45,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:45,536 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 156 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:45,537 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:45,537 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 13:25:45,537 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 13:25:45,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 13:25:45,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=149, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:25:45,538 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 17 states. [2018-07-25 13:25:45,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:45,646 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-07-25 13:25:45,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 13:25:45,646 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-07-25 13:25:45,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:45,647 INFO L225 Difference]: With dead ends: 61 [2018-07-25 13:25:45,647 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 13:25:45,648 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:25:45,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 13:25:45,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-25 13:25:45,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-25 13:25:45,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-07-25 13:25:45,690 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2018-07-25 13:25:45,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:45,690 INFO L472 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-07-25 13:25:45,690 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 13:25:45,690 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-07-25 13:25:45,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-25 13:25:45,691 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:45,691 INFO L354 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1] [2018-07-25 13:25:45,692 INFO L415 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:45,692 INFO L82 PathProgramCache]: Analyzing trace with hash 361552815, now seen corresponding path program 25 times [2018-07-25 13:25:45,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:45,922 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:45,923 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:45,924 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 13:25:45,924 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 13:25:45,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 13:25:45,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:25:45,925 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2018-07-25 13:25:46,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:46,398 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-07-25 13:25:46,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 13:25:46,399 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-07-25 13:25:46,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:46,399 INFO L225 Difference]: With dead ends: 91 [2018-07-25 13:25:46,399 INFO L226 Difference]: Without dead ends: 61 [2018-07-25 13:25:46,402 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=1920, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:25:46,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-25 13:25:46,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-25 13:25:46,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-25 13:25:46,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-07-25 13:25:46,441 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2018-07-25 13:25:46,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:46,441 INFO L472 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-07-25 13:25:46,441 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 13:25:46,441 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-07-25 13:25:46,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-25 13:25:46,442 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:46,442 INFO L354 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 1, 1, 1, 1] [2018-07-25 13:25:46,442 INFO L415 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:46,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1210122729, now seen corresponding path program 26 times [2018-07-25 13:25:46,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:46,504 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 182 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:46,505 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:46,505 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 13:25:46,505 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 13:25:46,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 13:25:46,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:25:46,506 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 18 states. [2018-07-25 13:25:46,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:46,602 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-07-25 13:25:46,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 13:25:46,603 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2018-07-25 13:25:46,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:46,603 INFO L225 Difference]: With dead ends: 65 [2018-07-25 13:25:46,604 INFO L226 Difference]: Without dead ends: 63 [2018-07-25 13:25:46,604 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:25:46,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-25 13:25:46,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-25 13:25:46,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-25 13:25:46,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-07-25 13:25:46,644 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2018-07-25 13:25:46,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:46,644 INFO L472 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-07-25 13:25:46,645 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 13:25:46,645 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-07-25 13:25:46,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-25 13:25:46,645 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:46,645 INFO L354 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1, 1, 1] [2018-07-25 13:25:46,646 INFO L415 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:46,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1008142301, now seen corresponding path program 27 times [2018-07-25 13:25:46,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:46,838 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:25:46,838 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:46,839 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 13:25:46,839 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 13:25:46,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 13:25:46,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:25:46,840 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2018-07-25 13:25:47,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:47,376 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2018-07-25 13:25:47,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 13:25:47,376 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-07-25 13:25:47,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:47,377 INFO L225 Difference]: With dead ends: 97 [2018-07-25 13:25:47,377 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 13:25:47,379 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=2192, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:25:47,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 13:25:47,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 13:25:47,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 13:25:47,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-07-25 13:25:47,425 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2018-07-25 13:25:47,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:47,426 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-07-25 13:25:47,426 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 13:25:47,426 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-07-25 13:25:47,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-25 13:25:47,426 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:47,427 INFO L354 BasicCegarLoop]: trace histogram [16, 15, 15, 14, 1, 1, 1, 1] [2018-07-25 13:25:47,427 INFO L415 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:47,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1490325155, now seen corresponding path program 28 times [2018-07-25 13:25:47,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:47,495 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 210 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:47,496 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:47,496 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 13:25:47,496 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 13:25:47,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 13:25:47,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=186, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:25:47,497 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 19 states. [2018-07-25 13:25:47,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:47,613 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2018-07-25 13:25:47,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 13:25:47,614 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 64 [2018-07-25 13:25:47,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:47,615 INFO L225 Difference]: With dead ends: 69 [2018-07-25 13:25:47,615 INFO L226 Difference]: Without dead ends: 67 [2018-07-25 13:25:47,616 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:25:47,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-25 13:25:47,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-25 13:25:47,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-25 13:25:47,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-07-25 13:25:47,663 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2018-07-25 13:25:47,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:47,663 INFO L472 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-07-25 13:25:47,663 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 13:25:47,664 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-07-25 13:25:47,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-25 13:25:47,664 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:47,664 INFO L354 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1] [2018-07-25 13:25:47,665 INFO L415 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:47,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1978312041, now seen corresponding path program 29 times [2018-07-25 13:25:47,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:47,881 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:47,881 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 13:25:47,882 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 13:25:47,882 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 13:25:47,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:25:47,883 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2018-07-25 13:25:48,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:48,471 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2018-07-25 13:25:48,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 13:25:48,471 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-07-25 13:25:48,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:48,472 INFO L225 Difference]: With dead ends: 103 [2018-07-25 13:25:48,472 INFO L226 Difference]: Without dead ends: 69 [2018-07-25 13:25:48,473 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=2482, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:25:48,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-25 13:25:48,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-25 13:25:48,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-25 13:25:48,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-07-25 13:25:48,527 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2018-07-25 13:25:48,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:48,527 INFO L472 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-07-25 13:25:48,527 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 13:25:48,528 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-07-25 13:25:48,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-25 13:25:48,528 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:48,528 INFO L354 BasicCegarLoop]: trace histogram [17, 16, 16, 15, 1, 1, 1, 1] [2018-07-25 13:25:48,528 INFO L415 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:48,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1465604399, now seen corresponding path program 30 times [2018-07-25 13:25:48,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:48,612 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 240 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:48,613 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:48,613 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 13:25:48,613 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 13:25:48,614 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 13:25:48,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=206, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:25:48,614 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 20 states. [2018-07-25 13:25:48,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:48,754 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2018-07-25 13:25:48,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 13:25:48,754 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2018-07-25 13:25:48,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:48,755 INFO L225 Difference]: With dead ends: 73 [2018-07-25 13:25:48,755 INFO L226 Difference]: Without dead ends: 71 [2018-07-25 13:25:48,756 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:25:48,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-25 13:25:48,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-25 13:25:48,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-25 13:25:48,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-07-25 13:25:48,816 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2018-07-25 13:25:48,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:48,817 INFO L472 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-07-25 13:25:48,817 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 13:25:48,817 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-07-25 13:25:48,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-25 13:25:48,817 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:48,818 INFO L354 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1, 1, 1] [2018-07-25 13:25:48,818 INFO L415 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:48,818 INFO L82 PathProgramCache]: Analyzing trace with hash 303497995, now seen corresponding path program 31 times [2018-07-25 13:25:48,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:49,100 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:49,100 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:49,101 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 13:25:49,101 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 13:25:49,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 13:25:49,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:25:49,102 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2018-07-25 13:25:49,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:49,741 INFO L93 Difference]: Finished difference Result 109 states and 111 transitions. [2018-07-25 13:25:49,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 13:25:49,741 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-07-25 13:25:49,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:49,742 INFO L225 Difference]: With dead ends: 109 [2018-07-25 13:25:49,742 INFO L226 Difference]: Without dead ends: 73 [2018-07-25 13:25:49,744 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=2790, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:25:49,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-25 13:25:49,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-25 13:25:49,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-25 13:25:49,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-07-25 13:25:49,805 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2018-07-25 13:25:49,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:49,805 INFO L472 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-07-25 13:25:49,806 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 13:25:49,806 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-07-25 13:25:49,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-25 13:25:49,806 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:49,807 INFO L354 BasicCegarLoop]: trace histogram [18, 17, 17, 16, 1, 1, 1, 1] [2018-07-25 13:25:49,807 INFO L415 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:49,807 INFO L82 PathProgramCache]: Analyzing trace with hash -2091802043, now seen corresponding path program 32 times [2018-07-25 13:25:49,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:49,876 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 272 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:49,876 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:49,876 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 13:25:49,877 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 13:25:49,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 13:25:49,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=227, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:25:49,878 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 21 states. [2018-07-25 13:25:50,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:50,007 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-07-25 13:25:50,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 13:25:50,007 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 72 [2018-07-25 13:25:50,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:50,008 INFO L225 Difference]: With dead ends: 77 [2018-07-25 13:25:50,008 INFO L226 Difference]: Without dead ends: 75 [2018-07-25 13:25:50,009 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:25:50,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-25 13:25:50,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-25 13:25:50,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-25 13:25:50,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-07-25 13:25:50,068 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2018-07-25 13:25:50,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:50,068 INFO L472 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-07-25 13:25:50,069 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 13:25:50,069 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-07-25 13:25:50,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-25 13:25:50,069 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:50,069 INFO L354 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1] [2018-07-25 13:25:50,070 INFO L415 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:50,070 INFO L82 PathProgramCache]: Analyzing trace with hash -177016449, now seen corresponding path program 33 times [2018-07-25 13:25:50,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:50,318 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:50,318 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:50,318 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 13:25:50,318 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 13:25:50,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 13:25:50,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:25:50,320 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2018-07-25 13:25:51,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:51,058 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2018-07-25 13:25:51,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 13:25:51,058 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-07-25 13:25:51,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:51,059 INFO L225 Difference]: With dead ends: 115 [2018-07-25 13:25:51,059 INFO L226 Difference]: Without dead ends: 77 [2018-07-25 13:25:51,061 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=3116, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:25:51,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-25 13:25:51,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-25 13:25:51,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-25 13:25:51,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-07-25 13:25:51,130 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2018-07-25 13:25:51,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:51,130 INFO L472 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-07-25 13:25:51,130 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 13:25:51,130 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-07-25 13:25:51,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-25 13:25:51,131 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:51,131 INFO L354 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 1, 1, 1, 1] [2018-07-25 13:25:51,132 INFO L415 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:51,132 INFO L82 PathProgramCache]: Analyzing trace with hash -42507335, now seen corresponding path program 34 times [2018-07-25 13:25:51,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:51,214 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 306 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:51,215 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:51,215 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 13:25:51,215 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 13:25:51,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 13:25:51,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:25:51,216 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 22 states. [2018-07-25 13:25:51,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:51,361 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2018-07-25 13:25:51,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 13:25:51,362 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 76 [2018-07-25 13:25:51,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:51,363 INFO L225 Difference]: With dead ends: 81 [2018-07-25 13:25:51,363 INFO L226 Difference]: Without dead ends: 79 [2018-07-25 13:25:51,364 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:25:51,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-25 13:25:51,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-25 13:25:51,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-25 13:25:51,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-07-25 13:25:51,433 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2018-07-25 13:25:51,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:51,433 INFO L472 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-07-25 13:25:51,434 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 13:25:51,434 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-07-25 13:25:51,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-25 13:25:51,434 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:51,435 INFO L354 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1, 1, 1] [2018-07-25 13:25:51,435 INFO L415 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:51,435 INFO L82 PathProgramCache]: Analyzing trace with hash 2100176371, now seen corresponding path program 35 times [2018-07-25 13:25:51,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:51,713 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 684 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:51,714 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:51,714 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 13:25:51,714 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 13:25:51,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 13:25:51,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:25:51,719 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2018-07-25 13:25:52,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:52,528 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2018-07-25 13:25:52,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 13:25:52,528 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-07-25 13:25:52,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:52,529 INFO L225 Difference]: With dead ends: 121 [2018-07-25 13:25:52,529 INFO L226 Difference]: Without dead ends: 81 [2018-07-25 13:25:52,532 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=3460, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:25:52,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-25 13:25:52,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-25 13:25:52,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-25 13:25:52,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-07-25 13:25:52,607 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2018-07-25 13:25:52,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:52,608 INFO L472 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-07-25 13:25:52,608 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 13:25:52,608 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-07-25 13:25:52,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-25 13:25:52,609 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:52,609 INFO L354 BasicCegarLoop]: trace histogram [20, 19, 19, 18, 1, 1, 1, 1] [2018-07-25 13:25:52,609 INFO L415 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:52,611 INFO L82 PathProgramCache]: Analyzing trace with hash 752544557, now seen corresponding path program 36 times [2018-07-25 13:25:52,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:52,710 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 342 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:52,711 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:52,711 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 13:25:52,711 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 13:25:52,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 13:25:52,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=272, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:25:52,712 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 23 states. [2018-07-25 13:25:52,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:52,886 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2018-07-25 13:25:52,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 13:25:52,887 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 80 [2018-07-25 13:25:52,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:52,888 INFO L225 Difference]: With dead ends: 85 [2018-07-25 13:25:52,888 INFO L226 Difference]: Without dead ends: 83 [2018-07-25 13:25:52,891 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:25:52,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-25 13:25:52,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-25 13:25:52,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 13:25:52,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-07-25 13:25:52,980 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2018-07-25 13:25:52,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:52,980 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-07-25 13:25:52,981 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 13:25:52,981 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-07-25 13:25:52,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-25 13:25:52,982 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:52,982 INFO L354 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1] [2018-07-25 13:25:52,982 INFO L415 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:52,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1640865895, now seen corresponding path program 37 times [2018-07-25 13:25:52,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:53,306 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:53,306 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:53,306 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 13:25:53,307 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 13:25:53,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 13:25:53,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:25:53,308 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2018-07-25 13:25:54,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:54,138 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2018-07-25 13:25:54,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-25 13:25:54,138 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-07-25 13:25:54,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:54,139 INFO L225 Difference]: With dead ends: 127 [2018-07-25 13:25:54,139 INFO L226 Difference]: Without dead ends: 85 [2018-07-25 13:25:54,142 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=3822, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:25:54,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-25 13:25:54,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-25 13:25:54,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 13:25:54,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-07-25 13:25:54,213 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2018-07-25 13:25:54,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:54,213 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-07-25 13:25:54,213 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 13:25:54,214 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-07-25 13:25:54,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-25 13:25:54,214 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:54,214 INFO L354 BasicCegarLoop]: trace histogram [21, 20, 20, 19, 1, 1, 1, 1] [2018-07-25 13:25:54,215 INFO L415 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:54,215 INFO L82 PathProgramCache]: Analyzing trace with hash 918632609, now seen corresponding path program 38 times [2018-07-25 13:25:54,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:54,298 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 380 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:54,298 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:54,298 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 13:25:54,299 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 13:25:54,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 13:25:54,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:25:54,300 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 24 states. [2018-07-25 13:25:54,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:54,450 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2018-07-25 13:25:54,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-25 13:25:54,450 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 84 [2018-07-25 13:25:54,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:54,451 INFO L225 Difference]: With dead ends: 89 [2018-07-25 13:25:54,451 INFO L226 Difference]: Without dead ends: 87 [2018-07-25 13:25:54,452 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:25:54,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-25 13:25:54,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-25 13:25:54,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 13:25:54,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-07-25 13:25:54,529 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2018-07-25 13:25:54,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:54,529 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-07-25 13:25:54,529 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 13:25:54,529 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-07-25 13:25:54,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-25 13:25:54,530 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:54,530 INFO L354 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1, 1, 1] [2018-07-25 13:25:54,531 INFO L415 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:54,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1957273381, now seen corresponding path program 39 times [2018-07-25 13:25:54,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:54,851 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:54,851 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:54,852 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 13:25:54,852 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 13:25:54,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 13:25:54,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:25:54,853 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2018-07-25 13:25:55,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:55,718 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2018-07-25 13:25:55,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 13:25:55,718 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-07-25 13:25:55,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:55,719 INFO L225 Difference]: With dead ends: 133 [2018-07-25 13:25:55,719 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 13:25:55,721 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=220, Invalid=4202, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:25:55,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 13:25:55,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-25 13:25:55,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 13:25:55,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-07-25 13:25:55,800 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2018-07-25 13:25:55,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:55,800 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-07-25 13:25:55,801 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 13:25:55,801 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-07-25 13:25:55,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-25 13:25:55,801 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:55,802 INFO L354 BasicCegarLoop]: trace histogram [22, 21, 21, 20, 1, 1, 1, 1] [2018-07-25 13:25:55,802 INFO L415 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:55,802 INFO L82 PathProgramCache]: Analyzing trace with hash 267340821, now seen corresponding path program 40 times [2018-07-25 13:25:55,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:55,894 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 420 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:55,894 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:55,894 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-25 13:25:55,895 INFO L451 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-25 13:25:55,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-25 13:25:55,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=321, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:25:55,895 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 25 states. [2018-07-25 13:25:56,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:56,061 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2018-07-25 13:25:56,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 13:25:56,061 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 88 [2018-07-25 13:25:56,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:56,062 INFO L225 Difference]: With dead ends: 93 [2018-07-25 13:25:56,062 INFO L226 Difference]: Without dead ends: 91 [2018-07-25 13:25:56,063 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:25:56,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-25 13:25:56,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-25 13:25:56,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-25 13:25:56,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-07-25 13:25:56,142 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2018-07-25 13:25:56,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:56,142 INFO L472 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-07-25 13:25:56,143 INFO L473 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-25 13:25:56,143 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-07-25 13:25:56,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-25 13:25:56,144 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:56,144 INFO L354 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1] [2018-07-25 13:25:56,144 INFO L415 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:56,144 INFO L82 PathProgramCache]: Analyzing trace with hash -783456433, now seen corresponding path program 41 times [2018-07-25 13:25:56,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:56,461 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:56,461 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:56,462 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-25 13:25:56,462 INFO L451 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-25 13:25:56,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-25 13:25:56,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:25:56,463 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2018-07-25 13:25:57,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:57,326 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2018-07-25 13:25:57,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-25 13:25:57,326 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-07-25 13:25:57,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:57,327 INFO L225 Difference]: With dead ends: 139 [2018-07-25 13:25:57,327 INFO L226 Difference]: Without dead ends: 93 [2018-07-25 13:25:57,328 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=4600, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:25:57,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-25 13:25:57,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-25 13:25:57,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-25 13:25:57,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-07-25 13:25:57,402 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2018-07-25 13:25:57,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:57,402 INFO L472 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-07-25 13:25:57,403 INFO L473 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-25 13:25:57,403 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-07-25 13:25:57,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-25 13:25:57,403 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:57,404 INFO L354 BasicCegarLoop]: trace histogram [23, 22, 22, 21, 1, 1, 1, 1] [2018-07-25 13:25:57,404 INFO L415 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:57,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1017783689, now seen corresponding path program 42 times [2018-07-25 13:25:57,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:57,487 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 462 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:57,488 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:57,488 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 13:25:57,488 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 13:25:57,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 13:25:57,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:25:57,489 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 26 states. [2018-07-25 13:25:57,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:57,647 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-07-25 13:25:57,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-25 13:25:57,647 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 92 [2018-07-25 13:25:57,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:57,648 INFO L225 Difference]: With dead ends: 97 [2018-07-25 13:25:57,648 INFO L226 Difference]: Without dead ends: 95 [2018-07-25 13:25:57,649 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:25:57,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-25 13:25:57,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-25 13:25:57,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-25 13:25:57,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-07-25 13:25:57,729 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2018-07-25 13:25:57,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:57,729 INFO L472 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-07-25 13:25:57,729 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 13:25:57,729 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-07-25 13:25:57,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-25 13:25:57,730 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:57,730 INFO L354 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1, 1, 1] [2018-07-25 13:25:57,730 INFO L415 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:57,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1162366013, now seen corresponding path program 43 times [2018-07-25 13:25:57,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:58,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 1012 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:58,050 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:58,050 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-25 13:25:58,051 INFO L451 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-25 13:25:58,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-25 13:25:58,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:25:58,052 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2018-07-25 13:25:58,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:58,939 INFO L93 Difference]: Finished difference Result 145 states and 147 transitions. [2018-07-25 13:25:58,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-25 13:25:58,939 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-07-25 13:25:58,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:58,940 INFO L225 Difference]: With dead ends: 145 [2018-07-25 13:25:58,940 INFO L226 Difference]: Without dead ends: 97 [2018-07-25 13:25:58,942 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=240, Invalid=5016, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:25:58,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-25 13:25:59,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-25 13:25:59,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-25 13:25:59,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-07-25 13:25:59,017 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2018-07-25 13:25:59,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:59,018 INFO L472 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-07-25 13:25:59,018 INFO L473 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-25 13:25:59,018 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-07-25 13:25:59,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-25 13:25:59,019 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:59,019 INFO L354 BasicCegarLoop]: trace histogram [24, 23, 23, 22, 1, 1, 1, 1] [2018-07-25 13:25:59,019 INFO L415 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:59,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1867070211, now seen corresponding path program 44 times [2018-07-25 13:25:59,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:59,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 506 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:59,113 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:59,113 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-25 13:25:59,113 INFO L451 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-25 13:25:59,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-25 13:25:59,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=374, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:25:59,114 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 27 states. [2018-07-25 13:25:59,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:59,285 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2018-07-25 13:25:59,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-25 13:25:59,285 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 96 [2018-07-25 13:25:59,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:59,286 INFO L225 Difference]: With dead ends: 101 [2018-07-25 13:25:59,286 INFO L226 Difference]: Without dead ends: 99 [2018-07-25 13:25:59,287 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 13:25:59,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-25 13:25:59,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-25 13:25:59,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-25 13:25:59,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-07-25 13:25:59,381 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-07-25 13:25:59,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:59,382 INFO L472 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-07-25 13:25:59,382 INFO L473 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-25 13:25:59,382 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-07-25 13:25:59,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-25 13:25:59,383 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:59,383 INFO L354 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1] [2018-07-25 13:25:59,383 INFO L415 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:59,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1041909303, now seen corresponding path program 45 times [2018-07-25 13:25:59,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:59,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 1104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:59,703 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:59,703 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-25 13:25:59,704 INFO L451 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-25 13:25:59,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-25 13:25:59,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 13:25:59,705 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2018-07-25 13:26:00,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:00,744 INFO L93 Difference]: Finished difference Result 151 states and 153 transitions. [2018-07-25 13:26:00,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-25 13:26:00,745 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-07-25 13:26:00,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:00,745 INFO L225 Difference]: With dead ends: 151 [2018-07-25 13:26:00,746 INFO L226 Difference]: Without dead ends: 101 [2018-07-25 13:26:00,747 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=250, Invalid=5450, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:26:00,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-25 13:26:00,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-25 13:26:00,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-25 13:26:00,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2018-07-25 13:26:00,827 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2018-07-25 13:26:00,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:00,828 INFO L472 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2018-07-25 13:26:00,828 INFO L473 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-25 13:26:00,828 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2018-07-25 13:26:00,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-25 13:26:00,829 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:00,829 INFO L354 BasicCegarLoop]: trace histogram [25, 24, 24, 23, 1, 1, 1, 1] [2018-07-25 13:26:00,829 INFO L415 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:00,830 INFO L82 PathProgramCache]: Analyzing trace with hash -279303567, now seen corresponding path program 46 times [2018-07-25 13:26:00,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:00,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 552 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:00,923 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:00,924 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 13:26:00,924 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 13:26:00,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 13:26:00,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=402, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:26:00,925 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 28 states. [2018-07-25 13:26:01,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:01,096 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2018-07-25 13:26:01,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-25 13:26:01,096 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 100 [2018-07-25 13:26:01,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:01,097 INFO L225 Difference]: With dead ends: 105 [2018-07-25 13:26:01,097 INFO L226 Difference]: Without dead ends: 103 [2018-07-25 13:26:01,099 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:26:01,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-25 13:26:01,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-25 13:26:01,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-25 13:26:01,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-07-25 13:26:01,190 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2018-07-25 13:26:01,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:01,190 INFO L472 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-07-25 13:26:01,190 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 13:26:01,190 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-07-25 13:26:01,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-25 13:26:01,192 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:01,192 INFO L354 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1, 1, 1] [2018-07-25 13:26:01,192 INFO L415 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:01,193 INFO L82 PathProgramCache]: Analyzing trace with hash -2122703189, now seen corresponding path program 47 times [2018-07-25 13:26:01,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:01,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 1200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:01,501 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:01,501 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-25 13:26:01,502 INFO L451 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-25 13:26:01,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-25 13:26:01,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:26:01,503 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2018-07-25 13:26:02,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:02,483 INFO L93 Difference]: Finished difference Result 157 states and 159 transitions. [2018-07-25 13:26:02,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-25 13:26:02,483 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-07-25 13:26:02,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:02,484 INFO L225 Difference]: With dead ends: 157 [2018-07-25 13:26:02,484 INFO L226 Difference]: Without dead ends: 105 [2018-07-25 13:26:02,486 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=260, Invalid=5902, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:26:02,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-25 13:26:02,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-25 13:26:02,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-25 13:26:02,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-07-25 13:26:02,583 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2018-07-25 13:26:02,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:02,583 INFO L472 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-07-25 13:26:02,584 INFO L473 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-25 13:26:02,584 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-07-25 13:26:02,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-25 13:26:02,585 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:02,585 INFO L354 BasicCegarLoop]: trace histogram [26, 25, 25, 24, 1, 1, 1, 1] [2018-07-25 13:26:02,586 INFO L415 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:02,586 INFO L82 PathProgramCache]: Analyzing trace with hash 190404069, now seen corresponding path program 48 times [2018-07-25 13:26:02,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:02,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 600 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:02,687 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:02,687 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-25 13:26:02,688 INFO L451 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-25 13:26:02,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-25 13:26:02,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=431, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:26:02,689 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 29 states. [2018-07-25 13:26:02,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:02,881 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2018-07-25 13:26:02,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-25 13:26:02,881 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 104 [2018-07-25 13:26:02,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:02,882 INFO L225 Difference]: With dead ends: 109 [2018-07-25 13:26:02,882 INFO L226 Difference]: Without dead ends: 107 [2018-07-25 13:26:02,883 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:26:02,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-25 13:26:02,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-07-25 13:26:02,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-25 13:26:02,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-07-25 13:26:02,982 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2018-07-25 13:26:02,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:02,982 INFO L472 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-07-25 13:26:02,982 INFO L473 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-25 13:26:02,982 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-07-25 13:26:02,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-25 13:26:02,983 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:02,983 INFO L354 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1, 1, 1] [2018-07-25 13:26:02,984 INFO L415 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:02,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1705231073, now seen corresponding path program 49 times [2018-07-25 13:26:02,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:03,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 1300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:03,304 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:03,305 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-25 13:26:03,305 INFO L451 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-25 13:26:03,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-25 13:26:03,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:26:03,307 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2018-07-25 13:26:04,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:04,332 INFO L93 Difference]: Finished difference Result 163 states and 165 transitions. [2018-07-25 13:26:04,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-25 13:26:04,333 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-07-25 13:26:04,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:04,334 INFO L225 Difference]: With dead ends: 163 [2018-07-25 13:26:04,334 INFO L226 Difference]: Without dead ends: 109 [2018-07-25 13:26:04,335 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=270, Invalid=6372, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 13:26:04,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-25 13:26:04,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-07-25 13:26:04,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-25 13:26:04,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-07-25 13:26:04,435 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2018-07-25 13:26:04,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:04,435 INFO L472 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-07-25 13:26:04,436 INFO L473 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-25 13:26:04,436 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-07-25 13:26:04,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-25 13:26:04,437 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:04,437 INFO L354 BasicCegarLoop]: trace histogram [27, 26, 26, 25, 1, 1, 1, 1] [2018-07-25 13:26:04,437 INFO L415 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:04,437 INFO L82 PathProgramCache]: Analyzing trace with hash 653870937, now seen corresponding path program 50 times [2018-07-25 13:26:04,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:04,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:04,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 650 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:04,530 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:04,530 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 13:26:04,530 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 13:26:04,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 13:26:04,531 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:26:04,531 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 30 states. [2018-07-25 13:26:04,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:04,738 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2018-07-25 13:26:04,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-25 13:26:04,739 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 108 [2018-07-25 13:26:04,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:04,740 INFO L225 Difference]: With dead ends: 113 [2018-07-25 13:26:04,740 INFO L226 Difference]: Without dead ends: 111 [2018-07-25 13:26:04,741 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:26:04,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-25 13:26:04,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-07-25 13:26:04,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-25 13:26:04,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-07-25 13:26:04,861 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2018-07-25 13:26:04,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:04,861 INFO L472 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-07-25 13:26:04,861 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 13:26:04,861 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-07-25 13:26:04,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-25 13:26:04,862 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:04,862 INFO L354 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1, 1, 1] [2018-07-25 13:26:04,863 INFO L415 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:04,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1304797587, now seen corresponding path program 51 times [2018-07-25 13:26:04,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:05,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 1404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:05,210 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:05,210 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-25 13:26:05,211 INFO L451 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-25 13:26:05,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-25 13:26:05,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:26:05,212 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2018-07-25 13:26:06,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:06,284 INFO L93 Difference]: Finished difference Result 169 states and 171 transitions. [2018-07-25 13:26:06,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-25 13:26:06,284 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-07-25 13:26:06,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:06,285 INFO L225 Difference]: With dead ends: 169 [2018-07-25 13:26:06,286 INFO L226 Difference]: Without dead ends: 113 [2018-07-25 13:26:06,287 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=280, Invalid=6860, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:26:06,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-25 13:26:06,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-07-25 13:26:06,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-25 13:26:06,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-07-25 13:26:06,387 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2018-07-25 13:26:06,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:06,387 INFO L472 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-07-25 13:26:06,387 INFO L473 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-25 13:26:06,387 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-07-25 13:26:06,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-25 13:26:06,388 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:06,388 INFO L354 BasicCegarLoop]: trace histogram [28, 27, 27, 26, 1, 1, 1, 1] [2018-07-25 13:26:06,389 INFO L415 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:06,389 INFO L82 PathProgramCache]: Analyzing trace with hash -738263347, now seen corresponding path program 52 times [2018-07-25 13:26:06,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:06,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 702 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:06,487 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:06,487 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-25 13:26:06,487 INFO L451 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-25 13:26:06,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-25 13:26:06,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=492, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:26:06,488 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 31 states. [2018-07-25 13:26:06,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:06,693 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-07-25 13:26:06,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-25 13:26:06,693 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 112 [2018-07-25 13:26:06,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:06,694 INFO L225 Difference]: With dead ends: 117 [2018-07-25 13:26:06,694 INFO L226 Difference]: Without dead ends: 115 [2018-07-25 13:26:06,695 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:26:06,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-25 13:26:06,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-07-25 13:26:06,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-25 13:26:06,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-07-25 13:26:06,816 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2018-07-25 13:26:06,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:06,816 INFO L472 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-07-25 13:26:06,817 INFO L473 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-25 13:26:06,817 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-07-25 13:26:06,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-25 13:26:06,818 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:06,818 INFO L354 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1, 1, 1] [2018-07-25 13:26:06,818 INFO L415 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:06,818 INFO L82 PathProgramCache]: Analyzing trace with hash -801420281, now seen corresponding path program 53 times [2018-07-25 13:26:06,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:07,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 1512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:07,221 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:07,221 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-25 13:26:07,221 INFO L451 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-25 13:26:07,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-25 13:26:07,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:26:07,223 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2018-07-25 13:26:08,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:08,430 INFO L93 Difference]: Finished difference Result 175 states and 177 transitions. [2018-07-25 13:26:08,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-25 13:26:08,431 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-07-25 13:26:08,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:08,432 INFO L225 Difference]: With dead ends: 175 [2018-07-25 13:26:08,432 INFO L226 Difference]: Without dead ends: 117 [2018-07-25 13:26:08,433 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=290, Invalid=7366, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 13:26:08,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-07-25 13:26:08,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-07-25 13:26:08,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-25 13:26:08,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-07-25 13:26:08,536 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2018-07-25 13:26:08,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:08,536 INFO L472 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-07-25 13:26:08,537 INFO L473 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-25 13:26:08,537 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-07-25 13:26:08,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-25 13:26:08,538 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:08,538 INFO L354 BasicCegarLoop]: trace histogram [29, 28, 28, 27, 1, 1, 1, 1] [2018-07-25 13:26:08,538 INFO L415 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:08,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1280345023, now seen corresponding path program 54 times [2018-07-25 13:26:08,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:08,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 756 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:08,639 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:08,640 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 13:26:08,640 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 13:26:08,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 13:26:08,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=524, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:26:08,641 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 32 states. [2018-07-25 13:26:08,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:08,836 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2018-07-25 13:26:08,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-25 13:26:08,836 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 116 [2018-07-25 13:26:08,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:08,837 INFO L225 Difference]: With dead ends: 121 [2018-07-25 13:26:08,837 INFO L226 Difference]: Without dead ends: 119 [2018-07-25 13:26:08,838 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 13:26:08,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-25 13:26:08,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-25 13:26:08,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-25 13:26:08,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-07-25 13:26:08,942 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2018-07-25 13:26:08,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:08,943 INFO L472 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-07-25 13:26:08,943 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 13:26:08,943 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-07-25 13:26:08,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-25 13:26:08,944 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:08,944 INFO L354 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1, 1, 1] [2018-07-25 13:26:08,944 INFO L415 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:08,945 INFO L82 PathProgramCache]: Analyzing trace with hash -2050868101, now seen corresponding path program 55 times [2018-07-25 13:26:08,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:09,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 1624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:09,288 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:09,288 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-25 13:26:09,289 INFO L451 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-25 13:26:09,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-25 13:26:09,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 13:26:09,290 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2018-07-25 13:26:10,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:10,428 INFO L93 Difference]: Finished difference Result 181 states and 183 transitions. [2018-07-25 13:26:10,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 13:26:10,429 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-07-25 13:26:10,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:10,430 INFO L225 Difference]: With dead ends: 181 [2018-07-25 13:26:10,430 INFO L226 Difference]: Without dead ends: 121 [2018-07-25 13:26:10,431 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=7890, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:26:10,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-25 13:26:10,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-07-25 13:26:10,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 13:26:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-07-25 13:26:10,554 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2018-07-25 13:26:10,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:10,554 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-07-25 13:26:10,554 INFO L473 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-25 13:26:10,554 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-07-25 13:26:10,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-25 13:26:10,555 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:10,555 INFO L354 BasicCegarLoop]: trace histogram [30, 29, 29, 28, 1, 1, 1, 1] [2018-07-25 13:26:10,556 INFO L415 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:10,556 INFO L82 PathProgramCache]: Analyzing trace with hash 919584693, now seen corresponding path program 56 times [2018-07-25 13:26:10,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:10,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 812 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:10,659 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:10,659 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-25 13:26:10,660 INFO L451 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-25 13:26:10,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-25 13:26:10,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=557, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:26:10,661 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 33 states. [2018-07-25 13:26:10,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:10,873 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2018-07-25 13:26:10,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 13:26:10,873 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 120 [2018-07-25 13:26:10,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:10,874 INFO L225 Difference]: With dead ends: 125 [2018-07-25 13:26:10,874 INFO L226 Difference]: Without dead ends: 123 [2018-07-25 13:26:10,875 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:26:10,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-25 13:26:10,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-07-25 13:26:10,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-07-25 13:26:10,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-07-25 13:26:10,991 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2018-07-25 13:26:10,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:10,992 INFO L472 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-07-25 13:26:10,992 INFO L473 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-25 13:26:10,992 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-07-25 13:26:10,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-25 13:26:10,993 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:10,993 INFO L354 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1, 1, 1] [2018-07-25 13:26:10,993 INFO L415 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:10,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1042320657, now seen corresponding path program 57 times [2018-07-25 13:26:10,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:11,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 1740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:11,361 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:11,362 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-25 13:26:11,362 INFO L451 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-25 13:26:11,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-25 13:26:11,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:26:11,363 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2018-07-25 13:26:12,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:12,527 INFO L93 Difference]: Finished difference Result 187 states and 189 transitions. [2018-07-25 13:26:12,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-25 13:26:12,527 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-07-25 13:26:12,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:12,528 INFO L225 Difference]: With dead ends: 187 [2018-07-25 13:26:12,528 INFO L226 Difference]: Without dead ends: 125 [2018-07-25 13:26:12,529 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=310, Invalid=8432, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 13:26:12,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-25 13:26:12,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-07-25 13:26:12,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-25 13:26:12,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-07-25 13:26:12,645 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2018-07-25 13:26:12,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:12,645 INFO L472 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-07-25 13:26:12,645 INFO L473 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-25 13:26:12,645 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-07-25 13:26:12,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-25 13:26:12,646 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:12,647 INFO L354 BasicCegarLoop]: trace histogram [31, 30, 30, 29, 1, 1, 1, 1] [2018-07-25 13:26:12,647 INFO L415 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:12,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1571080489, now seen corresponding path program 58 times [2018-07-25 13:26:12,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:12,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 870 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:12,748 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:12,748 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 13:26:12,749 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 13:26:12,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 13:26:12,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=591, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:26:12,750 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 34 states. [2018-07-25 13:26:12,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:12,983 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2018-07-25 13:26:12,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-25 13:26:12,984 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 124 [2018-07-25 13:26:12,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:12,985 INFO L225 Difference]: With dead ends: 129 [2018-07-25 13:26:12,985 INFO L226 Difference]: Without dead ends: 127 [2018-07-25 13:26:12,986 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:26:12,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-25 13:26:13,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-07-25 13:26:13,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-25 13:26:13,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-07-25 13:26:13,138 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2018-07-25 13:26:13,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:13,139 INFO L472 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-07-25 13:26:13,139 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 13:26:13,139 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-07-25 13:26:13,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-25 13:26:13,140 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:13,140 INFO L354 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1, 1, 1] [2018-07-25 13:26:13,140 INFO L415 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:13,141 INFO L82 PathProgramCache]: Analyzing trace with hash -2020085917, now seen corresponding path program 59 times [2018-07-25 13:26:13,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:13,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:13,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 1860 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:13,541 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:13,541 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-25 13:26:13,542 INFO L451 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-25 13:26:13,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-25 13:26:13,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:26:13,543 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2018-07-25 13:26:14,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:14,821 INFO L93 Difference]: Finished difference Result 193 states and 195 transitions. [2018-07-25 13:26:14,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-25 13:26:14,821 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-07-25 13:26:14,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:14,823 INFO L225 Difference]: With dead ends: 193 [2018-07-25 13:26:14,823 INFO L226 Difference]: Without dead ends: 129 [2018-07-25 13:26:14,824 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=320, Invalid=8992, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:26:14,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-25 13:26:14,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-07-25 13:26:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-25 13:26:14,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-07-25 13:26:14,962 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2018-07-25 13:26:14,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:14,962 INFO L472 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-07-25 13:26:14,962 INFO L473 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-25 13:26:14,963 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-07-25 13:26:14,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-25 13:26:14,964 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:14,964 INFO L354 BasicCegarLoop]: trace histogram [32, 31, 31, 30, 1, 1, 1, 1] [2018-07-25 13:26:14,964 INFO L415 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:14,964 INFO L82 PathProgramCache]: Analyzing trace with hash 2012453021, now seen corresponding path program 60 times [2018-07-25 13:26:14,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:15,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 930 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:15,102 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:15,102 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-25 13:26:15,103 INFO L451 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-25 13:26:15,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-25 13:26:15,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=626, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:26:15,104 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 35 states. [2018-07-25 13:26:15,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:15,408 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2018-07-25 13:26:15,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-25 13:26:15,408 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 128 [2018-07-25 13:26:15,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:15,409 INFO L225 Difference]: With dead ends: 133 [2018-07-25 13:26:15,409 INFO L226 Difference]: Without dead ends: 131 [2018-07-25 13:26:15,410 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:26:15,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-25 13:26:15,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-07-25 13:26:15,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-25 13:26:15,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-07-25 13:26:15,563 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2018-07-25 13:26:15,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:15,564 INFO L472 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-07-25 13:26:15,564 INFO L473 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-25 13:26:15,564 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-07-25 13:26:15,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-25 13:26:15,565 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:15,565 INFO L354 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1, 1, 1] [2018-07-25 13:26:15,565 INFO L415 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:15,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1232122327, now seen corresponding path program 61 times [2018-07-25 13:26:15,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:15,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 1984 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:15,978 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:15,979 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-25 13:26:15,979 INFO L451 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-25 13:26:15,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-25 13:26:15,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:26:15,983 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2018-07-25 13:26:17,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:17,288 INFO L93 Difference]: Finished difference Result 199 states and 201 transitions. [2018-07-25 13:26:17,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-25 13:26:17,288 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-07-25 13:26:17,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:17,289 INFO L225 Difference]: With dead ends: 199 [2018-07-25 13:26:17,289 INFO L226 Difference]: Without dead ends: 133 [2018-07-25 13:26:17,292 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=330, Invalid=9570, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 13:26:17,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-25 13:26:17,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-07-25 13:26:17,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-25 13:26:17,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-07-25 13:26:17,425 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2018-07-25 13:26:17,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:17,426 INFO L472 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-07-25 13:26:17,426 INFO L473 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-25 13:26:17,426 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-07-25 13:26:17,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-25 13:26:17,435 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:17,436 INFO L354 BasicCegarLoop]: trace histogram [33, 32, 32, 31, 1, 1, 1, 1] [2018-07-25 13:26:17,436 INFO L415 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:17,436 INFO L82 PathProgramCache]: Analyzing trace with hash -452907503, now seen corresponding path program 62 times [2018-07-25 13:26:17,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:17,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 992 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:17,553 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:17,554 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 13:26:17,554 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 13:26:17,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 13:26:17,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=662, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:26:17,555 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 36 states. [2018-07-25 13:26:17,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:17,792 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2018-07-25 13:26:17,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-25 13:26:17,792 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 132 [2018-07-25 13:26:17,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:17,794 INFO L225 Difference]: With dead ends: 137 [2018-07-25 13:26:17,794 INFO L226 Difference]: Without dead ends: 135 [2018-07-25 13:26:17,795 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 13:26:17,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-25 13:26:17,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-07-25 13:26:17,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-07-25 13:26:17,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-07-25 13:26:17,897 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2018-07-25 13:26:17,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:17,898 INFO L472 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-07-25 13:26:17,898 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 13:26:17,898 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-07-25 13:26:17,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-25 13:26:17,899 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:17,899 INFO L354 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1, 1, 1] [2018-07-25 13:26:17,900 INFO L415 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:17,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1452361141, now seen corresponding path program 63 times [2018-07-25 13:26:17,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:18,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 2112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:18,256 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:18,256 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-25 13:26:18,257 INFO L451 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-25 13:26:18,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-25 13:26:18,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 13:26:18,258 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2018-07-25 13:26:19,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:19,399 INFO L93 Difference]: Finished difference Result 205 states and 207 transitions. [2018-07-25 13:26:19,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-25 13:26:19,399 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-07-25 13:26:19,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:19,400 INFO L225 Difference]: With dead ends: 205 [2018-07-25 13:26:19,400 INFO L226 Difference]: Without dead ends: 137 [2018-07-25 13:26:19,401 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=340, Invalid=10166, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 13:26:19,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-25 13:26:19,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-07-25 13:26:19,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-25 13:26:19,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-07-25 13:26:19,538 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2018-07-25 13:26:19,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:19,538 INFO L472 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-07-25 13:26:19,538 INFO L473 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-25 13:26:19,538 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-07-25 13:26:19,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-25 13:26:19,539 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:19,539 INFO L354 BasicCegarLoop]: trace histogram [34, 33, 33, 32, 1, 1, 1, 1] [2018-07-25 13:26:19,540 INFO L415 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:19,540 INFO L82 PathProgramCache]: Analyzing trace with hash -745371259, now seen corresponding path program 64 times [2018-07-25 13:26:19,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:19,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 1056 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:19,649 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:19,649 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-25 13:26:19,650 INFO L451 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-25 13:26:19,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-25 13:26:19,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=633, Invalid=699, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:26:19,651 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 37 states. [2018-07-25 13:26:19,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:19,925 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2018-07-25 13:26:19,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-25 13:26:19,926 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 136 [2018-07-25 13:26:19,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:19,927 INFO L225 Difference]: With dead ends: 141 [2018-07-25 13:26:19,927 INFO L226 Difference]: Without dead ends: 139 [2018-07-25 13:26:19,928 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:26:19,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-25 13:26:20,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-07-25 13:26:20,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-07-25 13:26:20,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-07-25 13:26:20,104 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2018-07-25 13:26:20,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:20,105 INFO L472 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-07-25 13:26:20,105 INFO L473 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-25 13:26:20,105 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-07-25 13:26:20,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-25 13:26:20,106 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:20,106 INFO L354 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1, 1, 1] [2018-07-25 13:26:20,106 INFO L415 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:20,106 INFO L82 PathProgramCache]: Analyzing trace with hash 957810879, now seen corresponding path program 65 times [2018-07-25 13:26:20,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 2244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:20,537 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:20,537 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-25 13:26:20,537 INFO L451 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-25 13:26:20,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-25 13:26:20,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:26:20,538 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2018-07-25 13:26:21,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:21,841 INFO L93 Difference]: Finished difference Result 211 states and 213 transitions. [2018-07-25 13:26:21,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-25 13:26:21,841 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-07-25 13:26:21,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:21,842 INFO L225 Difference]: With dead ends: 211 [2018-07-25 13:26:21,843 INFO L226 Difference]: Without dead ends: 141 [2018-07-25 13:26:21,844 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=350, Invalid=10780, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 13:26:21,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-25 13:26:21,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-07-25 13:26:21,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-25 13:26:21,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-07-25 13:26:21,973 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2018-07-25 13:26:21,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:21,974 INFO L472 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-07-25 13:26:21,974 INFO L473 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-25 13:26:21,974 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-07-25 13:26:21,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-25 13:26:21,974 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:21,975 INFO L354 BasicCegarLoop]: trace histogram [35, 34, 34, 33, 1, 1, 1, 1] [2018-07-25 13:26:21,975 INFO L415 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:21,975 INFO L82 PathProgramCache]: Analyzing trace with hash 32287481, now seen corresponding path program 66 times [2018-07-25 13:26:21,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:22,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 1122 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:22,091 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:22,091 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 13:26:22,091 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 13:26:22,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 13:26:22,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:26:22,092 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 38 states. [2018-07-25 13:26:22,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:22,299 INFO L93 Difference]: Finished difference Result 145 states and 146 transitions. [2018-07-25 13:26:22,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-25 13:26:22,300 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 140 [2018-07-25 13:26:22,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:22,301 INFO L225 Difference]: With dead ends: 145 [2018-07-25 13:26:22,301 INFO L226 Difference]: Without dead ends: 143 [2018-07-25 13:26:22,301 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:26:22,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-25 13:26:22,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-07-25 13:26:22,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-25 13:26:22,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-07-25 13:26:22,437 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2018-07-25 13:26:22,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:22,437 INFO L472 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-07-25 13:26:22,437 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 13:26:22,437 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-07-25 13:26:22,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-25 13:26:22,438 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:22,438 INFO L354 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1, 1, 1] [2018-07-25 13:26:22,438 INFO L415 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:22,438 INFO L82 PathProgramCache]: Analyzing trace with hash 963550515, now seen corresponding path program 67 times [2018-07-25 13:26:22,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:22,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:22,985 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:22,986 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-25 13:26:22,986 INFO L451 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-25 13:26:22,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-25 13:26:22,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:26:22,991 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2018-07-25 13:26:24,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:24,523 INFO L93 Difference]: Finished difference Result 217 states and 219 transitions. [2018-07-25 13:26:24,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-25 13:26:24,524 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-07-25 13:26:24,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:24,524 INFO L225 Difference]: With dead ends: 217 [2018-07-25 13:26:24,525 INFO L226 Difference]: Without dead ends: 145 [2018-07-25 13:26:24,526 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=360, Invalid=11412, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 13:26:24,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-25 13:26:24,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-07-25 13:26:24,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-25 13:26:24,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-07-25 13:26:24,652 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2018-07-25 13:26:24,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:24,652 INFO L472 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-07-25 13:26:24,652 INFO L473 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-25 13:26:24,652 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-07-25 13:26:24,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-25 13:26:24,653 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:24,654 INFO L354 BasicCegarLoop]: trace histogram [36, 35, 35, 34, 1, 1, 1, 1] [2018-07-25 13:26:24,654 INFO L415 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:24,655 INFO L82 PathProgramCache]: Analyzing trace with hash 2111083117, now seen corresponding path program 68 times [2018-07-25 13:26:24,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:24,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 1190 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:24,779 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:24,780 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-25 13:26:24,780 INFO L451 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-25 13:26:24,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-25 13:26:24,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=776, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:26:24,781 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 39 states. [2018-07-25 13:26:25,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:25,104 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2018-07-25 13:26:25,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-25 13:26:25,104 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 144 [2018-07-25 13:26:25,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:25,108 INFO L225 Difference]: With dead ends: 149 [2018-07-25 13:26:25,108 INFO L226 Difference]: Without dead ends: 147 [2018-07-25 13:26:25,109 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:26:25,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-25 13:26:25,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-07-25 13:26:25,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-25 13:26:25,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-07-25 13:26:25,298 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2018-07-25 13:26:25,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:25,299 INFO L472 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-07-25 13:26:25,299 INFO L473 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-25 13:26:25,299 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-07-25 13:26:25,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-25 13:26:25,300 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:25,300 INFO L354 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1, 1, 1] [2018-07-25 13:26:25,300 INFO L415 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:25,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1526364071, now seen corresponding path program 69 times [2018-07-25 13:26:25,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:25,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 2520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:25,792 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:25,792 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-25 13:26:25,792 INFO L451 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-25 13:26:25,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-25 13:26:25,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:26:25,793 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2018-07-25 13:26:27,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:27,018 INFO L93 Difference]: Finished difference Result 223 states and 225 transitions. [2018-07-25 13:26:27,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-25 13:26:27,019 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-07-25 13:26:27,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:27,020 INFO L225 Difference]: With dead ends: 223 [2018-07-25 13:26:27,020 INFO L226 Difference]: Without dead ends: 149 [2018-07-25 13:26:27,021 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=370, Invalid=12062, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 13:26:27,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-25 13:26:27,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-07-25 13:26:27,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-25 13:26:27,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2018-07-25 13:26:27,134 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2018-07-25 13:26:27,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:27,134 INFO L472 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2018-07-25 13:26:27,134 INFO L473 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-25 13:26:27,134 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2018-07-25 13:26:27,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-25 13:26:27,135 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:27,135 INFO L354 BasicCegarLoop]: trace histogram [37, 36, 36, 35, 1, 1, 1, 1] [2018-07-25 13:26:27,136 INFO L415 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:27,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1687109601, now seen corresponding path program 70 times [2018-07-25 13:26:27,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:27,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 1260 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:27,254 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:27,254 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 13:26:27,254 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 13:26:27,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 13:26:27,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=816, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:26:27,255 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 40 states. [2018-07-25 13:26:27,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:27,559 INFO L93 Difference]: Finished difference Result 153 states and 154 transitions. [2018-07-25 13:26:27,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-25 13:26:27,559 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 148 [2018-07-25 13:26:27,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:27,560 INFO L225 Difference]: With dead ends: 153 [2018-07-25 13:26:27,561 INFO L226 Difference]: Without dead ends: 151 [2018-07-25 13:26:27,561 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1295 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:26:27,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-25 13:26:27,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-07-25 13:26:27,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-25 13:26:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-07-25 13:26:27,737 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2018-07-25 13:26:27,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:27,737 INFO L472 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-07-25 13:26:27,737 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 13:26:27,737 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-07-25 13:26:27,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-25 13:26:27,738 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:27,738 INFO L354 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1, 1, 1] [2018-07-25 13:26:27,739 INFO L415 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:27,739 INFO L82 PathProgramCache]: Analyzing trace with hash 2109708315, now seen corresponding path program 71 times [2018-07-25 13:26:27,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 2664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:28,222 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:28,223 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-25 13:26:28,223 INFO L451 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-25 13:26:28,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-25 13:26:28,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:26:28,224 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2018-07-25 13:26:29,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:29,828 INFO L93 Difference]: Finished difference Result 229 states and 231 transitions. [2018-07-25 13:26:29,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-25 13:26:29,828 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-07-25 13:26:29,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:29,829 INFO L225 Difference]: With dead ends: 229 [2018-07-25 13:26:29,829 INFO L226 Difference]: Without dead ends: 153 [2018-07-25 13:26:29,831 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=380, Invalid=12730, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 13:26:29,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-25 13:26:29,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-07-25 13:26:29,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-25 13:26:29,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-07-25 13:26:29,956 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2018-07-25 13:26:29,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:29,956 INFO L472 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-07-25 13:26:29,956 INFO L473 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-25 13:26:29,956 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-07-25 13:26:29,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-25 13:26:29,957 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:29,957 INFO L354 BasicCegarLoop]: trace histogram [38, 37, 37, 36, 1, 1, 1, 1] [2018-07-25 13:26:29,958 INFO L415 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:29,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1562266795, now seen corresponding path program 72 times [2018-07-25 13:26:29,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:30,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 1332 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:30,087 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:30,087 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-25 13:26:30,087 INFO L451 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-25 13:26:30,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-25 13:26:30,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=857, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:26:30,088 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 41 states. [2018-07-25 13:26:30,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:30,451 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2018-07-25 13:26:30,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-25 13:26:30,452 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 152 [2018-07-25 13:26:30,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:30,453 INFO L225 Difference]: With dead ends: 157 [2018-07-25 13:26:30,453 INFO L226 Difference]: Without dead ends: 155 [2018-07-25 13:26:30,454 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:26:30,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-25 13:26:30,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-25 13:26:30,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-25 13:26:30,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-07-25 13:26:30,709 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2018-07-25 13:26:30,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:30,710 INFO L472 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-07-25 13:26:30,710 INFO L473 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-25 13:26:30,710 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-07-25 13:26:30,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-25 13:26:30,711 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:30,711 INFO L354 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1, 1, 1] [2018-07-25 13:26:30,711 INFO L415 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:30,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1900215951, now seen corresponding path program 73 times [2018-07-25 13:26:30,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:31,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 2812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:31,240 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:31,240 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-25 13:26:31,240 INFO L451 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-25 13:26:31,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-25 13:26:31,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:26:31,241 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2018-07-25 13:26:32,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:32,449 INFO L93 Difference]: Finished difference Result 235 states and 237 transitions. [2018-07-25 13:26:32,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-25 13:26:32,449 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-07-25 13:26:32,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:32,450 INFO L225 Difference]: With dead ends: 235 [2018-07-25 13:26:32,450 INFO L226 Difference]: Without dead ends: 157 [2018-07-25 13:26:32,451 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=390, Invalid=13416, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 13:26:32,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-25 13:26:32,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-07-25 13:26:32,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-07-25 13:26:32,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-07-25 13:26:32,596 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2018-07-25 13:26:32,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:32,596 INFO L472 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-07-25 13:26:32,596 INFO L473 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-25 13:26:32,596 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-07-25 13:26:32,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-25 13:26:32,597 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:32,597 INFO L354 BasicCegarLoop]: trace histogram [39, 38, 38, 37, 1, 1, 1, 1] [2018-07-25 13:26:32,597 INFO L415 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:32,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1257182007, now seen corresponding path program 74 times [2018-07-25 13:26:32,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:32,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2888 backedges. 1406 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:32,703 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:32,703 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 13:26:32,703 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 13:26:32,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 13:26:32,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=899, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:26:32,704 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 42 states. [2018-07-25 13:26:32,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:32,945 INFO L93 Difference]: Finished difference Result 161 states and 162 transitions. [2018-07-25 13:26:32,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-25 13:26:32,946 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 156 [2018-07-25 13:26:32,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:32,947 INFO L225 Difference]: With dead ends: 161 [2018-07-25 13:26:32,947 INFO L226 Difference]: Without dead ends: 159 [2018-07-25 13:26:32,948 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1443 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 13:26:32,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-07-25 13:26:33,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-07-25 13:26:33,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-07-25 13:26:33,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-07-25 13:26:33,080 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2018-07-25 13:26:33,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:33,081 INFO L472 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-07-25 13:26:33,081 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 13:26:33,081 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-07-25 13:26:33,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-25 13:26:33,082 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:33,082 INFO L354 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1, 1, 1] [2018-07-25 13:26:33,082 INFO L415 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:33,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1266046205, now seen corresponding path program 75 times [2018-07-25 13:26:33,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 2964 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:33,547 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:33,547 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-25 13:26:33,548 INFO L451 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-25 13:26:33,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-25 13:26:33,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 13:26:33,549 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2018-07-25 13:26:34,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:34,849 INFO L93 Difference]: Finished difference Result 241 states and 243 transitions. [2018-07-25 13:26:34,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-25 13:26:34,849 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-07-25 13:26:34,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:34,850 INFO L225 Difference]: With dead ends: 241 [2018-07-25 13:26:34,850 INFO L226 Difference]: Without dead ends: 161 [2018-07-25 13:26:34,852 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=400, Invalid=14120, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 13:26:34,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-07-25 13:26:34,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-07-25 13:26:34,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-25 13:26:34,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-07-25 13:26:34,990 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2018-07-25 13:26:34,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:34,990 INFO L472 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-07-25 13:26:34,990 INFO L473 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-25 13:26:34,990 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-07-25 13:26:34,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-25 13:26:34,991 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:34,991 INFO L354 BasicCegarLoop]: trace histogram [40, 39, 39, 38, 1, 1, 1, 1] [2018-07-25 13:26:34,991 INFO L415 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:34,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1726082109, now seen corresponding path program 76 times [2018-07-25 13:26:34,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:35,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 1482 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:35,092 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:35,092 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-25 13:26:35,092 INFO L451 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-25 13:26:35,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-25 13:26:35,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=864, Invalid=942, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:26:35,093 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 43 states. [2018-07-25 13:26:35,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:35,328 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2018-07-25 13:26:35,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-25 13:26:35,328 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 160 [2018-07-25 13:26:35,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:35,329 INFO L225 Difference]: With dead ends: 165 [2018-07-25 13:26:35,329 INFO L226 Difference]: Without dead ends: 163 [2018-07-25 13:26:35,330 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1520 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 13:26:35,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-25 13:26:35,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-07-25 13:26:35,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-25 13:26:35,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-07-25 13:26:35,469 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2018-07-25 13:26:35,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:35,469 INFO L472 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-07-25 13:26:35,469 INFO L473 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-25 13:26:35,470 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-07-25 13:26:35,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-25 13:26:35,470 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:35,470 INFO L354 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1, 1, 1] [2018-07-25 13:26:35,470 INFO L415 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:35,471 INFO L82 PathProgramCache]: Analyzing trace with hash 907582839, now seen corresponding path program 77 times [2018-07-25 13:26:35,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:35,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 3120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:35,891 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:35,891 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-25 13:26:35,891 INFO L451 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-25 13:26:35,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-25 13:26:35,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 13:26:35,892 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2018-07-25 13:26:37,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:37,252 INFO L93 Difference]: Finished difference Result 247 states and 249 transitions. [2018-07-25 13:26:37,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-25 13:26:37,252 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-07-25 13:26:37,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:37,253 INFO L225 Difference]: With dead ends: 247 [2018-07-25 13:26:37,254 INFO L226 Difference]: Without dead ends: 165 [2018-07-25 13:26:37,255 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=410, Invalid=14842, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 13:26:37,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-07-25 13:26:37,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-07-25 13:26:37,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-07-25 13:26:37,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-07-25 13:26:37,398 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2018-07-25 13:26:37,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:37,399 INFO L472 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-07-25 13:26:37,399 INFO L473 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-25 13:26:37,399 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-07-25 13:26:37,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-25 13:26:37,399 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:37,399 INFO L354 BasicCegarLoop]: trace histogram [41, 40, 40, 39, 1, 1, 1, 1] [2018-07-25 13:26:37,400 INFO L415 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:37,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1818644047, now seen corresponding path program 78 times [2018-07-25 13:26:37,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:37,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 1560 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:37,557 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:37,558 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 13:26:37,558 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 13:26:37,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 13:26:37,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=906, Invalid=986, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:26:37,559 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 44 states. [2018-07-25 13:26:37,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:37,906 INFO L93 Difference]: Finished difference Result 169 states and 170 transitions. [2018-07-25 13:26:37,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-25 13:26:37,906 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 164 [2018-07-25 13:26:37,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:37,907 INFO L225 Difference]: With dead ends: 169 [2018-07-25 13:26:37,908 INFO L226 Difference]: Without dead ends: 167 [2018-07-25 13:26:37,908 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1599 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 13:26:37,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-25 13:26:38,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-07-25 13:26:38,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-07-25 13:26:38,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-07-25 13:26:38,048 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2018-07-25 13:26:38,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:38,049 INFO L472 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-07-25 13:26:38,049 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 13:26:38,049 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-07-25 13:26:38,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-07-25 13:26:38,049 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:38,049 INFO L354 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1, 1, 1] [2018-07-25 13:26:38,050 INFO L415 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:38,050 INFO L82 PathProgramCache]: Analyzing trace with hash 334812651, now seen corresponding path program 79 times [2018-07-25 13:26:38,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:38,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 3280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:38,460 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:38,460 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-25 13:26:38,461 INFO L451 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-25 13:26:38,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-25 13:26:38,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 13:26:38,461 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2018-07-25 13:26:39,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:39,823 INFO L93 Difference]: Finished difference Result 253 states and 255 transitions. [2018-07-25 13:26:39,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-25 13:26:39,823 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-07-25 13:26:39,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:39,824 INFO L225 Difference]: With dead ends: 253 [2018-07-25 13:26:39,824 INFO L226 Difference]: Without dead ends: 169 [2018-07-25 13:26:39,826 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=420, Invalid=15582, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 13:26:39,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-07-25 13:26:39,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-07-25 13:26:39,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-07-25 13:26:39,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-07-25 13:26:39,974 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2018-07-25 13:26:39,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:39,975 INFO L472 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-07-25 13:26:39,975 INFO L473 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-25 13:26:39,975 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-07-25 13:26:39,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-07-25 13:26:39,976 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:39,976 INFO L354 BasicCegarLoop]: trace histogram [42, 41, 41, 40, 1, 1, 1, 1] [2018-07-25 13:26:39,976 INFO L415 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:39,976 INFO L82 PathProgramCache]: Analyzing trace with hash -436388571, now seen corresponding path program 80 times [2018-07-25 13:26:39,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:40,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3362 backedges. 1640 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:40,082 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:40,082 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-25 13:26:40,083 INFO L451 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-25 13:26:40,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-25 13:26:40,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1031, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:26:40,083 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 45 states. [2018-07-25 13:26:40,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:40,361 INFO L93 Difference]: Finished difference Result 173 states and 174 transitions. [2018-07-25 13:26:40,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-25 13:26:40,361 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 168 [2018-07-25 13:26:40,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:40,363 INFO L225 Difference]: With dead ends: 173 [2018-07-25 13:26:40,363 INFO L226 Difference]: Without dead ends: 171 [2018-07-25 13:26:40,363 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 13:26:40,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-07-25 13:26:40,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-07-25 13:26:40,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-07-25 13:26:40,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-07-25 13:26:40,503 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2018-07-25 13:26:40,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:40,503 INFO L472 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-07-25 13:26:40,503 INFO L473 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-25 13:26:40,503 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-07-25 13:26:40,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-25 13:26:40,504 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:40,504 INFO L354 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1, 1, 1] [2018-07-25 13:26:40,504 INFO L415 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:40,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1537430623, now seen corresponding path program 81 times [2018-07-25 13:26:40,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:40,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 3444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:40,917 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:40,917 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-25 13:26:40,917 INFO L451 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-25 13:26:40,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-25 13:26:40,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 13:26:40,918 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2018-07-25 13:26:42,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:42,353 INFO L93 Difference]: Finished difference Result 259 states and 261 transitions. [2018-07-25 13:26:42,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-25 13:26:42,353 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-07-25 13:26:42,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:42,354 INFO L225 Difference]: With dead ends: 259 [2018-07-25 13:26:42,354 INFO L226 Difference]: Without dead ends: 173 [2018-07-25 13:26:42,355 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=430, Invalid=16340, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 13:26:42,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-07-25 13:26:42,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-07-25 13:26:42,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-25 13:26:42,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2018-07-25 13:26:42,512 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2018-07-25 13:26:42,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:42,512 INFO L472 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2018-07-25 13:26:42,512 INFO L473 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-25 13:26:42,512 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2018-07-25 13:26:42,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-25 13:26:42,513 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:42,513 INFO L354 BasicCegarLoop]: trace histogram [43, 42, 42, 41, 1, 1, 1, 1] [2018-07-25 13:26:42,513 INFO L415 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:42,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1739485543, now seen corresponding path program 82 times [2018-07-25 13:26:42,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:42,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 1722 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:42,622 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:42,622 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-25 13:26:42,623 INFO L451 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-25 13:26:42,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-25 13:26:42,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=1077, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:26:42,623 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 46 states. [2018-07-25 13:26:42,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:42,897 INFO L93 Difference]: Finished difference Result 177 states and 178 transitions. [2018-07-25 13:26:42,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-25 13:26:42,897 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 172 [2018-07-25 13:26:42,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:42,898 INFO L225 Difference]: With dead ends: 177 [2018-07-25 13:26:42,898 INFO L226 Difference]: Without dead ends: 175 [2018-07-25 13:26:42,899 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1763 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 13:26:42,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-07-25 13:26:43,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-07-25 13:26:43,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-07-25 13:26:43,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-07-25 13:26:43,155 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2018-07-25 13:26:43,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:43,155 INFO L472 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-07-25 13:26:43,155 INFO L473 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-25 13:26:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-07-25 13:26:43,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-07-25 13:26:43,156 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:43,157 INFO L354 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1, 1, 1] [2018-07-25 13:26:43,157 INFO L415 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:43,157 INFO L82 PathProgramCache]: Analyzing trace with hash -903276333, now seen corresponding path program 83 times [2018-07-25 13:26:43,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:43,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 3612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:43,643 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:43,643 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-25 13:26:43,644 INFO L451 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-25 13:26:43,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-25 13:26:43,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 13:26:43,644 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2018-07-25 13:26:45,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:45,300 INFO L93 Difference]: Finished difference Result 265 states and 267 transitions. [2018-07-25 13:26:45,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-25 13:26:45,300 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-07-25 13:26:45,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:45,301 INFO L225 Difference]: With dead ends: 265 [2018-07-25 13:26:45,301 INFO L226 Difference]: Without dead ends: 177 [2018-07-25 13:26:45,303 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=440, Invalid=17116, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 13:26:45,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-07-25 13:26:45,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-07-25 13:26:45,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-07-25 13:26:45,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-07-25 13:26:45,470 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2018-07-25 13:26:45,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:45,470 INFO L472 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-07-25 13:26:45,471 INFO L473 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-25 13:26:45,471 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-07-25 13:26:45,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-25 13:26:45,472 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:45,472 INFO L354 BasicCegarLoop]: trace histogram [44, 43, 43, 42, 1, 1, 1, 1] [2018-07-25 13:26:45,472 INFO L415 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:45,472 INFO L82 PathProgramCache]: Analyzing trace with hash 878421517, now seen corresponding path program 84 times [2018-07-25 13:26:45,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:45,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3698 backedges. 1806 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:45,585 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:45,585 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-25 13:26:45,585 INFO L451 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-25 13:26:45,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-25 13:26:45,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1038, Invalid=1124, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:26:45,586 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 47 states. [2018-07-25 13:26:45,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:45,853 INFO L93 Difference]: Finished difference Result 181 states and 182 transitions. [2018-07-25 13:26:45,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-25 13:26:45,854 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 176 [2018-07-25 13:26:45,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:45,855 INFO L225 Difference]: With dead ends: 181 [2018-07-25 13:26:45,855 INFO L226 Difference]: Without dead ends: 179 [2018-07-25 13:26:45,856 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1848 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 13:26:45,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-25 13:26:46,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-07-25 13:26:46,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-07-25 13:26:46,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-07-25 13:26:46,040 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2018-07-25 13:26:46,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:46,041 INFO L472 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-07-25 13:26:46,041 INFO L473 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-25 13:26:46,041 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-07-25 13:26:46,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-25 13:26:46,042 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:46,042 INFO L354 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1, 1, 1] [2018-07-25 13:26:46,042 INFO L415 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:46,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1945427129, now seen corresponding path program 85 times [2018-07-25 13:26:46,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:46,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 3784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:46,551 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:46,551 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-25 13:26:46,551 INFO L451 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-25 13:26:46,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-25 13:26:46,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 13:26:46,552 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2018-07-25 13:26:48,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:48,147 INFO L93 Difference]: Finished difference Result 271 states and 273 transitions. [2018-07-25 13:26:48,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-25 13:26:48,147 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-07-25 13:26:48,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:48,148 INFO L225 Difference]: With dead ends: 271 [2018-07-25 13:26:48,148 INFO L226 Difference]: Without dead ends: 181 [2018-07-25 13:26:48,150 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 994 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=450, Invalid=17910, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 13:26:48,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-07-25 13:26:48,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-07-25 13:26:48,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-25 13:26:48,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-07-25 13:26:48,323 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2018-07-25 13:26:48,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:48,324 INFO L472 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-07-25 13:26:48,324 INFO L473 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-25 13:26:48,324 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-07-25 13:26:48,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-25 13:26:48,324 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:48,325 INFO L354 BasicCegarLoop]: trace histogram [45, 44, 44, 43, 1, 1, 1, 1] [2018-07-25 13:26:48,325 INFO L415 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:48,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1398834049, now seen corresponding path program 86 times [2018-07-25 13:26:48,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:48,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3872 backedges. 1892 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:48,495 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:48,495 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-25 13:26:48,495 INFO L451 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-25 13:26:48,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-25 13:26:48,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1084, Invalid=1172, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:26:48,496 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 48 states. [2018-07-25 13:26:48,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:48,842 INFO L93 Difference]: Finished difference Result 185 states and 186 transitions. [2018-07-25 13:26:48,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-25 13:26:48,842 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2018-07-25 13:26:48,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:48,843 INFO L225 Difference]: With dead ends: 185 [2018-07-25 13:26:48,843 INFO L226 Difference]: Without dead ends: 183 [2018-07-25 13:26:48,844 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1935 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 13:26:48,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-25 13:26:49,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-07-25 13:26:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-25 13:26:49,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-07-25 13:26:49,053 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2018-07-25 13:26:49,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:49,054 INFO L472 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-07-25 13:26:49,054 INFO L473 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-25 13:26:49,054 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-07-25 13:26:49,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-07-25 13:26:49,054 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:49,055 INFO L354 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1, 1, 1] [2018-07-25 13:26:49,055 INFO L415 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:49,055 INFO L82 PathProgramCache]: Analyzing trace with hash -45190213, now seen corresponding path program 87 times [2018-07-25 13:26:49,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:49,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 3960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:49,523 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:49,523 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-25 13:26:49,523 INFO L451 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-25 13:26:49,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-25 13:26:49,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 13:26:49,524 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2018-07-25 13:26:51,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:51,129 INFO L93 Difference]: Finished difference Result 277 states and 279 transitions. [2018-07-25 13:26:51,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-25 13:26:51,129 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2018-07-25 13:26:51,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:51,130 INFO L225 Difference]: With dead ends: 277 [2018-07-25 13:26:51,130 INFO L226 Difference]: Without dead ends: 185 [2018-07-25 13:26:51,132 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1039 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=460, Invalid=18722, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 13:26:51,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-25 13:26:51,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-07-25 13:26:51,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-25 13:26:51,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2018-07-25 13:26:51,300 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2018-07-25 13:26:51,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:51,300 INFO L472 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2018-07-25 13:26:51,300 INFO L473 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-25 13:26:51,300 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2018-07-25 13:26:51,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-25 13:26:51,301 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:51,301 INFO L354 BasicCegarLoop]: trace histogram [46, 45, 45, 44, 1, 1, 1, 1] [2018-07-25 13:26:51,301 INFO L415 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:51,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1579493109, now seen corresponding path program 88 times [2018-07-25 13:26:51,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:51,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 1980 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:51,410 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:51,410 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-25 13:26:51,410 INFO L451 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-25 13:26:51,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-25 13:26:51,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1131, Invalid=1221, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:26:51,411 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 49 states. [2018-07-25 13:26:51,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:51,747 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions. [2018-07-25 13:26:51,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-25 13:26:51,747 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2018-07-25 13:26:51,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:51,748 INFO L225 Difference]: With dead ends: 189 [2018-07-25 13:26:51,748 INFO L226 Difference]: Without dead ends: 187 [2018-07-25 13:26:51,749 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2024 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 13:26:51,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-07-25 13:26:51,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-07-25 13:26:51,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-07-25 13:26:51,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-07-25 13:26:51,923 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2018-07-25 13:26:51,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:51,924 INFO L472 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-07-25 13:26:51,924 INFO L473 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-25 13:26:51,924 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-07-25 13:26:51,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-07-25 13:26:51,925 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:51,925 INFO L354 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1, 1, 1] [2018-07-25 13:26:51,925 INFO L415 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:51,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1769474607, now seen corresponding path program 89 times [2018-07-25 13:26:51,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:52,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 0 proven. 4140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:52,399 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:52,399 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-25 13:26:52,399 INFO L451 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-25 13:26:52,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-25 13:26:52,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 13:26:52,400 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 94 states. [2018-07-25 13:26:54,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:54,168 INFO L93 Difference]: Finished difference Result 283 states and 285 transitions. [2018-07-25 13:26:54,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-25 13:26:54,168 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2018-07-25 13:26:54,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:54,169 INFO L225 Difference]: With dead ends: 283 [2018-07-25 13:26:54,169 INFO L226 Difference]: Without dead ends: 189 [2018-07-25 13:26:54,170 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=470, Invalid=19552, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 13:26:54,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-07-25 13:26:54,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-07-25 13:26:54,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-07-25 13:26:54,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-07-25 13:26:54,357 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2018-07-25 13:26:54,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:54,357 INFO L472 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-07-25 13:26:54,357 INFO L473 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-25 13:26:54,358 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-07-25 13:26:54,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-07-25 13:26:54,358 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:54,358 INFO L354 BasicCegarLoop]: trace histogram [47, 46, 46, 45, 1, 1, 1, 1] [2018-07-25 13:26:54,358 INFO L415 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:54,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1290702953, now seen corresponding path program 90 times [2018-07-25 13:26:54,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:54,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 2070 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:54,524 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:54,525 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-25 13:26:54,525 INFO L451 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-25 13:26:54,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-25 13:26:54,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1179, Invalid=1271, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 13:26:54,526 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 50 states. [2018-07-25 13:26:54,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:54,839 INFO L93 Difference]: Finished difference Result 193 states and 194 transitions. [2018-07-25 13:26:54,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-25 13:26:54,839 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 188 [2018-07-25 13:26:54,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:54,840 INFO L225 Difference]: With dead ends: 193 [2018-07-25 13:26:54,840 INFO L226 Difference]: Without dead ends: 191 [2018-07-25 13:26:54,841 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 13:26:54,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-07-25 13:26:55,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-07-25 13:26:55,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-07-25 13:26:55,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2018-07-25 13:26:55,015 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2018-07-25 13:26:55,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:55,015 INFO L472 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2018-07-25 13:26:55,015 INFO L473 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-25 13:26:55,015 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2018-07-25 13:26:55,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-07-25 13:26:55,016 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:55,016 INFO L354 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1, 1, 1] [2018-07-25 13:26:55,016 INFO L415 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:55,016 INFO L82 PathProgramCache]: Analyzing trace with hash -879958365, now seen corresponding path program 91 times [2018-07-25 13:26:55,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:55,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4324 backedges. 0 proven. 4324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:55,473 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:55,473 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-25 13:26:55,474 INFO L451 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-25 13:26:55,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-25 13:26:55,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 13:26:55,474 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 96 states. [2018-07-25 13:26:57,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:57,181 INFO L93 Difference]: Finished difference Result 289 states and 291 transitions. [2018-07-25 13:26:57,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-25 13:26:57,181 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2018-07-25 13:26:57,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:57,182 INFO L225 Difference]: With dead ends: 289 [2018-07-25 13:26:57,182 INFO L226 Difference]: Without dead ends: 193 [2018-07-25 13:26:57,183 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1132 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=480, Invalid=20400, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 13:26:57,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-07-25 13:26:57,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-07-25 13:26:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-07-25 13:26:57,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-07-25 13:26:57,382 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2018-07-25 13:26:57,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:57,382 INFO L472 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-07-25 13:26:57,382 INFO L473 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-25 13:26:57,383 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-07-25 13:26:57,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-07-25 13:26:57,383 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:57,383 INFO L354 BasicCegarLoop]: trace histogram [48, 47, 47, 46, 1, 1, 1, 1] [2018-07-25 13:26:57,384 INFO L415 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:57,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1736556509, now seen corresponding path program 92 times [2018-07-25 13:26:57,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:57,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4418 backedges. 2162 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:57,516 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:57,516 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-25 13:26:57,516 INFO L451 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-25 13:26:57,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-25 13:26:57,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1228, Invalid=1322, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:26:57,517 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 51 states. [2018-07-25 13:26:57,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:26:57,826 INFO L93 Difference]: Finished difference Result 197 states and 198 transitions. [2018-07-25 13:26:57,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-25 13:26:57,826 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 192 [2018-07-25 13:26:57,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:26:57,827 INFO L225 Difference]: With dead ends: 197 [2018-07-25 13:26:57,827 INFO L226 Difference]: Without dead ends: 195 [2018-07-25 13:26:57,827 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2208 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 13:26:57,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-07-25 13:26:58,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-07-25 13:26:58,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-07-25 13:26:58,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-07-25 13:26:58,027 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2018-07-25 13:26:58,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:26:58,027 INFO L472 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-07-25 13:26:58,027 INFO L473 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-25 13:26:58,027 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-07-25 13:26:58,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-07-25 13:26:58,028 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:26:58,028 INFO L354 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1, 1, 1] [2018-07-25 13:26:58,028 INFO L415 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:26:58,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1911420649, now seen corresponding path program 93 times [2018-07-25 13:26:58,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:26:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:26:58,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 4512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:26:58,583 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:26:58,583 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-25 13:26:58,583 INFO L451 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-25 13:26:58,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-25 13:26:58,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 13:26:58,584 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 98 states. [2018-07-25 13:27:00,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:00,462 INFO L93 Difference]: Finished difference Result 295 states and 297 transitions. [2018-07-25 13:27:00,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-25 13:27:00,463 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2018-07-25 13:27:00,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:00,464 INFO L225 Difference]: With dead ends: 295 [2018-07-25 13:27:00,464 INFO L226 Difference]: Without dead ends: 197 [2018-07-25 13:27:00,465 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1180 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=490, Invalid=21266, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 13:27:00,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-07-25 13:27:00,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-07-25 13:27:00,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-07-25 13:27:00,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-07-25 13:27:00,729 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2018-07-25 13:27:00,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:00,729 INFO L472 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-07-25 13:27:00,729 INFO L473 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-25 13:27:00,729 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-07-25 13:27:00,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-07-25 13:27:00,730 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:00,731 INFO L354 BasicCegarLoop]: trace histogram [49, 48, 48, 47, 1, 1, 1, 1] [2018-07-25 13:27:00,731 INFO L415 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:00,731 INFO L82 PathProgramCache]: Analyzing trace with hash 86226257, now seen corresponding path program 94 times [2018-07-25 13:27:00,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:00,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4608 backedges. 2256 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:00,882 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:00,882 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-25 13:27:00,883 INFO L451 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-25 13:27:00,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-25 13:27:00,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1278, Invalid=1374, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:27:00,883 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 52 states. [2018-07-25 13:27:01,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:01,229 INFO L93 Difference]: Finished difference Result 201 states and 202 transitions. [2018-07-25 13:27:01,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-25 13:27:01,230 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 196 [2018-07-25 13:27:01,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:01,231 INFO L225 Difference]: With dead ends: 201 [2018-07-25 13:27:01,231 INFO L226 Difference]: Without dead ends: 199 [2018-07-25 13:27:01,231 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2303 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 13:27:01,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-07-25 13:27:01,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-07-25 13:27:01,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-07-25 13:27:01,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-07-25 13:27:01,445 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2018-07-25 13:27:01,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:01,445 INFO L472 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-07-25 13:27:01,445 INFO L473 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-25 13:27:01,446 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-07-25 13:27:01,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-07-25 13:27:01,447 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:01,447 INFO L354 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1, 1, 1] [2018-07-25 13:27:01,447 INFO L415 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:01,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1259106699, now seen corresponding path program 95 times [2018-07-25 13:27:01,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:02,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 4704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:02,016 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:02,016 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-25 13:27:02,016 INFO L451 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-25 13:27:02,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-25 13:27:02,017 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 13:27:02,017 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 100 states. [2018-07-25 13:27:03,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:03,976 INFO L93 Difference]: Finished difference Result 301 states and 303 transitions. [2018-07-25 13:27:03,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-25 13:27:03,976 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2018-07-25 13:27:03,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:03,977 INFO L225 Difference]: With dead ends: 301 [2018-07-25 13:27:03,977 INFO L226 Difference]: Without dead ends: 201 [2018-07-25 13:27:03,979 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=500, Invalid=22150, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 13:27:03,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-07-25 13:27:04,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-07-25 13:27:04,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-07-25 13:27:04,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-07-25 13:27:04,195 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2018-07-25 13:27:04,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:04,195 INFO L472 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-07-25 13:27:04,195 INFO L473 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-25 13:27:04,195 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-07-25 13:27:04,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-07-25 13:27:04,196 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:04,196 INFO L354 BasicCegarLoop]: trace histogram [50, 49, 49, 48, 1, 1, 1, 1] [2018-07-25 13:27:04,196 INFO L415 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:04,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1285124293, now seen corresponding path program 96 times [2018-07-25 13:27:04,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:04,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4802 backedges. 2352 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:04,346 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:04,346 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-25 13:27:04,346 INFO L451 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-25 13:27:04,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-25 13:27:04,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1329, Invalid=1427, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:27:04,347 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 53 states. [2018-07-25 13:27:04,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:04,713 INFO L93 Difference]: Finished difference Result 205 states and 206 transitions. [2018-07-25 13:27:04,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-25 13:27:04,713 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 200 [2018-07-25 13:27:04,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:04,714 INFO L225 Difference]: With dead ends: 205 [2018-07-25 13:27:04,714 INFO L226 Difference]: Without dead ends: 203 [2018-07-25 13:27:04,715 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2400 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 13:27:04,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-07-25 13:27:04,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-07-25 13:27:04,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-25 13:27:04,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2018-07-25 13:27:04,932 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2018-07-25 13:27:04,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:04,932 INFO L472 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2018-07-25 13:27:04,932 INFO L473 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-25 13:27:04,932 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2018-07-25 13:27:04,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-07-25 13:27:04,933 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:04,933 INFO L354 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1, 1, 1] [2018-07-25 13:27:04,933 INFO L415 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:04,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1946083329, now seen corresponding path program 97 times [2018-07-25 13:27:04,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:04,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:05,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:05,482 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:05,482 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-25 13:27:05,482 INFO L451 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-25 13:27:05,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-25 13:27:05,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 13:27:05,484 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 102 states. [2018-07-25 13:27:07,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:07,448 INFO L93 Difference]: Finished difference Result 307 states and 309 transitions. [2018-07-25 13:27:07,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-25 13:27:07,448 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2018-07-25 13:27:07,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:07,449 INFO L225 Difference]: With dead ends: 307 [2018-07-25 13:27:07,449 INFO L226 Difference]: Without dead ends: 205 [2018-07-25 13:27:07,451 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1279 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=510, Invalid=23052, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 13:27:07,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-07-25 13:27:07,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-07-25 13:27:07,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-07-25 13:27:07,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-07-25 13:27:07,674 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2018-07-25 13:27:07,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:07,674 INFO L472 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-07-25 13:27:07,674 INFO L473 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-25 13:27:07,674 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-07-25 13:27:07,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-07-25 13:27:07,675 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:07,675 INFO L354 BasicCegarLoop]: trace histogram [51, 50, 50, 49, 1, 1, 1, 1] [2018-07-25 13:27:07,675 INFO L415 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:07,675 INFO L82 PathProgramCache]: Analyzing trace with hash -198708679, now seen corresponding path program 98 times [2018-07-25 13:27:07,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:07,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5000 backedges. 2450 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:07,834 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:07,834 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-25 13:27:07,834 INFO L451 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-25 13:27:07,834 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-25 13:27:07,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1381, Invalid=1481, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:27:07,835 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 54 states. [2018-07-25 13:27:08,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:08,181 INFO L93 Difference]: Finished difference Result 209 states and 210 transitions. [2018-07-25 13:27:08,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-25 13:27:08,182 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 204 [2018-07-25 13:27:08,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:08,182 INFO L225 Difference]: With dead ends: 209 [2018-07-25 13:27:08,183 INFO L226 Difference]: Without dead ends: 207 [2018-07-25 13:27:08,183 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2499 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 13:27:08,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-07-25 13:27:08,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-07-25 13:27:08,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-07-25 13:27:08,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-07-25 13:27:08,411 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2018-07-25 13:27:08,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:08,411 INFO L472 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-07-25 13:27:08,411 INFO L473 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-25 13:27:08,411 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-07-25 13:27:08,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-07-25 13:27:08,412 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:08,412 INFO L354 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1, 1, 1] [2018-07-25 13:27:08,412 INFO L415 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:08,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1980427149, now seen corresponding path program 99 times [2018-07-25 13:27:08,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:09,094 INFO L134 CoverageAnalysis]: Checked inductivity of 5100 backedges. 0 proven. 5100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:09,094 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:09,094 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-25 13:27:09,095 INFO L451 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-25 13:27:09,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-25 13:27:09,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 13:27:09,095 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 104 states. [2018-07-25 13:27:11,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:11,157 INFO L93 Difference]: Finished difference Result 313 states and 315 transitions. [2018-07-25 13:27:11,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-25 13:27:11,157 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2018-07-25 13:27:11,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:11,158 INFO L225 Difference]: With dead ends: 313 [2018-07-25 13:27:11,158 INFO L226 Difference]: Without dead ends: 209 [2018-07-25 13:27:11,160 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1330 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=520, Invalid=23972, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 13:27:11,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-07-25 13:27:11,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-07-25 13:27:11,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-07-25 13:27:11,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2018-07-25 13:27:11,396 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2018-07-25 13:27:11,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:11,397 INFO L472 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2018-07-25 13:27:11,397 INFO L473 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-25 13:27:11,397 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2018-07-25 13:27:11,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-07-25 13:27:11,397 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:11,398 INFO L354 BasicCegarLoop]: trace histogram [52, 51, 51, 50, 1, 1, 1, 1] [2018-07-25 13:27:11,398 INFO L415 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:11,398 INFO L82 PathProgramCache]: Analyzing trace with hash 26491309, now seen corresponding path program 100 times [2018-07-25 13:27:11,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:11,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5202 backedges. 2550 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:11,547 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:11,547 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-25 13:27:11,548 INFO L451 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-25 13:27:11,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-25 13:27:11,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1434, Invalid=1536, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:27:11,549 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 55 states. [2018-07-25 13:27:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:11,899 INFO L93 Difference]: Finished difference Result 213 states and 214 transitions. [2018-07-25 13:27:11,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-25 13:27:11,899 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 208 [2018-07-25 13:27:11,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:11,900 INFO L225 Difference]: With dead ends: 213 [2018-07-25 13:27:11,901 INFO L226 Difference]: Without dead ends: 211 [2018-07-25 13:27:11,902 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2600 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 13:27:11,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-07-25 13:27:12,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-07-25 13:27:12,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-07-25 13:27:12,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-07-25 13:27:12,141 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2018-07-25 13:27:12,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:12,141 INFO L472 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-07-25 13:27:12,141 INFO L473 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-25 13:27:12,141 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-07-25 13:27:12,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-07-25 13:27:12,142 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:12,143 INFO L354 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1, 1, 1] [2018-07-25 13:27:12,143 INFO L415 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:12,143 INFO L82 PathProgramCache]: Analyzing trace with hash -311603481, now seen corresponding path program 101 times [2018-07-25 13:27:12,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:12,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 5304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:12,740 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:12,740 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-25 13:27:12,741 INFO L451 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-07-25 13:27:12,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-07-25 13:27:12,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 13:27:12,742 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 106 states. [2018-07-25 13:27:14,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:14,901 INFO L93 Difference]: Finished difference Result 319 states and 321 transitions. [2018-07-25 13:27:14,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-25 13:27:14,901 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2018-07-25 13:27:14,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:14,902 INFO L225 Difference]: With dead ends: 319 [2018-07-25 13:27:14,902 INFO L226 Difference]: Without dead ends: 213 [2018-07-25 13:27:14,904 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1382 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=530, Invalid=24910, Unknown=0, NotChecked=0, Total=25440 [2018-07-25 13:27:14,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-07-25 13:27:15,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-07-25 13:27:15,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-07-25 13:27:15,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2018-07-25 13:27:15,191 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2018-07-25 13:27:15,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:15,191 INFO L472 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2018-07-25 13:27:15,191 INFO L473 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-07-25 13:27:15,191 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2018-07-25 13:27:15,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-07-25 13:27:15,193 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:15,193 INFO L354 BasicCegarLoop]: trace histogram [53, 52, 52, 51, 1, 1, 1, 1] [2018-07-25 13:27:15,193 INFO L415 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:15,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1977399519, now seen corresponding path program 102 times [2018-07-25 13:27:15,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:15,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5408 backedges. 2652 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:15,372 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:15,373 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-25 13:27:15,373 INFO L451 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-25 13:27:15,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-25 13:27:15,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1488, Invalid=1592, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:27:15,374 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 56 states. [2018-07-25 13:27:15,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:15,770 INFO L93 Difference]: Finished difference Result 217 states and 218 transitions. [2018-07-25 13:27:15,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-25 13:27:15,770 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 212 [2018-07-25 13:27:15,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:15,771 INFO L225 Difference]: With dead ends: 217 [2018-07-25 13:27:15,771 INFO L226 Difference]: Without dead ends: 215 [2018-07-25 13:27:15,772 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2703 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 13:27:15,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-07-25 13:27:16,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-07-25 13:27:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-07-25 13:27:16,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2018-07-25 13:27:16,026 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 212 [2018-07-25 13:27:16,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:16,026 INFO L472 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2018-07-25 13:27:16,026 INFO L473 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-25 13:27:16,026 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2018-07-25 13:27:16,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-07-25 13:27:16,027 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:16,027 INFO L354 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1, 1, 1] [2018-07-25 13:27:16,027 INFO L415 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:16,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1905340581, now seen corresponding path program 103 times [2018-07-25 13:27:16,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:16,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5512 backedges. 0 proven. 5512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:16,678 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:16,678 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-07-25 13:27:16,678 INFO L451 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-07-25 13:27:16,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-07-25 13:27:16,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 13:27:16,679 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 108 states. [2018-07-25 13:27:18,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:18,970 INFO L93 Difference]: Finished difference Result 325 states and 327 transitions. [2018-07-25 13:27:18,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-07-25 13:27:18,971 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 214 [2018-07-25 13:27:18,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:18,971 INFO L225 Difference]: With dead ends: 325 [2018-07-25 13:27:18,971 INFO L226 Difference]: Without dead ends: 217 [2018-07-25 13:27:18,973 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1435 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=540, Invalid=25866, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 13:27:18,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-07-25 13:27:19,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-07-25 13:27:19,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-07-25 13:27:19,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-07-25 13:27:19,196 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 214 [2018-07-25 13:27:19,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:19,196 INFO L472 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-07-25 13:27:19,197 INFO L473 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-07-25 13:27:19,197 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-07-25 13:27:19,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-07-25 13:27:19,197 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:19,198 INFO L354 BasicCegarLoop]: trace histogram [54, 53, 53, 52, 1, 1, 1, 1] [2018-07-25 13:27:19,198 INFO L415 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:19,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1922701973, now seen corresponding path program 104 times [2018-07-25 13:27:19,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:19,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5618 backedges. 2756 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:19,340 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:19,340 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-25 13:27:19,340 INFO L451 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-25 13:27:19,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-25 13:27:19,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1543, Invalid=1649, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:27:19,340 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 57 states. [2018-07-25 13:27:19,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:19,683 INFO L93 Difference]: Finished difference Result 221 states and 222 transitions. [2018-07-25 13:27:19,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-07-25 13:27:19,683 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 216 [2018-07-25 13:27:19,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:19,684 INFO L225 Difference]: With dead ends: 221 [2018-07-25 13:27:19,684 INFO L226 Difference]: Without dead ends: 219 [2018-07-25 13:27:19,685 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2808 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 13:27:19,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-07-25 13:27:19,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-07-25 13:27:19,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-07-25 13:27:19,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 220 transitions. [2018-07-25 13:27:19,907 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 220 transitions. Word has length 216 [2018-07-25 13:27:19,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:19,907 INFO L472 AbstractCegarLoop]: Abstraction has 219 states and 220 transitions. [2018-07-25 13:27:19,907 INFO L473 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-25 13:27:19,907 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 220 transitions. [2018-07-25 13:27:19,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-07-25 13:27:19,907 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:19,908 INFO L354 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1, 1, 1] [2018-07-25 13:27:19,908 INFO L415 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:19,908 INFO L82 PathProgramCache]: Analyzing trace with hash 880711119, now seen corresponding path program 105 times [2018-07-25 13:27:19,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:20,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 0 proven. 5724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:20,526 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:20,526 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-07-25 13:27:20,527 INFO L451 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-07-25 13:27:20,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-07-25 13:27:20,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 13:27:20,528 INFO L87 Difference]: Start difference. First operand 219 states and 220 transitions. Second operand 110 states. [2018-07-25 13:27:22,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:22,940 INFO L93 Difference]: Finished difference Result 331 states and 333 transitions. [2018-07-25 13:27:22,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-25 13:27:22,940 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 218 [2018-07-25 13:27:22,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:22,941 INFO L225 Difference]: With dead ends: 331 [2018-07-25 13:27:22,941 INFO L226 Difference]: Without dead ends: 221 [2018-07-25 13:27:22,942 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1489 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=550, Invalid=26840, Unknown=0, NotChecked=0, Total=27390 [2018-07-25 13:27:22,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-07-25 13:27:23,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-07-25 13:27:23,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-07-25 13:27:23,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 222 transitions. [2018-07-25 13:27:23,197 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 222 transitions. Word has length 218 [2018-07-25 13:27:23,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:23,197 INFO L472 AbstractCegarLoop]: Abstraction has 221 states and 222 transitions. [2018-07-25 13:27:23,197 INFO L473 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-07-25 13:27:23,197 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 222 transitions. [2018-07-25 13:27:23,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-07-25 13:27:23,198 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:23,198 INFO L354 BasicCegarLoop]: trace histogram [55, 54, 54, 53, 1, 1, 1, 1] [2018-07-25 13:27:23,199 INFO L415 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:23,199 INFO L82 PathProgramCache]: Analyzing trace with hash 792572937, now seen corresponding path program 106 times [2018-07-25 13:27:23,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:23,363 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 2862 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:23,363 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:23,363 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-25 13:27:23,364 INFO L451 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-25 13:27:23,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-25 13:27:23,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=1707, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:27:23,364 INFO L87 Difference]: Start difference. First operand 221 states and 222 transitions. Second operand 58 states. [2018-07-25 13:27:23,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:23,747 INFO L93 Difference]: Finished difference Result 225 states and 226 transitions. [2018-07-25 13:27:23,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-25 13:27:23,747 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 220 [2018-07-25 13:27:23,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:23,748 INFO L225 Difference]: With dead ends: 225 [2018-07-25 13:27:23,748 INFO L226 Difference]: Without dead ends: 223 [2018-07-25 13:27:23,749 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2915 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 13:27:23,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-07-25 13:27:24,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-07-25 13:27:24,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-07-25 13:27:24,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2018-07-25 13:27:24,008 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 220 [2018-07-25 13:27:24,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:24,008 INFO L472 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2018-07-25 13:27:24,008 INFO L473 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-25 13:27:24,008 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2018-07-25 13:27:24,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-07-25 13:27:24,009 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:24,009 INFO L354 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1, 1, 1] [2018-07-25 13:27:24,009 INFO L415 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:24,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1453433411, now seen corresponding path program 107 times [2018-07-25 13:27:24,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:24,720 INFO L134 CoverageAnalysis]: Checked inductivity of 5940 backedges. 0 proven. 5940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:24,721 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:24,721 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-07-25 13:27:24,721 INFO L451 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-07-25 13:27:24,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-07-25 13:27:24,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 13:27:24,722 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 112 states. [2018-07-25 13:27:27,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:27,275 INFO L93 Difference]: Finished difference Result 337 states and 339 transitions. [2018-07-25 13:27:27,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-07-25 13:27:27,275 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 222 [2018-07-25 13:27:27,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:27,276 INFO L225 Difference]: With dead ends: 337 [2018-07-25 13:27:27,276 INFO L226 Difference]: Without dead ends: 225 [2018-07-25 13:27:27,277 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1544 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=560, Invalid=27832, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 13:27:27,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-07-25 13:27:27,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-07-25 13:27:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-07-25 13:27:27,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2018-07-25 13:27:27,545 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 222 [2018-07-25 13:27:27,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:27,545 INFO L472 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2018-07-25 13:27:27,545 INFO L473 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-07-25 13:27:27,546 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2018-07-25 13:27:27,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-07-25 13:27:27,546 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:27,546 INFO L354 BasicCegarLoop]: trace histogram [56, 55, 55, 54, 1, 1, 1, 1] [2018-07-25 13:27:27,546 INFO L415 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:27,547 INFO L82 PathProgramCache]: Analyzing trace with hash -2083318915, now seen corresponding path program 108 times [2018-07-25 13:27:27,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:27,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 2970 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:27,714 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:27,714 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-25 13:27:27,715 INFO L451 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-25 13:27:27,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-25 13:27:27,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1656, Invalid=1766, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:27:27,715 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 59 states. [2018-07-25 13:27:28,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:28,111 INFO L93 Difference]: Finished difference Result 229 states and 230 transitions. [2018-07-25 13:27:28,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-07-25 13:27:28,112 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 224 [2018-07-25 13:27:28,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:28,112 INFO L225 Difference]: With dead ends: 229 [2018-07-25 13:27:28,112 INFO L226 Difference]: Without dead ends: 227 [2018-07-25 13:27:28,113 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3024 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 13:27:28,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-07-25 13:27:28,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-07-25 13:27:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-07-25 13:27:28,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 228 transitions. [2018-07-25 13:27:28,378 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 228 transitions. Word has length 224 [2018-07-25 13:27:28,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:28,378 INFO L472 AbstractCegarLoop]: Abstraction has 227 states and 228 transitions. [2018-07-25 13:27:28,378 INFO L473 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-25 13:27:28,379 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 228 transitions. [2018-07-25 13:27:28,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-07-25 13:27:28,379 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:28,379 INFO L354 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1, 1, 1] [2018-07-25 13:27:28,379 INFO L415 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:28,379 INFO L82 PathProgramCache]: Analyzing trace with hash -614665033, now seen corresponding path program 109 times [2018-07-25 13:27:28,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:29,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 6160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:29,087 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:29,087 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-07-25 13:27:29,087 INFO L451 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-07-25 13:27:29,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-07-25 13:27:29,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 13:27:29,089 INFO L87 Difference]: Start difference. First operand 227 states and 228 transitions. Second operand 114 states. [2018-07-25 13:27:31,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:31,759 INFO L93 Difference]: Finished difference Result 343 states and 345 transitions. [2018-07-25 13:27:31,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-25 13:27:31,759 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 226 [2018-07-25 13:27:31,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:31,759 INFO L225 Difference]: With dead ends: 343 [2018-07-25 13:27:31,759 INFO L226 Difference]: Without dead ends: 229 [2018-07-25 13:27:31,760 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=570, Invalid=28842, Unknown=0, NotChecked=0, Total=29412 [2018-07-25 13:27:31,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-07-25 13:27:32,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-07-25 13:27:32,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-07-25 13:27:32,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 230 transitions. [2018-07-25 13:27:32,035 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 230 transitions. Word has length 226 [2018-07-25 13:27:32,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:32,035 INFO L472 AbstractCegarLoop]: Abstraction has 229 states and 230 transitions. [2018-07-25 13:27:32,035 INFO L473 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-07-25 13:27:32,035 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 230 transitions. [2018-07-25 13:27:32,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-07-25 13:27:32,036 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:32,036 INFO L354 BasicCegarLoop]: trace histogram [57, 56, 56, 55, 1, 1, 1, 1] [2018-07-25 13:27:32,037 INFO L415 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:32,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1134508273, now seen corresponding path program 110 times [2018-07-25 13:27:32,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:32,214 INFO L134 CoverageAnalysis]: Checked inductivity of 6272 backedges. 3080 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:32,214 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:32,214 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-25 13:27:32,214 INFO L451 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-25 13:27:32,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-25 13:27:32,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1714, Invalid=1826, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 13:27:32,215 INFO L87 Difference]: Start difference. First operand 229 states and 230 transitions. Second operand 60 states. [2018-07-25 13:27:32,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:32,660 INFO L93 Difference]: Finished difference Result 233 states and 234 transitions. [2018-07-25 13:27:32,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-25 13:27:32,661 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 228 [2018-07-25 13:27:32,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:32,661 INFO L225 Difference]: With dead ends: 233 [2018-07-25 13:27:32,662 INFO L226 Difference]: Without dead ends: 231 [2018-07-25 13:27:32,663 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3135 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 13:27:32,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-07-25 13:27:33,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-07-25 13:27:33,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-07-25 13:27:33,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2018-07-25 13:27:33,110 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 228 [2018-07-25 13:27:33,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:33,110 INFO L472 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2018-07-25 13:27:33,110 INFO L473 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-25 13:27:33,110 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2018-07-25 13:27:33,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-07-25 13:27:33,111 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:33,111 INFO L354 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1, 1, 1] [2018-07-25 13:27:33,111 INFO L415 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:33,112 INFO L82 PathProgramCache]: Analyzing trace with hash -659190485, now seen corresponding path program 111 times [2018-07-25 13:27:33,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:33,876 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 6384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:33,876 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:33,876 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-07-25 13:27:33,876 INFO L451 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-07-25 13:27:33,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-07-25 13:27:33,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 13:27:33,878 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 116 states. [2018-07-25 13:27:36,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:36,457 INFO L93 Difference]: Finished difference Result 349 states and 351 transitions. [2018-07-25 13:27:36,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-25 13:27:36,457 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 230 [2018-07-25 13:27:36,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:36,457 INFO L225 Difference]: With dead ends: 349 [2018-07-25 13:27:36,457 INFO L226 Difference]: Without dead ends: 233 [2018-07-25 13:27:36,458 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1657 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=580, Invalid=29870, Unknown=0, NotChecked=0, Total=30450 [2018-07-25 13:27:36,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-07-25 13:27:36,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-07-25 13:27:36,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-07-25 13:27:36,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 234 transitions. [2018-07-25 13:27:36,727 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 234 transitions. Word has length 230 [2018-07-25 13:27:36,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:36,727 INFO L472 AbstractCegarLoop]: Abstraction has 233 states and 234 transitions. [2018-07-25 13:27:36,728 INFO L473 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-07-25 13:27:36,728 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 234 transitions. [2018-07-25 13:27:36,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-07-25 13:27:36,728 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:36,728 INFO L354 BasicCegarLoop]: trace histogram [58, 57, 57, 56, 1, 1, 1, 1] [2018-07-25 13:27:36,728 INFO L415 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:36,729 INFO L82 PathProgramCache]: Analyzing trace with hash 291972197, now seen corresponding path program 112 times [2018-07-25 13:27:36,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:36,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 3192 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:36,897 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:36,897 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-25 13:27:36,898 INFO L451 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-25 13:27:36,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-25 13:27:36,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1773, Invalid=1887, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:27:36,898 INFO L87 Difference]: Start difference. First operand 233 states and 234 transitions. Second operand 61 states. [2018-07-25 13:27:37,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:37,341 INFO L93 Difference]: Finished difference Result 237 states and 238 transitions. [2018-07-25 13:27:37,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-25 13:27:37,341 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 232 [2018-07-25 13:27:37,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:37,342 INFO L225 Difference]: With dead ends: 237 [2018-07-25 13:27:37,342 INFO L226 Difference]: Without dead ends: 235 [2018-07-25 13:27:37,343 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3248 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 13:27:37,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-07-25 13:27:37,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-07-25 13:27:37,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-07-25 13:27:37,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 236 transitions. [2018-07-25 13:27:37,633 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 236 transitions. Word has length 232 [2018-07-25 13:27:37,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:37,633 INFO L472 AbstractCegarLoop]: Abstraction has 235 states and 236 transitions. [2018-07-25 13:27:37,634 INFO L473 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-25 13:27:37,634 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 236 transitions. [2018-07-25 13:27:37,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-07-25 13:27:37,634 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:37,634 INFO L354 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1, 1, 1] [2018-07-25 13:27:37,634 INFO L415 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:37,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1412459423, now seen corresponding path program 113 times [2018-07-25 13:27:37,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:38,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 6612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:38,394 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:38,394 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-07-25 13:27:38,395 INFO L451 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-07-25 13:27:38,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-07-25 13:27:38,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 13:27:38,396 INFO L87 Difference]: Start difference. First operand 235 states and 236 transitions. Second operand 118 states. [2018-07-25 13:27:41,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:41,166 INFO L93 Difference]: Finished difference Result 355 states and 357 transitions. [2018-07-25 13:27:41,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-07-25 13:27:41,166 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 234 [2018-07-25 13:27:41,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:41,167 INFO L225 Difference]: With dead ends: 355 [2018-07-25 13:27:41,167 INFO L226 Difference]: Without dead ends: 237 [2018-07-25 13:27:41,168 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1715 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=590, Invalid=30916, Unknown=0, NotChecked=0, Total=31506 [2018-07-25 13:27:41,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-07-25 13:27:41,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-07-25 13:27:41,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-07-25 13:27:41,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 238 transitions. [2018-07-25 13:27:41,469 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 238 transitions. Word has length 234 [2018-07-25 13:27:41,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:41,469 INFO L472 AbstractCegarLoop]: Abstraction has 237 states and 238 transitions. [2018-07-25 13:27:41,469 INFO L473 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-07-25 13:27:41,469 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 238 transitions. [2018-07-25 13:27:41,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-07-25 13:27:41,470 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:41,470 INFO L354 BasicCegarLoop]: trace histogram [59, 58, 58, 57, 1, 1, 1, 1] [2018-07-25 13:27:41,470 INFO L415 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:41,470 INFO L82 PathProgramCache]: Analyzing trace with hash 527422937, now seen corresponding path program 114 times [2018-07-25 13:27:41,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:41,660 INFO L134 CoverageAnalysis]: Checked inductivity of 6728 backedges. 3306 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:41,660 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:41,660 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-25 13:27:41,660 INFO L451 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-25 13:27:41,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-25 13:27:41,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1833, Invalid=1949, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:27:41,661 INFO L87 Difference]: Start difference. First operand 237 states and 238 transitions. Second operand 62 states. [2018-07-25 13:27:42,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:42,116 INFO L93 Difference]: Finished difference Result 241 states and 242 transitions. [2018-07-25 13:27:42,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-07-25 13:27:42,116 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 236 [2018-07-25 13:27:42,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:42,117 INFO L225 Difference]: With dead ends: 241 [2018-07-25 13:27:42,117 INFO L226 Difference]: Without dead ends: 239 [2018-07-25 13:27:42,118 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3363 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 13:27:42,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-07-25 13:27:42,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-07-25 13:27:42,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-07-25 13:27:42,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 240 transitions. [2018-07-25 13:27:42,429 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 240 transitions. Word has length 236 [2018-07-25 13:27:42,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:42,429 INFO L472 AbstractCegarLoop]: Abstraction has 239 states and 240 transitions. [2018-07-25 13:27:42,429 INFO L473 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-25 13:27:42,429 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 240 transitions. [2018-07-25 13:27:42,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-07-25 13:27:42,430 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:42,430 INFO L354 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1, 1, 1] [2018-07-25 13:27:42,430 INFO L415 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:42,430 INFO L82 PathProgramCache]: Analyzing trace with hash 47353875, now seen corresponding path program 115 times [2018-07-25 13:27:42,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:43,224 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 6844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:43,225 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:43,225 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-07-25 13:27:43,225 INFO L451 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-07-25 13:27:43,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-07-25 13:27:43,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 13:27:43,226 INFO L87 Difference]: Start difference. First operand 239 states and 240 transitions. Second operand 120 states. [2018-07-25 13:27:46,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:46,013 INFO L93 Difference]: Finished difference Result 361 states and 363 transitions. [2018-07-25 13:27:46,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-07-25 13:27:46,013 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 238 [2018-07-25 13:27:46,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:46,014 INFO L225 Difference]: With dead ends: 361 [2018-07-25 13:27:46,014 INFO L226 Difference]: Without dead ends: 241 [2018-07-25 13:27:46,015 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1774 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=600, Invalid=31980, Unknown=0, NotChecked=0, Total=32580 [2018-07-25 13:27:46,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-07-25 13:27:46,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-07-25 13:27:46,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-07-25 13:27:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 242 transitions. [2018-07-25 13:27:46,305 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 242 transitions. Word has length 238 [2018-07-25 13:27:46,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:46,305 INFO L472 AbstractCegarLoop]: Abstraction has 241 states and 242 transitions. [2018-07-25 13:27:46,305 INFO L473 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-07-25 13:27:46,305 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 242 transitions. [2018-07-25 13:27:46,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-07-25 13:27:46,306 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:46,306 INFO L354 BasicCegarLoop]: trace histogram [60, 59, 59, 58, 1, 1, 1, 1] [2018-07-25 13:27:46,306 INFO L415 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:46,306 INFO L82 PathProgramCache]: Analyzing trace with hash -276935347, now seen corresponding path program 116 times [2018-07-25 13:27:46,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:46,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6962 backedges. 3422 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:46,476 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:46,476 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-25 13:27:46,477 INFO L451 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-25 13:27:46,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-25 13:27:46,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=2012, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:27:46,477 INFO L87 Difference]: Start difference. First operand 241 states and 242 transitions. Second operand 63 states. [2018-07-25 13:27:46,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:46,896 INFO L93 Difference]: Finished difference Result 245 states and 246 transitions. [2018-07-25 13:27:46,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-07-25 13:27:46,896 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 240 [2018-07-25 13:27:46,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:46,897 INFO L225 Difference]: With dead ends: 245 [2018-07-25 13:27:46,897 INFO L226 Difference]: Without dead ends: 243 [2018-07-25 13:27:46,898 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3480 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 13:27:46,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-07-25 13:27:47,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-07-25 13:27:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-07-25 13:27:47,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 244 transitions. [2018-07-25 13:27:47,173 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 244 transitions. Word has length 240 [2018-07-25 13:27:47,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:47,173 INFO L472 AbstractCegarLoop]: Abstraction has 243 states and 244 transitions. [2018-07-25 13:27:47,173 INFO L473 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-25 13:27:47,173 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 244 transitions. [2018-07-25 13:27:47,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-07-25 13:27:47,174 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:47,174 INFO L354 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1, 1, 1] [2018-07-25 13:27:47,174 INFO L415 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:47,174 INFO L82 PathProgramCache]: Analyzing trace with hash 153156231, now seen corresponding path program 117 times [2018-07-25 13:27:47,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:47,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 7080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:47,941 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:47,941 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-07-25 13:27:47,942 INFO L451 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-07-25 13:27:47,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-07-25 13:27:47,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 13:27:47,943 INFO L87 Difference]: Start difference. First operand 243 states and 244 transitions. Second operand 122 states. [2018-07-25 13:27:50,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:50,887 INFO L93 Difference]: Finished difference Result 367 states and 369 transitions. [2018-07-25 13:27:50,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-07-25 13:27:50,887 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 242 [2018-07-25 13:27:50,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:50,887 INFO L225 Difference]: With dead ends: 367 [2018-07-25 13:27:50,887 INFO L226 Difference]: Without dead ends: 245 [2018-07-25 13:27:50,889 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1834 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=610, Invalid=33062, Unknown=0, NotChecked=0, Total=33672 [2018-07-25 13:27:50,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-07-25 13:27:51,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-07-25 13:27:51,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-07-25 13:27:51,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 246 transitions. [2018-07-25 13:27:51,199 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 246 transitions. Word has length 242 [2018-07-25 13:27:51,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:51,199 INFO L472 AbstractCegarLoop]: Abstraction has 245 states and 246 transitions. [2018-07-25 13:27:51,199 INFO L473 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-07-25 13:27:51,199 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 246 transitions. [2018-07-25 13:27:51,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-07-25 13:27:51,200 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:51,200 INFO L354 BasicCegarLoop]: trace histogram [61, 60, 60, 59, 1, 1, 1, 1] [2018-07-25 13:27:51,200 INFO L415 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:51,200 INFO L82 PathProgramCache]: Analyzing trace with hash 316115649, now seen corresponding path program 118 times [2018-07-25 13:27:51,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:51,409 INFO L134 CoverageAnalysis]: Checked inductivity of 7200 backedges. 3540 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:51,410 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:51,410 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-25 13:27:51,410 INFO L451 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-25 13:27:51,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-25 13:27:51,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:27:51,411 INFO L87 Difference]: Start difference. First operand 245 states and 246 transitions. Second operand 64 states. [2018-07-25 13:27:51,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:51,892 INFO L93 Difference]: Finished difference Result 249 states and 250 transitions. [2018-07-25 13:27:51,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-07-25 13:27:51,892 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 244 [2018-07-25 13:27:51,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:51,892 INFO L225 Difference]: With dead ends: 249 [2018-07-25 13:27:51,893 INFO L226 Difference]: Without dead ends: 247 [2018-07-25 13:27:51,894 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3599 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 13:27:51,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-07-25 13:27:52,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-07-25 13:27:52,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-07-25 13:27:52,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2018-07-25 13:27:52,211 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 244 [2018-07-25 13:27:52,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:52,211 INFO L472 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2018-07-25 13:27:52,211 INFO L473 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-25 13:27:52,211 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2018-07-25 13:27:52,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-07-25 13:27:52,212 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:52,212 INFO L354 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1, 1, 1] [2018-07-25 13:27:52,213 INFO L415 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:52,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1155486981, now seen corresponding path program 119 times [2018-07-25 13:27:52,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:53,057 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 7320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:53,057 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:53,057 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-07-25 13:27:53,057 INFO L451 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-07-25 13:27:53,058 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-07-25 13:27:53,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 13:27:53,059 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 124 states. [2018-07-25 13:27:55,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:55,986 INFO L93 Difference]: Finished difference Result 373 states and 375 transitions. [2018-07-25 13:27:55,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-07-25 13:27:55,987 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 246 [2018-07-25 13:27:55,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:55,987 INFO L225 Difference]: With dead ends: 373 [2018-07-25 13:27:55,987 INFO L226 Difference]: Without dead ends: 249 [2018-07-25 13:27:55,990 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1895 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=620, Invalid=34162, Unknown=0, NotChecked=0, Total=34782 [2018-07-25 13:27:55,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-07-25 13:27:56,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-07-25 13:27:56,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-07-25 13:27:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 250 transitions. [2018-07-25 13:27:56,312 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 250 transitions. Word has length 246 [2018-07-25 13:27:56,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:56,312 INFO L472 AbstractCegarLoop]: Abstraction has 249 states and 250 transitions. [2018-07-25 13:27:56,312 INFO L473 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-07-25 13:27:56,313 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 250 transitions. [2018-07-25 13:27:56,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-07-25 13:27:56,313 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:56,313 INFO L354 BasicCegarLoop]: trace histogram [62, 61, 61, 60, 1, 1, 1, 1] [2018-07-25 13:27:56,313 INFO L415 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:56,314 INFO L82 PathProgramCache]: Analyzing trace with hash -364868043, now seen corresponding path program 120 times [2018-07-25 13:27:56,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:56,538 INFO L134 CoverageAnalysis]: Checked inductivity of 7442 backedges. 3660 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:56,538 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:56,538 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-25 13:27:56,538 INFO L451 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-25 13:27:56,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-25 13:27:56,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2019, Invalid=2141, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:27:56,539 INFO L87 Difference]: Start difference. First operand 249 states and 250 transitions. Second operand 65 states. [2018-07-25 13:27:57,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:27:57,042 INFO L93 Difference]: Finished difference Result 253 states and 254 transitions. [2018-07-25 13:27:57,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-07-25 13:27:57,042 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 248 [2018-07-25 13:27:57,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:27:57,043 INFO L225 Difference]: With dead ends: 253 [2018-07-25 13:27:57,043 INFO L226 Difference]: Without dead ends: 251 [2018-07-25 13:27:57,044 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3720 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 13:27:57,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-07-25 13:27:57,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-07-25 13:27:57,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-07-25 13:27:57,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 252 transitions. [2018-07-25 13:27:57,370 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 252 transitions. Word has length 248 [2018-07-25 13:27:57,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:27:57,370 INFO L472 AbstractCegarLoop]: Abstraction has 251 states and 252 transitions. [2018-07-25 13:27:57,370 INFO L473 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-25 13:27:57,370 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 252 transitions. [2018-07-25 13:27:57,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-07-25 13:27:57,371 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:27:57,371 INFO L354 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1, 1, 1] [2018-07-25 13:27:57,371 INFO L415 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:27:57,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1549181295, now seen corresponding path program 121 times [2018-07-25 13:27:57,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:27:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:27:58,214 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 0 proven. 7564 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:27:58,214 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:27:58,215 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-07-25 13:27:58,215 INFO L451 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-07-25 13:27:58,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-07-25 13:27:58,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 13:27:58,216 INFO L87 Difference]: Start difference. First operand 251 states and 252 transitions. Second operand 126 states. [2018-07-25 13:28:01,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:01,273 INFO L93 Difference]: Finished difference Result 379 states and 381 transitions. [2018-07-25 13:28:01,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-07-25 13:28:01,274 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 250 [2018-07-25 13:28:01,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:01,274 INFO L225 Difference]: With dead ends: 379 [2018-07-25 13:28:01,274 INFO L226 Difference]: Without dead ends: 253 [2018-07-25 13:28:01,276 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1957 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=630, Invalid=35280, Unknown=0, NotChecked=0, Total=35910 [2018-07-25 13:28:01,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-07-25 13:28:01,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-07-25 13:28:01,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-07-25 13:28:01,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 254 transitions. [2018-07-25 13:28:01,613 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 254 transitions. Word has length 250 [2018-07-25 13:28:01,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:01,613 INFO L472 AbstractCegarLoop]: Abstraction has 253 states and 254 transitions. [2018-07-25 13:28:01,613 INFO L473 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-07-25 13:28:01,613 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 254 transitions. [2018-07-25 13:28:01,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-07-25 13:28:01,614 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:01,614 INFO L354 BasicCegarLoop]: trace histogram [63, 62, 62, 61, 1, 1, 1, 1] [2018-07-25 13:28:01,614 INFO L415 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:01,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1711167401, now seen corresponding path program 122 times [2018-07-25 13:28:01,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:01,826 INFO L134 CoverageAnalysis]: Checked inductivity of 7688 backedges. 3782 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:01,827 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:01,827 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-25 13:28:01,827 INFO L451 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-25 13:28:01,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-25 13:28:01,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:28:01,828 INFO L87 Difference]: Start difference. First operand 253 states and 254 transitions. Second operand 66 states. [2018-07-25 13:28:02,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:02,356 INFO L93 Difference]: Finished difference Result 257 states and 258 transitions. [2018-07-25 13:28:02,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-07-25 13:28:02,357 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 252 [2018-07-25 13:28:02,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:02,357 INFO L225 Difference]: With dead ends: 257 [2018-07-25 13:28:02,357 INFO L226 Difference]: Without dead ends: 255 [2018-07-25 13:28:02,358 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3843 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 13:28:02,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-07-25 13:28:02,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-07-25 13:28:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-07-25 13:28:02,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 256 transitions. [2018-07-25 13:28:02,699 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 256 transitions. Word has length 252 [2018-07-25 13:28:02,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:02,699 INFO L472 AbstractCegarLoop]: Abstraction has 255 states and 256 transitions. [2018-07-25 13:28:02,699 INFO L473 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-25 13:28:02,699 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 256 transitions. [2018-07-25 13:28:02,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-07-25 13:28:02,700 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:02,700 INFO L354 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1, 1, 1] [2018-07-25 13:28:02,700 INFO L415 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:02,700 INFO L82 PathProgramCache]: Analyzing trace with hash -540549661, now seen corresponding path program 123 times [2018-07-25 13:28:02,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:03,623 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:03,623 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:03,624 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-07-25 13:28:03,624 INFO L451 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-07-25 13:28:03,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-07-25 13:28:03,625 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 13:28:03,625 INFO L87 Difference]: Start difference. First operand 255 states and 256 transitions. Second operand 128 states. [2018-07-25 13:28:06,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:06,849 INFO L93 Difference]: Finished difference Result 385 states and 387 transitions. [2018-07-25 13:28:06,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-07-25 13:28:06,849 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 254 [2018-07-25 13:28:06,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:06,850 INFO L225 Difference]: With dead ends: 385 [2018-07-25 13:28:06,850 INFO L226 Difference]: Without dead ends: 257 [2018-07-25 13:28:06,852 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2020 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=640, Invalid=36416, Unknown=0, NotChecked=0, Total=37056 [2018-07-25 13:28:06,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-07-25 13:28:07,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2018-07-25 13:28:07,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-07-25 13:28:07,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 258 transitions. [2018-07-25 13:28:07,191 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 258 transitions. Word has length 254 [2018-07-25 13:28:07,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:07,191 INFO L472 AbstractCegarLoop]: Abstraction has 257 states and 258 transitions. [2018-07-25 13:28:07,191 INFO L473 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-07-25 13:28:07,191 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 258 transitions. [2018-07-25 13:28:07,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-07-25 13:28:07,192 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:07,192 INFO L354 BasicCegarLoop]: trace histogram [64, 63, 63, 62, 1, 1, 1, 1] [2018-07-25 13:28:07,192 INFO L415 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:07,193 INFO L82 PathProgramCache]: Analyzing trace with hash -975837411, now seen corresponding path program 124 times [2018-07-25 13:28:07,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:07,418 INFO L134 CoverageAnalysis]: Checked inductivity of 7938 backedges. 3906 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:07,418 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:07,418 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-25 13:28:07,418 INFO L451 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-25 13:28:07,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-25 13:28:07,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2148, Invalid=2274, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:28:07,419 INFO L87 Difference]: Start difference. First operand 257 states and 258 transitions. Second operand 67 states. [2018-07-25 13:28:07,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:07,994 INFO L93 Difference]: Finished difference Result 261 states and 262 transitions. [2018-07-25 13:28:07,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-07-25 13:28:07,994 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 256 [2018-07-25 13:28:07,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:07,995 INFO L225 Difference]: With dead ends: 261 [2018-07-25 13:28:07,995 INFO L226 Difference]: Without dead ends: 259 [2018-07-25 13:28:07,996 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3968 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 13:28:07,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-07-25 13:28:08,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-07-25 13:28:08,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-07-25 13:28:08,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 260 transitions. [2018-07-25 13:28:08,348 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 260 transitions. Word has length 256 [2018-07-25 13:28:08,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:08,348 INFO L472 AbstractCegarLoop]: Abstraction has 259 states and 260 transitions. [2018-07-25 13:28:08,348 INFO L473 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-25 13:28:08,348 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 260 transitions. [2018-07-25 13:28:08,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-07-25 13:28:08,349 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:08,349 INFO L354 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1, 1, 1] [2018-07-25 13:28:08,350 INFO L415 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:08,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1476829097, now seen corresponding path program 125 times [2018-07-25 13:28:08,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:09,251 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 8064 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:09,251 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:09,251 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-07-25 13:28:09,252 INFO L451 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-07-25 13:28:09,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-07-25 13:28:09,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 13:28:09,253 INFO L87 Difference]: Start difference. First operand 259 states and 260 transitions. Second operand 130 states. [2018-07-25 13:28:12,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:12,569 INFO L93 Difference]: Finished difference Result 391 states and 393 transitions. [2018-07-25 13:28:12,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-07-25 13:28:12,570 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 258 [2018-07-25 13:28:12,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:12,570 INFO L225 Difference]: With dead ends: 391 [2018-07-25 13:28:12,570 INFO L226 Difference]: Without dead ends: 261 [2018-07-25 13:28:12,572 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2084 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=650, Invalid=37570, Unknown=0, NotChecked=0, Total=38220 [2018-07-25 13:28:12,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-07-25 13:28:12,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2018-07-25 13:28:12,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-07-25 13:28:12,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 262 transitions. [2018-07-25 13:28:12,926 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 262 transitions. Word has length 258 [2018-07-25 13:28:12,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:12,927 INFO L472 AbstractCegarLoop]: Abstraction has 261 states and 262 transitions. [2018-07-25 13:28:12,927 INFO L473 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-07-25 13:28:12,927 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 262 transitions. [2018-07-25 13:28:12,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-07-25 13:28:12,928 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:12,928 INFO L354 BasicCegarLoop]: trace histogram [65, 64, 64, 63, 1, 1, 1, 1] [2018-07-25 13:28:12,928 INFO L415 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:12,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1493974161, now seen corresponding path program 126 times [2018-07-25 13:28:12,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:13,157 INFO L134 CoverageAnalysis]: Checked inductivity of 8192 backedges. 4032 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:13,158 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:13,158 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-25 13:28:13,158 INFO L451 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-25 13:28:13,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-25 13:28:13,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2214, Invalid=2342, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 13:28:13,160 INFO L87 Difference]: Start difference. First operand 261 states and 262 transitions. Second operand 68 states. [2018-07-25 13:28:13,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:13,715 INFO L93 Difference]: Finished difference Result 265 states and 266 transitions. [2018-07-25 13:28:13,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-07-25 13:28:13,715 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 260 [2018-07-25 13:28:13,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:13,716 INFO L225 Difference]: With dead ends: 265 [2018-07-25 13:28:13,716 INFO L226 Difference]: Without dead ends: 263 [2018-07-25 13:28:13,718 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4095 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 13:28:13,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-07-25 13:28:14,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-07-25 13:28:14,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-07-25 13:28:14,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 264 transitions. [2018-07-25 13:28:14,075 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 264 transitions. Word has length 260 [2018-07-25 13:28:14,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:14,075 INFO L472 AbstractCegarLoop]: Abstraction has 263 states and 264 transitions. [2018-07-25 13:28:14,075 INFO L473 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-25 13:28:14,076 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 264 transitions. [2018-07-25 13:28:14,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-07-25 13:28:14,076 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:14,076 INFO L354 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1, 1, 1] [2018-07-25 13:28:14,076 INFO L415 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:14,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1190144203, now seen corresponding path program 127 times [2018-07-25 13:28:14,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:14,997 INFO L134 CoverageAnalysis]: Checked inductivity of 8320 backedges. 0 proven. 8320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:14,998 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:14,998 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-07-25 13:28:14,998 INFO L451 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-07-25 13:28:14,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-07-25 13:28:15,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 13:28:15,000 INFO L87 Difference]: Start difference. First operand 263 states and 264 transitions. Second operand 132 states. [2018-07-25 13:28:18,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:18,335 INFO L93 Difference]: Finished difference Result 397 states and 399 transitions. [2018-07-25 13:28:18,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-07-25 13:28:18,335 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 262 [2018-07-25 13:28:18,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:18,336 INFO L225 Difference]: With dead ends: 397 [2018-07-25 13:28:18,336 INFO L226 Difference]: Without dead ends: 265 [2018-07-25 13:28:18,338 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2149 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=660, Invalid=38742, Unknown=0, NotChecked=0, Total=39402 [2018-07-25 13:28:18,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-07-25 13:28:18,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2018-07-25 13:28:18,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-07-25 13:28:18,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 266 transitions. [2018-07-25 13:28:18,699 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 266 transitions. Word has length 262 [2018-07-25 13:28:18,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:18,699 INFO L472 AbstractCegarLoop]: Abstraction has 265 states and 266 transitions. [2018-07-25 13:28:18,699 INFO L473 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-07-25 13:28:18,699 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 266 transitions. [2018-07-25 13:28:18,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-07-25 13:28:18,700 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:18,700 INFO L354 BasicCegarLoop]: trace histogram [66, 65, 65, 64, 1, 1, 1, 1] [2018-07-25 13:28:18,700 INFO L415 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:18,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1046894597, now seen corresponding path program 128 times [2018-07-25 13:28:18,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:18,951 INFO L134 CoverageAnalysis]: Checked inductivity of 8450 backedges. 4160 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:18,952 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:18,952 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-25 13:28:18,952 INFO L451 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-25 13:28:18,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-25 13:28:18,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2281, Invalid=2411, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:28:18,953 INFO L87 Difference]: Start difference. First operand 265 states and 266 transitions. Second operand 69 states. [2018-07-25 13:28:19,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:19,515 INFO L93 Difference]: Finished difference Result 269 states and 270 transitions. [2018-07-25 13:28:19,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-07-25 13:28:19,515 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 264 [2018-07-25 13:28:19,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:19,516 INFO L225 Difference]: With dead ends: 269 [2018-07-25 13:28:19,516 INFO L226 Difference]: Without dead ends: 267 [2018-07-25 13:28:19,517 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 13:28:19,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-07-25 13:28:19,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-07-25 13:28:19,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-07-25 13:28:19,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 268 transitions. [2018-07-25 13:28:19,893 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 268 transitions. Word has length 264 [2018-07-25 13:28:19,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:19,893 INFO L472 AbstractCegarLoop]: Abstraction has 267 states and 268 transitions. [2018-07-25 13:28:19,893 INFO L473 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-25 13:28:19,893 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 268 transitions. [2018-07-25 13:28:19,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-07-25 13:28:19,894 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:19,894 INFO L354 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1, 1, 1] [2018-07-25 13:28:19,894 INFO L415 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:19,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1043412799, now seen corresponding path program 129 times [2018-07-25 13:28:19,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:20,830 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 0 proven. 8580 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:20,831 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:20,831 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-07-25 13:28:20,831 INFO L451 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-07-25 13:28:20,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-07-25 13:28:20,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 13:28:20,832 INFO L87 Difference]: Start difference. First operand 267 states and 268 transitions. Second operand 134 states. [2018-07-25 13:28:24,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:24,298 INFO L93 Difference]: Finished difference Result 403 states and 405 transitions. [2018-07-25 13:28:24,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-07-25 13:28:24,299 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 266 [2018-07-25 13:28:24,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:24,299 INFO L225 Difference]: With dead ends: 403 [2018-07-25 13:28:24,299 INFO L226 Difference]: Without dead ends: 269 [2018-07-25 13:28:24,301 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2215 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=670, Invalid=39932, Unknown=0, NotChecked=0, Total=40602 [2018-07-25 13:28:24,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-07-25 13:28:24,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-07-25 13:28:24,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-07-25 13:28:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 270 transitions. [2018-07-25 13:28:24,688 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 270 transitions. Word has length 266 [2018-07-25 13:28:24,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:24,688 INFO L472 AbstractCegarLoop]: Abstraction has 269 states and 270 transitions. [2018-07-25 13:28:24,688 INFO L473 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-07-25 13:28:24,688 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 270 transitions. [2018-07-25 13:28:24,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-07-25 13:28:24,689 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:24,689 INFO L354 BasicCegarLoop]: trace histogram [67, 66, 66, 65, 1, 1, 1, 1] [2018-07-25 13:28:24,689 INFO L415 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:24,689 INFO L82 PathProgramCache]: Analyzing trace with hash 606681465, now seen corresponding path program 130 times [2018-07-25 13:28:24,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:24,897 INFO L134 CoverageAnalysis]: Checked inductivity of 8712 backedges. 4290 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:24,898 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:24,898 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-25 13:28:24,898 INFO L451 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-25 13:28:24,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-25 13:28:24,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2349, Invalid=2481, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:28:24,899 INFO L87 Difference]: Start difference. First operand 269 states and 270 transitions. Second operand 70 states. [2018-07-25 13:28:25,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:25,472 INFO L93 Difference]: Finished difference Result 273 states and 274 transitions. [2018-07-25 13:28:25,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-07-25 13:28:25,472 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 268 [2018-07-25 13:28:25,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:25,473 INFO L225 Difference]: With dead ends: 273 [2018-07-25 13:28:25,473 INFO L226 Difference]: Without dead ends: 271 [2018-07-25 13:28:25,474 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4355 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 13:28:25,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-07-25 13:28:25,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-07-25 13:28:25,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-07-25 13:28:25,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 272 transitions. [2018-07-25 13:28:25,869 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 272 transitions. Word has length 268 [2018-07-25 13:28:25,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:25,870 INFO L472 AbstractCegarLoop]: Abstraction has 271 states and 272 transitions. [2018-07-25 13:28:25,870 INFO L473 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-25 13:28:25,870 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 272 transitions. [2018-07-25 13:28:25,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-07-25 13:28:25,871 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:25,871 INFO L354 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1, 1, 1] [2018-07-25 13:28:25,871 INFO L415 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:25,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1094612045, now seen corresponding path program 131 times [2018-07-25 13:28:25,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:26,866 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 8844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:26,866 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:26,866 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-07-25 13:28:26,867 INFO L451 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-07-25 13:28:26,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-07-25 13:28:26,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 13:28:26,868 INFO L87 Difference]: Start difference. First operand 271 states and 272 transitions. Second operand 136 states. [2018-07-25 13:28:30,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:30,473 INFO L93 Difference]: Finished difference Result 409 states and 411 transitions. [2018-07-25 13:28:30,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-07-25 13:28:30,473 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 270 [2018-07-25 13:28:30,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:30,474 INFO L225 Difference]: With dead ends: 409 [2018-07-25 13:28:30,474 INFO L226 Difference]: Without dead ends: 273 [2018-07-25 13:28:30,476 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2282 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=680, Invalid=41140, Unknown=0, NotChecked=0, Total=41820 [2018-07-25 13:28:30,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-07-25 13:28:30,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-07-25 13:28:30,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-07-25 13:28:30,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 274 transitions. [2018-07-25 13:28:30,837 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 274 transitions. Word has length 270 [2018-07-25 13:28:30,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:30,838 INFO L472 AbstractCegarLoop]: Abstraction has 273 states and 274 transitions. [2018-07-25 13:28:30,838 INFO L473 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-07-25 13:28:30,838 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 274 transitions. [2018-07-25 13:28:30,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-07-25 13:28:30,838 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:30,838 INFO L354 BasicCegarLoop]: trace histogram [68, 67, 67, 66, 1, 1, 1, 1] [2018-07-25 13:28:30,839 INFO L415 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:30,839 INFO L82 PathProgramCache]: Analyzing trace with hash 135913709, now seen corresponding path program 132 times [2018-07-25 13:28:30,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:31,138 INFO L134 CoverageAnalysis]: Checked inductivity of 8978 backedges. 4422 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:31,138 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:31,139 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-25 13:28:31,139 INFO L451 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-25 13:28:31,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-25 13:28:31,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2418, Invalid=2552, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:28:31,140 INFO L87 Difference]: Start difference. First operand 273 states and 274 transitions. Second operand 71 states. [2018-07-25 13:28:31,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:31,749 INFO L93 Difference]: Finished difference Result 277 states and 278 transitions. [2018-07-25 13:28:31,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-07-25 13:28:31,749 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 272 [2018-07-25 13:28:31,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:31,750 INFO L225 Difference]: With dead ends: 277 [2018-07-25 13:28:31,750 INFO L226 Difference]: Without dead ends: 275 [2018-07-25 13:28:31,752 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4488 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 13:28:31,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-07-25 13:28:32,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-07-25 13:28:32,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-07-25 13:28:32,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 276 transitions. [2018-07-25 13:28:32,144 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 276 transitions. Word has length 272 [2018-07-25 13:28:32,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:32,144 INFO L472 AbstractCegarLoop]: Abstraction has 275 states and 276 transitions. [2018-07-25 13:28:32,145 INFO L473 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-25 13:28:32,145 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 276 transitions. [2018-07-25 13:28:32,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-07-25 13:28:32,145 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:32,145 INFO L354 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1, 1, 1] [2018-07-25 13:28:32,146 INFO L415 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:32,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1764107815, now seen corresponding path program 133 times [2018-07-25 13:28:32,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:33,209 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 9112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:33,210 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:33,210 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-07-25 13:28:33,210 INFO L451 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-07-25 13:28:33,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-07-25 13:28:33,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 13:28:33,211 INFO L87 Difference]: Start difference. First operand 275 states and 276 transitions. Second operand 138 states. [2018-07-25 13:28:36,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:36,852 INFO L93 Difference]: Finished difference Result 415 states and 417 transitions. [2018-07-25 13:28:36,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-07-25 13:28:36,852 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 274 [2018-07-25 13:28:36,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:36,853 INFO L225 Difference]: With dead ends: 415 [2018-07-25 13:28:36,853 INFO L226 Difference]: Without dead ends: 277 [2018-07-25 13:28:36,856 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2350 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=690, Invalid=42366, Unknown=0, NotChecked=0, Total=43056 [2018-07-25 13:28:36,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-07-25 13:28:37,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-07-25 13:28:37,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-07-25 13:28:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 278 transitions. [2018-07-25 13:28:37,224 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 278 transitions. Word has length 274 [2018-07-25 13:28:37,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:37,224 INFO L472 AbstractCegarLoop]: Abstraction has 277 states and 278 transitions. [2018-07-25 13:28:37,224 INFO L473 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-07-25 13:28:37,224 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 278 transitions. [2018-07-25 13:28:37,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-07-25 13:28:37,225 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:37,225 INFO L354 BasicCegarLoop]: trace histogram [69, 68, 68, 67, 1, 1, 1, 1] [2018-07-25 13:28:37,225 INFO L415 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:37,225 INFO L82 PathProgramCache]: Analyzing trace with hash -142782879, now seen corresponding path program 134 times [2018-07-25 13:28:37,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:37,521 INFO L134 CoverageAnalysis]: Checked inductivity of 9248 backedges. 4556 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:37,521 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:37,521 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-25 13:28:37,521 INFO L451 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-25 13:28:37,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-25 13:28:37,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2488, Invalid=2624, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:28:37,522 INFO L87 Difference]: Start difference. First operand 277 states and 278 transitions. Second operand 72 states. [2018-07-25 13:28:38,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:38,154 INFO L93 Difference]: Finished difference Result 281 states and 282 transitions. [2018-07-25 13:28:38,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-07-25 13:28:38,154 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 276 [2018-07-25 13:28:38,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:38,155 INFO L225 Difference]: With dead ends: 281 [2018-07-25 13:28:38,155 INFO L226 Difference]: Without dead ends: 279 [2018-07-25 13:28:38,156 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4623 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 13:28:38,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-07-25 13:28:38,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-07-25 13:28:38,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-07-25 13:28:38,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 280 transitions. [2018-07-25 13:28:38,633 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 280 transitions. Word has length 276 [2018-07-25 13:28:38,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:38,633 INFO L472 AbstractCegarLoop]: Abstraction has 279 states and 280 transitions. [2018-07-25 13:28:38,633 INFO L473 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-25 13:28:38,633 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 280 transitions. [2018-07-25 13:28:38,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-07-25 13:28:38,634 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:38,634 INFO L354 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1, 1, 1] [2018-07-25 13:28:38,634 INFO L415 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:38,634 INFO L82 PathProgramCache]: Analyzing trace with hash 224659099, now seen corresponding path program 135 times [2018-07-25 13:28:38,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:39,816 INFO L134 CoverageAnalysis]: Checked inductivity of 9384 backedges. 0 proven. 9384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:39,817 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:39,817 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-07-25 13:28:39,817 INFO L451 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-07-25 13:28:39,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-07-25 13:28:39,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 13:28:39,819 INFO L87 Difference]: Start difference. First operand 279 states and 280 transitions. Second operand 140 states. [2018-07-25 13:28:43,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:43,634 INFO L93 Difference]: Finished difference Result 421 states and 423 transitions. [2018-07-25 13:28:43,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-07-25 13:28:43,634 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 278 [2018-07-25 13:28:43,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:43,635 INFO L225 Difference]: With dead ends: 421 [2018-07-25 13:28:43,635 INFO L226 Difference]: Without dead ends: 281 [2018-07-25 13:28:43,637 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2419 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=700, Invalid=43610, Unknown=0, NotChecked=0, Total=44310 [2018-07-25 13:28:43,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-07-25 13:28:44,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-07-25 13:28:44,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-07-25 13:28:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 282 transitions. [2018-07-25 13:28:44,054 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 282 transitions. Word has length 278 [2018-07-25 13:28:44,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:44,054 INFO L472 AbstractCegarLoop]: Abstraction has 281 states and 282 transitions. [2018-07-25 13:28:44,054 INFO L473 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-07-25 13:28:44,055 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 282 transitions. [2018-07-25 13:28:44,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-07-25 13:28:44,055 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:44,055 INFO L354 BasicCegarLoop]: trace histogram [70, 69, 69, 68, 1, 1, 1, 1] [2018-07-25 13:28:44,055 INFO L415 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:44,056 INFO L82 PathProgramCache]: Analyzing trace with hash -820477483, now seen corresponding path program 136 times [2018-07-25 13:28:44,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:44,315 INFO L134 CoverageAnalysis]: Checked inductivity of 9522 backedges. 4692 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:44,316 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:44,316 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-25 13:28:44,316 INFO L451 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-25 13:28:44,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-25 13:28:44,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2559, Invalid=2697, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:28:44,317 INFO L87 Difference]: Start difference. First operand 281 states and 282 transitions. Second operand 73 states. [2018-07-25 13:28:44,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:44,983 INFO L93 Difference]: Finished difference Result 285 states and 286 transitions. [2018-07-25 13:28:44,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-07-25 13:28:44,983 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 280 [2018-07-25 13:28:44,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:44,984 INFO L225 Difference]: With dead ends: 285 [2018-07-25 13:28:44,984 INFO L226 Difference]: Without dead ends: 283 [2018-07-25 13:28:44,985 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4760 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 13:28:44,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-07-25 13:28:45,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-07-25 13:28:45,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-07-25 13:28:45,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 284 transitions. [2018-07-25 13:28:45,405 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 284 transitions. Word has length 280 [2018-07-25 13:28:45,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:45,406 INFO L472 AbstractCegarLoop]: Abstraction has 283 states and 284 transitions. [2018-07-25 13:28:45,406 INFO L473 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-25 13:28:45,406 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 284 transitions. [2018-07-25 13:28:45,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-07-25 13:28:45,407 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:45,407 INFO L354 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1, 1, 1] [2018-07-25 13:28:45,407 INFO L415 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:45,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1795173647, now seen corresponding path program 137 times [2018-07-25 13:28:45,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:46,544 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 0 proven. 9660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:46,545 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:46,545 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-07-25 13:28:46,545 INFO L451 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-07-25 13:28:46,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-07-25 13:28:46,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 13:28:46,546 INFO L87 Difference]: Start difference. First operand 283 states and 284 transitions. Second operand 142 states. [2018-07-25 13:28:50,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:50,362 INFO L93 Difference]: Finished difference Result 427 states and 429 transitions. [2018-07-25 13:28:50,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-07-25 13:28:50,362 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 282 [2018-07-25 13:28:50,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:50,363 INFO L225 Difference]: With dead ends: 427 [2018-07-25 13:28:50,363 INFO L226 Difference]: Without dead ends: 285 [2018-07-25 13:28:50,365 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2489 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=710, Invalid=44872, Unknown=0, NotChecked=0, Total=45582 [2018-07-25 13:28:50,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-07-25 13:28:50,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-07-25 13:28:50,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-07-25 13:28:50,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 286 transitions. [2018-07-25 13:28:50,767 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 286 transitions. Word has length 282 [2018-07-25 13:28:50,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:50,767 INFO L472 AbstractCegarLoop]: Abstraction has 285 states and 286 transitions. [2018-07-25 13:28:50,767 INFO L473 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-07-25 13:28:50,767 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 286 transitions. [2018-07-25 13:28:50,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-07-25 13:28:50,768 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:50,768 INFO L354 BasicCegarLoop]: trace histogram [71, 70, 70, 69, 1, 1, 1, 1] [2018-07-25 13:28:50,768 INFO L415 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:50,768 INFO L82 PathProgramCache]: Analyzing trace with hash -80708791, now seen corresponding path program 138 times [2018-07-25 13:28:50,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:51,023 INFO L134 CoverageAnalysis]: Checked inductivity of 9800 backedges. 4830 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:51,023 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:51,023 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-25 13:28:51,024 INFO L451 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-25 13:28:51,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-25 13:28:51,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2631, Invalid=2771, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:28:51,024 INFO L87 Difference]: Start difference. First operand 285 states and 286 transitions. Second operand 74 states. [2018-07-25 13:28:51,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:51,729 INFO L93 Difference]: Finished difference Result 289 states and 290 transitions. [2018-07-25 13:28:51,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-07-25 13:28:51,730 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 284 [2018-07-25 13:28:51,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:51,730 INFO L225 Difference]: With dead ends: 289 [2018-07-25 13:28:51,730 INFO L226 Difference]: Without dead ends: 287 [2018-07-25 13:28:51,731 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4899 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 13:28:51,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-07-25 13:28:52,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-07-25 13:28:52,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-07-25 13:28:52,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 288 transitions. [2018-07-25 13:28:52,116 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 288 transitions. Word has length 284 [2018-07-25 13:28:52,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:52,116 INFO L472 AbstractCegarLoop]: Abstraction has 287 states and 288 transitions. [2018-07-25 13:28:52,116 INFO L473 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-25 13:28:52,116 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 288 transitions. [2018-07-25 13:28:52,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-07-25 13:28:52,117 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:52,117 INFO L354 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1, 1, 1] [2018-07-25 13:28:52,117 INFO L415 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:52,117 INFO L82 PathProgramCache]: Analyzing trace with hash -251684477, now seen corresponding path program 139 times [2018-07-25 13:28:52,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:53,218 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 9940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:53,218 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:53,218 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-07-25 13:28:53,218 INFO L451 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-07-25 13:28:53,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-07-25 13:28:53,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=20307, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 13:28:53,220 INFO L87 Difference]: Start difference. First operand 287 states and 288 transitions. Second operand 144 states. [2018-07-25 13:28:57,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:57,302 INFO L93 Difference]: Finished difference Result 433 states and 435 transitions. [2018-07-25 13:28:57,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-07-25 13:28:57,302 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 286 [2018-07-25 13:28:57,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:57,303 INFO L225 Difference]: With dead ends: 433 [2018-07-25 13:28:57,303 INFO L226 Difference]: Without dead ends: 289 [2018-07-25 13:28:57,305 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2560 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=720, Invalid=46152, Unknown=0, NotChecked=0, Total=46872 [2018-07-25 13:28:57,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-07-25 13:28:57,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2018-07-25 13:28:57,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-07-25 13:28:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 290 transitions. [2018-07-25 13:28:57,745 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 290 transitions. Word has length 286 [2018-07-25 13:28:57,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:57,746 INFO L472 AbstractCegarLoop]: Abstraction has 289 states and 290 transitions. [2018-07-25 13:28:57,746 INFO L473 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-07-25 13:28:57,746 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 290 transitions. [2018-07-25 13:28:57,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-07-25 13:28:57,746 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:57,747 INFO L354 BasicCegarLoop]: trace histogram [72, 71, 71, 70, 1, 1, 1, 1] [2018-07-25 13:28:57,747 INFO L415 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:57,747 INFO L82 PathProgramCache]: Analyzing trace with hash 931805885, now seen corresponding path program 140 times [2018-07-25 13:28:57,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:28:58,026 INFO L134 CoverageAnalysis]: Checked inductivity of 10082 backedges. 4970 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:28:58,026 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:28:58,026 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-25 13:28:58,027 INFO L451 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-25 13:28:58,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-25 13:28:58,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2704, Invalid=2846, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:28:58,027 INFO L87 Difference]: Start difference. First operand 289 states and 290 transitions. Second operand 75 states. [2018-07-25 13:28:58,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:28:58,753 INFO L93 Difference]: Finished difference Result 293 states and 294 transitions. [2018-07-25 13:28:58,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-07-25 13:28:58,753 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 288 [2018-07-25 13:28:58,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:28:58,754 INFO L225 Difference]: With dead ends: 293 [2018-07-25 13:28:58,754 INFO L226 Difference]: Without dead ends: 291 [2018-07-25 13:28:58,755 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5040 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 13:28:58,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-07-25 13:28:59,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2018-07-25 13:28:59,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-07-25 13:28:59,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 292 transitions. [2018-07-25 13:28:59,209 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 292 transitions. Word has length 288 [2018-07-25 13:28:59,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:28:59,209 INFO L472 AbstractCegarLoop]: Abstraction has 291 states and 292 transitions. [2018-07-25 13:28:59,209 INFO L473 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-25 13:28:59,209 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 292 transitions. [2018-07-25 13:28:59,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-07-25 13:28:59,210 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:28:59,210 INFO L354 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1, 1, 1] [2018-07-25 13:28:59,210 INFO L415 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:28:59,210 INFO L82 PathProgramCache]: Analyzing trace with hash 2112310263, now seen corresponding path program 141 times [2018-07-25 13:28:59,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:28:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 10224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:00,392 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:00,392 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-07-25 13:29:00,392 INFO L451 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-07-25 13:29:00,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-07-25 13:29:00,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=20881, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 13:29:00,393 INFO L87 Difference]: Start difference. First operand 291 states and 292 transitions. Second operand 146 states. [2018-07-25 13:29:04,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:04,758 INFO L93 Difference]: Finished difference Result 439 states and 441 transitions. [2018-07-25 13:29:04,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-07-25 13:29:04,758 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 290 [2018-07-25 13:29:04,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:04,759 INFO L225 Difference]: With dead ends: 439 [2018-07-25 13:29:04,759 INFO L226 Difference]: Without dead ends: 293 [2018-07-25 13:29:04,761 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2632 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=730, Invalid=47450, Unknown=0, NotChecked=0, Total=48180 [2018-07-25 13:29:04,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-07-25 13:29:05,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-07-25 13:29:05,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-07-25 13:29:05,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 294 transitions. [2018-07-25 13:29:05,179 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 294 transitions. Word has length 290 [2018-07-25 13:29:05,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:05,179 INFO L472 AbstractCegarLoop]: Abstraction has 293 states and 294 transitions. [2018-07-25 13:29:05,179 INFO L473 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-07-25 13:29:05,179 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 294 transitions. [2018-07-25 13:29:05,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-07-25 13:29:05,180 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:05,180 INFO L354 BasicCegarLoop]: trace histogram [73, 72, 72, 71, 1, 1, 1, 1] [2018-07-25 13:29:05,180 INFO L415 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:05,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1332396081, now seen corresponding path program 142 times [2018-07-25 13:29:05,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:05,464 INFO L134 CoverageAnalysis]: Checked inductivity of 10368 backedges. 5112 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:05,465 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:05,465 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-25 13:29:05,465 INFO L451 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-25 13:29:05,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-25 13:29:05,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2778, Invalid=2922, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:29:05,466 INFO L87 Difference]: Start difference. First operand 293 states and 294 transitions. Second operand 76 states. [2018-07-25 13:29:06,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:06,202 INFO L93 Difference]: Finished difference Result 297 states and 298 transitions. [2018-07-25 13:29:06,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-07-25 13:29:06,202 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 292 [2018-07-25 13:29:06,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:06,203 INFO L225 Difference]: With dead ends: 297 [2018-07-25 13:29:06,203 INFO L226 Difference]: Without dead ends: 295 [2018-07-25 13:29:06,204 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5183 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 13:29:06,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-07-25 13:29:06,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-07-25 13:29:06,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-07-25 13:29:06,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2018-07-25 13:29:06,643 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 292 [2018-07-25 13:29:06,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:06,643 INFO L472 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2018-07-25 13:29:06,643 INFO L473 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-25 13:29:06,643 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2018-07-25 13:29:06,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-07-25 13:29:06,644 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:06,644 INFO L354 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1, 1, 1] [2018-07-25 13:29:06,644 INFO L415 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:06,645 INFO L82 PathProgramCache]: Analyzing trace with hash 532431979, now seen corresponding path program 143 times [2018-07-25 13:29:06,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:07,804 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 10512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:07,804 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:07,804 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-07-25 13:29:07,804 INFO L451 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-07-25 13:29:07,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-07-25 13:29:07,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=21463, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 13:29:07,806 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 148 states. [2018-07-25 13:29:12,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:12,075 INFO L93 Difference]: Finished difference Result 445 states and 447 transitions. [2018-07-25 13:29:12,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-07-25 13:29:12,076 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 294 [2018-07-25 13:29:12,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:12,077 INFO L225 Difference]: With dead ends: 445 [2018-07-25 13:29:12,077 INFO L226 Difference]: Without dead ends: 297 [2018-07-25 13:29:12,079 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2705 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=740, Invalid=48766, Unknown=0, NotChecked=0, Total=49506 [2018-07-25 13:29:12,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-07-25 13:29:12,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2018-07-25 13:29:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-07-25 13:29:12,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 298 transitions. [2018-07-25 13:29:12,542 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 298 transitions. Word has length 294 [2018-07-25 13:29:12,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:12,542 INFO L472 AbstractCegarLoop]: Abstraction has 297 states and 298 transitions. [2018-07-25 13:29:12,542 INFO L473 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-07-25 13:29:12,542 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 298 transitions. [2018-07-25 13:29:12,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-07-25 13:29:12,543 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:12,543 INFO L354 BasicCegarLoop]: trace histogram [74, 73, 73, 72, 1, 1, 1, 1] [2018-07-25 13:29:12,543 INFO L415 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:12,544 INFO L82 PathProgramCache]: Analyzing trace with hash -577303643, now seen corresponding path program 144 times [2018-07-25 13:29:12,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:12,838 INFO L134 CoverageAnalysis]: Checked inductivity of 10658 backedges. 5256 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:12,838 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:12,838 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-25 13:29:12,839 INFO L451 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-25 13:29:12,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-25 13:29:12,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2853, Invalid=2999, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:29:12,840 INFO L87 Difference]: Start difference. First operand 297 states and 298 transitions. Second operand 77 states. [2018-07-25 13:29:13,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:13,591 INFO L93 Difference]: Finished difference Result 301 states and 302 transitions. [2018-07-25 13:29:13,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-07-25 13:29:13,591 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 296 [2018-07-25 13:29:13,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:13,592 INFO L225 Difference]: With dead ends: 301 [2018-07-25 13:29:13,592 INFO L226 Difference]: Without dead ends: 299 [2018-07-25 13:29:13,594 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5328 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 13:29:13,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-07-25 13:29:14,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2018-07-25 13:29:14,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-07-25 13:29:14,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 300 transitions. [2018-07-25 13:29:14,068 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 300 transitions. Word has length 296 [2018-07-25 13:29:14,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:14,068 INFO L472 AbstractCegarLoop]: Abstraction has 299 states and 300 transitions. [2018-07-25 13:29:14,068 INFO L473 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-25 13:29:14,068 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 300 transitions. [2018-07-25 13:29:14,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-07-25 13:29:14,069 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:14,069 INFO L354 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1, 1, 1] [2018-07-25 13:29:14,069 INFO L415 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:14,069 INFO L82 PathProgramCache]: Analyzing trace with hash -737967393, now seen corresponding path program 145 times [2018-07-25 13:29:14,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:15,312 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 10804 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:15,312 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:15,313 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-07-25 13:29:15,313 INFO L451 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-07-25 13:29:15,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-07-25 13:29:15,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=22053, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 13:29:15,314 INFO L87 Difference]: Start difference. First operand 299 states and 300 transitions. Second operand 150 states. [2018-07-25 13:29:19,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:19,741 INFO L93 Difference]: Finished difference Result 451 states and 453 transitions. [2018-07-25 13:29:19,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-07-25 13:29:19,741 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 298 [2018-07-25 13:29:19,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:19,742 INFO L225 Difference]: With dead ends: 451 [2018-07-25 13:29:19,742 INFO L226 Difference]: Without dead ends: 301 [2018-07-25 13:29:19,744 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2779 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=750, Invalid=50100, Unknown=0, NotChecked=0, Total=50850 [2018-07-25 13:29:19,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-07-25 13:29:20,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-07-25 13:29:20,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-07-25 13:29:20,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 302 transitions. [2018-07-25 13:29:20,273 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 302 transitions. Word has length 298 [2018-07-25 13:29:20,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:20,273 INFO L472 AbstractCegarLoop]: Abstraction has 301 states and 302 transitions. [2018-07-25 13:29:20,273 INFO L473 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-07-25 13:29:20,273 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 302 transitions. [2018-07-25 13:29:20,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-07-25 13:29:20,274 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:20,274 INFO L354 BasicCegarLoop]: trace histogram [75, 74, 74, 73, 1, 1, 1, 1] [2018-07-25 13:29:20,274 INFO L415 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:20,274 INFO L82 PathProgramCache]: Analyzing trace with hash 206839065, now seen corresponding path program 146 times [2018-07-25 13:29:20,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 10952 backedges. 5402 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:20,541 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:20,541 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-25 13:29:20,541 INFO L451 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-25 13:29:20,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-25 13:29:20,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2929, Invalid=3077, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:29:20,542 INFO L87 Difference]: Start difference. First operand 301 states and 302 transitions. Second operand 78 states. [2018-07-25 13:29:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:21,304 INFO L93 Difference]: Finished difference Result 305 states and 306 transitions. [2018-07-25 13:29:21,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-07-25 13:29:21,304 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 300 [2018-07-25 13:29:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:21,305 INFO L225 Difference]: With dead ends: 305 [2018-07-25 13:29:21,305 INFO L226 Difference]: Without dead ends: 303 [2018-07-25 13:29:21,307 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5475 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 13:29:21,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-07-25 13:29:21,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-07-25 13:29:21,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-07-25 13:29:21,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 304 transitions. [2018-07-25 13:29:21,740 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 304 transitions. Word has length 300 [2018-07-25 13:29:21,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:21,740 INFO L472 AbstractCegarLoop]: Abstraction has 303 states and 304 transitions. [2018-07-25 13:29:21,740 INFO L473 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-25 13:29:21,740 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 304 transitions. [2018-07-25 13:29:21,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-07-25 13:29:21,741 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:21,741 INFO L354 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1, 1, 1] [2018-07-25 13:29:21,741 INFO L415 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:21,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1203898195, now seen corresponding path program 147 times [2018-07-25 13:29:21,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:22,988 INFO L134 CoverageAnalysis]: Checked inductivity of 11100 backedges. 0 proven. 11100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:22,988 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:22,988 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-07-25 13:29:22,988 INFO L451 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-07-25 13:29:22,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-07-25 13:29:22,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=22651, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 13:29:22,989 INFO L87 Difference]: Start difference. First operand 303 states and 304 transitions. Second operand 152 states. [2018-07-25 13:29:27,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:27,405 INFO L93 Difference]: Finished difference Result 457 states and 459 transitions. [2018-07-25 13:29:27,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-07-25 13:29:27,405 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 302 [2018-07-25 13:29:27,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:27,406 INFO L225 Difference]: With dead ends: 457 [2018-07-25 13:29:27,406 INFO L226 Difference]: Without dead ends: 305 [2018-07-25 13:29:27,408 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2854 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=760, Invalid=51452, Unknown=0, NotChecked=0, Total=52212 [2018-07-25 13:29:27,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-07-25 13:29:27,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2018-07-25 13:29:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-07-25 13:29:27,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 306 transitions. [2018-07-25 13:29:27,895 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 306 transitions. Word has length 302 [2018-07-25 13:29:27,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:27,895 INFO L472 AbstractCegarLoop]: Abstraction has 305 states and 306 transitions. [2018-07-25 13:29:27,895 INFO L473 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-07-25 13:29:27,896 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 306 transitions. [2018-07-25 13:29:27,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-07-25 13:29:27,896 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:27,896 INFO L354 BasicCegarLoop]: trace histogram [76, 75, 75, 74, 1, 1, 1, 1] [2018-07-25 13:29:27,897 INFO L415 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:27,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1432810637, now seen corresponding path program 148 times [2018-07-25 13:29:27,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:28,265 INFO L134 CoverageAnalysis]: Checked inductivity of 11250 backedges. 5550 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:28,266 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:28,266 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-25 13:29:28,266 INFO L451 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-25 13:29:28,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-25 13:29:28,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3006, Invalid=3156, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:29:28,267 INFO L87 Difference]: Start difference. First operand 305 states and 306 transitions. Second operand 79 states. [2018-07-25 13:29:29,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:29:29,042 INFO L93 Difference]: Finished difference Result 309 states and 310 transitions. [2018-07-25 13:29:29,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-07-25 13:29:29,042 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 304 [2018-07-25 13:29:29,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:29:29,043 INFO L225 Difference]: With dead ends: 309 [2018-07-25 13:29:29,043 INFO L226 Difference]: Without dead ends: 307 [2018-07-25 13:29:29,045 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5624 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 13:29:29,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-07-25 13:29:29,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-07-25 13:29:29,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-07-25 13:29:29,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 308 transitions. [2018-07-25 13:29:29,538 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 308 transitions. Word has length 304 [2018-07-25 13:29:29,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:29:29,538 INFO L472 AbstractCegarLoop]: Abstraction has 307 states and 308 transitions. [2018-07-25 13:29:29,538 INFO L473 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-25 13:29:29,538 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 308 transitions. [2018-07-25 13:29:29,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-07-25 13:29:29,539 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:29:29,539 INFO L354 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1, 1, 1] [2018-07-25 13:29:29,539 INFO L415 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:29:29,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1753427513, now seen corresponding path program 149 times [2018-07-25 13:29:29,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:29:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:29:30,789 INFO L134 CoverageAnalysis]: Checked inductivity of 11400 backedges. 0 proven. 11400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:29:30,789 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:29:30,789 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-07-25 13:29:30,790 INFO L451 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-07-25 13:29:30,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-07-25 13:29:30,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=23257, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 13:29:30,791 INFO L87 Difference]: Start difference. First operand 307 states and 308 transitions. Second operand 154 states. Received shutdown request... [2018-07-25 13:29:33,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-25 13:29:33,640 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 13:29:33,645 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 13:29:33,645 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:29:33 BoogieIcfgContainer [2018-07-25 13:29:33,645 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:29:33,646 INFO L168 Benchmark]: Toolchain (without parser) took 235628.85 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.0 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-07-25 13:29:33,648 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 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:29:33,648 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.75 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:29:33,649 INFO L168 Benchmark]: Boogie Preprocessor took 23.30 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:29:33,649 INFO L168 Benchmark]: RCFGBuilder took 251.57 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:29:33,650 INFO L168 Benchmark]: TraceAbstraction took 235305.44 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.0 GB). Peak memory consumption was 997.8 MB. Max. memory is 7.1 GB. [2018-07-25 13:29:33,652 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.17 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 43.75 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 23.30 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 251.57 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 235305.44 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.0 GB). Peak memory consumption was 997.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 80). Cancelled while BasicCegarLoop was constructing difference of abstraction (307states) and interpolant automaton (currently 118 states, 154 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 194 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. TIMEOUT Result, 235.2s OverallTime, 151 OverallIterations, 76 TraceHistogramMax, 156.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9117 SDtfs, 4045 SDslu, 595540 SDs, 0 SdLazy, 616287 SolverSat, 5747 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 44.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17662 GetRequests, 2926 SyntacticMatches, 0 SemanticMatches, 14735 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217545 ImplicationChecksByTransitivity, 81.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=307occurred in iteration=150, 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: 27.8s AutomataMinimizationTime, 150 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 4.5s SatisfiabilityAnalysisTime, 40.7s InterpolantComputationTime, 23556 NumberOfCodeBlocks, 23556 NumberOfCodeBlocksAsserted, 151 NumberOfCheckSat, 23405 ConstructedInterpolants, 0 QuantifiedInterpolants, 21922685 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 151 InterpolantComputations, 1 PerfectInterpolantSequences, 140600/579500 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/invert_string.i_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-29-33-663.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/invert_string.i_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-29-33-663.csv Completed graceful shutdown