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/20170319-ConjunctivePathPrograms/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:19:49,887 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:19:49,889 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:19:49,901 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:19:49,901 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:19:49,902 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:19:49,904 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:19:49,906 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:19:49,907 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:19:49,908 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:19:49,910 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:19:49,910 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:19:49,911 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:19:49,912 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:19:49,913 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:19:49,914 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:19:49,918 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:19:49,923 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:19:49,928 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:19:49,933 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:19:49,934 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:19:49,935 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:19:49,937 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:19:49,938 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:19:49,938 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:19:49,939 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:19:49,940 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:19:49,940 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:19:49,941 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:19:49,942 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:19:49,942 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:19:49,943 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:19:49,943 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:19:49,943 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:19:49,944 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:19:49,945 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:19:49,945 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:19:49,953 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:19:49,954 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:19:49,955 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:19:49,955 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:19:49,955 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:19:49,956 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:19:49,956 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:19:49,956 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:19:50,007 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:19:50,020 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:19:50,023 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:19:50,024 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:19:50,025 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:19:50,025 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl [2018-07-25 13:19:50,026 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl' [2018-07-25 13:19:50,079 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:19:50,082 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:19:50,083 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:19:50,083 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:19:50,084 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:19:50,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:19:50" (1/1) ... [2018-07-25 13:19:50,118 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:19:50" (1/1) ... [2018-07-25 13:19:50,125 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:19:50,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:19:50,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:19:50,127 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:19:50,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:19:50" (1/1) ... [2018-07-25 13:19:50,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:19:50" (1/1) ... [2018-07-25 13:19:50,140 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:19:50" (1/1) ... [2018-07-25 13:19:50,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:19:50" (1/1) ... [2018-07-25 13:19:50,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:19:50" (1/1) ... [2018-07-25 13:19:50,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:19:50" (1/1) ... [2018-07-25 13:19:50,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:19:50" (1/1) ... [2018-07-25 13:19:50,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:19:50,152 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:19:50,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:19:50,157 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:19:50,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:19:50" (1/1) ... [2018-07-25 13:19:50,245 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-07-25 13:19:50,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 13:19:50,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 13:19:50,416 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 13:19:50,417 INFO L202 PluginConnector]: Adding new model fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:19:50 BoogieIcfgContainer [2018-07-25 13:19:50,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:19:50,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:19:50,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:19:50,422 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:19:50,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:19:50" (1/2) ... [2018-07-25 13:19:50,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d7e0b and model type fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:19:50, skipping insertion in model container [2018-07-25 13:19:50,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:19:50" (2/2) ... [2018-07-25 13:19:50,426 INFO L112 eAbstractionObserver]: Analyzing ICFG fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl [2018-07-25 13:19:50,436 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:19:50,445 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:19:50,489 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:19:50,490 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:19:50,491 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:19:50,491 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:19:50,491 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:19:50,491 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:19:50,491 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:19:50,492 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:19:50,492 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:19:50,506 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-07-25 13:19:50,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:19:50,515 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:50,516 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-07-25 13:19:50,517 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:50,521 INFO L82 PathProgramCache]: Analyzing trace with hash 889618619, now seen corresponding path program 1 times [2018-07-25 13:19:50,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:50,592 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:19:50,595 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:19:50,595 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:19:50,600 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:19:50,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:19:50,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:19:50,616 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2018-07-25 13:19:50,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:50,644 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-07-25 13:19:50,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:19:50,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2018-07-25 13:19:50,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:50,658 INFO L225 Difference]: With dead ends: 14 [2018-07-25 13:19:50,658 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 13:19:50,662 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:19:50,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 13:19:50,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 13:19:50,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 13:19:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-07-25 13:19:50,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-07-25 13:19:50,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:50,701 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-07-25 13:19:50,701 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:19:50,702 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-07-25 13:19:50,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:19:50,702 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:50,702 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:19:50,703 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:50,703 INFO L82 PathProgramCache]: Analyzing trace with hash 141442743, now seen corresponding path program 1 times [2018-07-25 13:19:50,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:50,733 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:19:50,733 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:50,733 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 13:19:50,736 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:19:50,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:19:50,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:19:50,737 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2018-07-25 13:19:50,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:50,762 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-07-25 13:19:50,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:19:50,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-07-25 13:19:50,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:50,765 INFO L225 Difference]: With dead ends: 15 [2018-07-25 13:19:50,765 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 13:19:50,766 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:19:50,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 13:19:50,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 13:19:50,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 13:19:50,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-07-25 13:19:50,770 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-07-25 13:19:50,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:50,771 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-07-25 13:19:50,771 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:19:50,771 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-07-25 13:19:50,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:19:50,772 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:50,772 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-07-25 13:19:50,772 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:50,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1596035661, now seen corresponding path program 2 times [2018-07-25 13:19:50,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:50,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:50,810 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:50,810 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:19:50,811 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:19:50,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:19:50,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:19:50,812 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 5 states. [2018-07-25 13:19:50,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:50,839 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-07-25 13:19:50,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:19:50,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-07-25 13:19:50,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:50,844 INFO L225 Difference]: With dead ends: 17 [2018-07-25 13:19:50,844 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 13:19:50,845 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:19:50,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 13:19:50,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 13:19:50,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 13:19:50,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-07-25 13:19:50,849 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-07-25 13:19:50,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:50,850 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-07-25 13:19:50,850 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:19:50,850 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-07-25 13:19:50,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:19:50,851 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:50,851 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2018-07-25 13:19:50,852 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:50,852 INFO L82 PathProgramCache]: Analyzing trace with hash -570503761, now seen corresponding path program 3 times [2018-07-25 13:19:50,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:50,902 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:19:50,903 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:50,903 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:19:50,906 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:19:50,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:19:50,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:19:50,907 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 6 states. [2018-07-25 13:19:50,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:50,946 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-07-25 13:19:50,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:19:50,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-07-25 13:19:50,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:50,953 INFO L225 Difference]: With dead ends: 19 [2018-07-25 13:19:50,953 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 13:19:50,954 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:19:50,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 13:19:50,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 13:19:50,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 13:19:50,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-07-25 13:19:50,961 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-07-25 13:19:50,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:50,961 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-07-25 13:19:50,961 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:19:50,962 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-07-25 13:19:50,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 13:19:50,962 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:50,963 INFO L354 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2018-07-25 13:19:50,963 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:50,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1418141355, now seen corresponding path program 4 times [2018-07-25 13:19:50,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:51,042 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:51,042 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:51,042 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:19:51,043 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:19:51,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:19:51,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:19:51,044 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2018-07-25 13:19:51,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:51,064 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-07-25 13:19:51,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:19:51,064 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-07-25 13:19:51,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:51,065 INFO L225 Difference]: With dead ends: 21 [2018-07-25 13:19:51,065 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 13:19:51,066 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:19:51,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 13:19:51,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 13:19:51,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 13:19:51,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-07-25 13:19:51,071 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-07-25 13:19:51,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:51,071 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-07-25 13:19:51,071 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:19:51,072 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-07-25 13:19:51,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:19:51,072 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:51,073 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2018-07-25 13:19:51,073 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:51,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1245651111, now seen corresponding path program 5 times [2018-07-25 13:19:51,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:51,125 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:51,126 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:51,126 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:19:51,127 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:19:51,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:19:51,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:19:51,128 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 8 states. [2018-07-25 13:19:51,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:51,148 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-07-25 13:19:51,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:19:51,149 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-07-25 13:19:51,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:51,150 INFO L225 Difference]: With dead ends: 23 [2018-07-25 13:19:51,150 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 13:19:51,151 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:19:51,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 13:19:51,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 13:19:51,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 13:19:51,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-07-25 13:19:51,156 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-07-25 13:19:51,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:51,156 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-07-25 13:19:51,156 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:19:51,156 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-07-25 13:19:51,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:19:51,157 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:51,157 INFO L354 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1] [2018-07-25 13:19:51,158 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:51,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1308716125, now seen corresponding path program 6 times [2018-07-25 13:19:51,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:51,206 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:51,206 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:51,206 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:19:51,207 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:19:51,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:19:51,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:19:51,208 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 9 states. [2018-07-25 13:19:51,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:51,228 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-07-25 13:19:51,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:19:51,229 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-07-25 13:19:51,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:51,230 INFO L225 Difference]: With dead ends: 25 [2018-07-25 13:19:51,230 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 13:19:51,231 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:19:51,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 13:19:51,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 13:19:51,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 13:19:51,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-07-25 13:19:51,241 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-07-25 13:19:51,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:51,241 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-07-25 13:19:51,241 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:19:51,241 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-07-25 13:19:51,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:19:51,242 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:51,243 INFO L354 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1] [2018-07-25 13:19:51,244 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:51,244 INFO L82 PathProgramCache]: Analyzing trace with hash 665663391, now seen corresponding path program 7 times [2018-07-25 13:19:51,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:51,310 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:51,310 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:51,311 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:19:51,311 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:19:51,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:19:51,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:19:51,312 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 10 states. [2018-07-25 13:19:51,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:51,333 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-07-25 13:19:51,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:19:51,333 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-07-25 13:19:51,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:51,334 INFO L225 Difference]: With dead ends: 27 [2018-07-25 13:19:51,334 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 13:19:51,335 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:19:51,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 13:19:51,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 13:19:51,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 13:19:51,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-07-25 13:19:51,341 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-07-25 13:19:51,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:51,341 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-07-25 13:19:51,342 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:19:51,342 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-07-25 13:19:51,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:19:51,343 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:51,343 INFO L354 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1] [2018-07-25 13:19:51,343 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:51,344 INFO L82 PathProgramCache]: Analyzing trace with hash -331166565, now seen corresponding path program 8 times [2018-07-25 13:19:51,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:51,396 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:51,397 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:51,397 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:19:51,397 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:19:51,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:19:51,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:19:51,398 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 11 states. [2018-07-25 13:19:51,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:51,420 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-07-25 13:19:51,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:19:51,420 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-07-25 13:19:51,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:51,421 INFO L225 Difference]: With dead ends: 29 [2018-07-25 13:19:51,421 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 13:19:51,422 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:19:51,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 13:19:51,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 13:19:51,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 13:19:51,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-07-25 13:19:51,428 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-07-25 13:19:51,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:51,429 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-07-25 13:19:51,429 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:19:51,429 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-07-25 13:19:51,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 13:19:51,430 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:51,430 INFO L354 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1] [2018-07-25 13:19:51,430 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:51,431 INFO L82 PathProgramCache]: Analyzing trace with hash -507047273, now seen corresponding path program 9 times [2018-07-25 13:19:51,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:51,483 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:51,483 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:51,484 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:19:51,484 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:19:51,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:19:51,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:19:51,485 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 12 states. [2018-07-25 13:19:51,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:51,518 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-07-25 13:19:51,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:19:51,519 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-07-25 13:19:51,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:51,523 INFO L225 Difference]: With dead ends: 31 [2018-07-25 13:19:51,523 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 13:19:51,524 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:19:51,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 13:19:51,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 13:19:51,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 13:19:51,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-07-25 13:19:51,534 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-07-25 13:19:51,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:51,534 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-07-25 13:19:51,534 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:19:51,535 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-07-25 13:19:51,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 13:19:51,536 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:51,536 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1] [2018-07-25 13:19:51,537 INFO L415 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:51,537 INFO L82 PathProgramCache]: Analyzing trace with hash -2024683117, now seen corresponding path program 10 times [2018-07-25 13:19:51,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:51,641 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:51,641 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:51,642 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:19:51,642 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:19:51,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:19:51,643 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:19:51,643 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 13 states. [2018-07-25 13:19:51,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:51,660 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-07-25 13:19:51,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:19:51,660 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2018-07-25 13:19:51,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:51,661 INFO L225 Difference]: With dead ends: 33 [2018-07-25 13:19:51,662 INFO L226 Difference]: Without dead ends: 29 [2018-07-25 13:19:51,662 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:19:51,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-25 13:19:51,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-25 13:19:51,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 13:19:51,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-07-25 13:19:51,668 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-07-25 13:19:51,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:51,668 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-07-25 13:19:51,669 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:19:51,669 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-07-25 13:19:51,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 13:19:51,670 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:51,670 INFO L354 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1] [2018-07-25 13:19:51,671 INFO L415 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:51,671 INFO L82 PathProgramCache]: Analyzing trace with hash -183848561, now seen corresponding path program 11 times [2018-07-25 13:19:51,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:51,727 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:51,728 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:51,728 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:19:51,728 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:19:51,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:19:51,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:19:51,729 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 14 states. [2018-07-25 13:19:51,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:51,764 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-07-25 13:19:51,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:19:51,766 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2018-07-25 13:19:51,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:51,767 INFO L225 Difference]: With dead ends: 35 [2018-07-25 13:19:51,769 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 13:19:51,769 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:19:51,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 13:19:51,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-25 13:19:51,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 13:19:51,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-07-25 13:19:51,777 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-07-25 13:19:51,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:51,778 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-07-25 13:19:51,778 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:19:51,778 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-07-25 13:19:51,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 13:19:51,780 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:51,780 INFO L354 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1] [2018-07-25 13:19:51,781 INFO L415 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:51,781 INFO L82 PathProgramCache]: Analyzing trace with hash -668366197, now seen corresponding path program 12 times [2018-07-25 13:19:51,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:51,845 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:51,846 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:51,846 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:19:51,847 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:19:51,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:19:51,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:19:51,848 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 15 states. [2018-07-25 13:19:51,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:51,862 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-07-25 13:19:51,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:19:51,863 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2018-07-25 13:19:51,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:51,863 INFO L225 Difference]: With dead ends: 37 [2018-07-25 13:19:51,864 INFO L226 Difference]: Without dead ends: 33 [2018-07-25 13:19:51,864 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:19:51,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-25 13:19:51,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-25 13:19:51,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-25 13:19:51,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-07-25 13:19:51,870 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2018-07-25 13:19:51,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:51,870 INFO L472 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-07-25 13:19:51,870 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:19:51,870 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-07-25 13:19:51,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-25 13:19:51,871 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:51,872 INFO L354 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1] [2018-07-25 13:19:51,872 INFO L415 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:51,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1861620871, now seen corresponding path program 13 times [2018-07-25 13:19:51,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:51,944 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:51,945 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:51,945 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:19:51,949 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:19:51,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:19:51,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:19:51,950 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 16 states. [2018-07-25 13:19:51,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:51,978 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-07-25 13:19:51,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:19:51,979 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2018-07-25 13:19:51,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:51,980 INFO L225 Difference]: With dead ends: 39 [2018-07-25 13:19:51,980 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 13:19:51,980 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:19:51,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 13:19:51,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 13:19:51,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 13:19:51,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-07-25 13:19:51,985 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-07-25 13:19:51,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:51,986 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-07-25 13:19:51,986 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:19:51,986 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-07-25 13:19:51,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 13:19:51,987 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:51,987 INFO L354 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1] [2018-07-25 13:19:51,989 INFO L415 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:51,990 INFO L82 PathProgramCache]: Analyzing trace with hash -2067263613, now seen corresponding path program 14 times [2018-07-25 13:19:51,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:52,058 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:52,058 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:52,059 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 13:19:52,059 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 13:19:52,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 13:19:52,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:19:52,061 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 17 states. [2018-07-25 13:19:52,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:52,082 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-07-25 13:19:52,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:19:52,083 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2018-07-25 13:19:52,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:52,084 INFO L225 Difference]: With dead ends: 41 [2018-07-25 13:19:52,084 INFO L226 Difference]: Without dead ends: 37 [2018-07-25 13:19:52,084 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:19:52,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-25 13:19:52,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-25 13:19:52,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 13:19:52,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-07-25 13:19:52,094 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2018-07-25 13:19:52,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:52,095 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-07-25 13:19:52,095 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 13:19:52,095 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-07-25 13:19:52,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 13:19:52,096 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:52,096 INFO L354 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1] [2018-07-25 13:19:52,098 INFO L415 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:52,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1845967743, now seen corresponding path program 15 times [2018-07-25 13:19:52,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:52,169 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:52,170 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:52,173 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 13:19:52,174 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 13:19:52,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 13:19:52,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:19:52,175 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 18 states. [2018-07-25 13:19:52,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:52,199 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-07-25 13:19:52,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:19:52,199 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2018-07-25 13:19:52,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:52,200 INFO L225 Difference]: With dead ends: 43 [2018-07-25 13:19:52,200 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 13:19:52,201 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:19:52,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 13:19:52,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-25 13:19:52,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-25 13:19:52,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-07-25 13:19:52,211 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-07-25 13:19:52,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:52,212 INFO L472 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-07-25 13:19:52,212 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 13:19:52,212 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-07-25 13:19:52,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-25 13:19:52,213 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:52,213 INFO L354 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1] [2018-07-25 13:19:52,215 INFO L415 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:52,216 INFO L82 PathProgramCache]: Analyzing trace with hash 69949563, now seen corresponding path program 16 times [2018-07-25 13:19:52,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:52,287 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:52,288 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:52,288 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 13:19:52,288 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 13:19:52,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 13:19:52,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:19:52,289 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 19 states. [2018-07-25 13:19:52,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:52,311 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-07-25 13:19:52,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:19:52,312 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2018-07-25 13:19:52,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:52,313 INFO L225 Difference]: With dead ends: 45 [2018-07-25 13:19:52,313 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 13:19:52,313 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:19:52,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 13:19:52,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-25 13:19:52,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 13:19:52,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-07-25 13:19:52,322 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-07-25 13:19:52,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:52,322 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-07-25 13:19:52,323 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 13:19:52,323 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-07-25 13:19:52,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 13:19:52,323 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:52,324 INFO L354 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1] [2018-07-25 13:19:52,324 INFO L415 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:52,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1581504905, now seen corresponding path program 17 times [2018-07-25 13:19:52,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:52,424 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:52,424 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 13:19:52,425 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 13:19:52,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 13:19:52,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:19:52,427 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 20 states. [2018-07-25 13:19:52,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:52,453 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-07-25 13:19:52,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:19:52,454 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-07-25 13:19:52,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:52,454 INFO L225 Difference]: With dead ends: 47 [2018-07-25 13:19:52,455 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 13:19:52,455 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:19:52,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 13:19:52,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-25 13:19:52,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 13:19:52,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-07-25 13:19:52,461 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-07-25 13:19:52,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:52,461 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-07-25 13:19:52,462 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 13:19:52,462 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-07-25 13:19:52,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 13:19:52,463 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:52,463 INFO L354 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1] [2018-07-25 13:19:52,463 INFO L415 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:52,464 INFO L82 PathProgramCache]: Analyzing trace with hash 508650867, now seen corresponding path program 18 times [2018-07-25 13:19:52,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:52,551 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:52,551 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:52,551 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 13:19:52,552 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 13:19:52,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 13:19:52,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:19:52,553 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 21 states. [2018-07-25 13:19:52,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:52,575 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2018-07-25 13:19:52,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:19:52,575 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 42 [2018-07-25 13:19:52,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:52,578 INFO L225 Difference]: With dead ends: 49 [2018-07-25 13:19:52,578 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 13:19:52,579 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:19:52,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 13:19:52,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 13:19:52,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 13:19:52,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-07-25 13:19:52,590 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-07-25 13:19:52,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:52,590 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-07-25 13:19:52,590 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 13:19:52,590 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-07-25 13:19:52,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 13:19:52,591 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:52,592 INFO L354 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1] [2018-07-25 13:19:52,592 INFO L415 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:52,593 INFO L82 PathProgramCache]: Analyzing trace with hash -896346769, now seen corresponding path program 19 times [2018-07-25 13:19:52,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:52,681 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:52,681 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:52,681 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 13:19:52,682 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 13:19:52,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 13:19:52,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:19:52,683 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 22 states. [2018-07-25 13:19:52,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:52,704 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-07-25 13:19:52,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:19:52,704 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 44 [2018-07-25 13:19:52,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:52,705 INFO L225 Difference]: With dead ends: 51 [2018-07-25 13:19:52,705 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 13:19:52,706 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:19:52,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 13:19:52,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-25 13:19:52,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 13:19:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-07-25 13:19:52,714 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-07-25 13:19:52,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:52,715 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-07-25 13:19:52,715 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 13:19:52,715 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-07-25 13:19:52,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 13:19:52,717 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:52,717 INFO L354 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1] [2018-07-25 13:19:52,717 INFO L415 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:52,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1815623275, now seen corresponding path program 20 times [2018-07-25 13:19:52,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:52,841 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:19:52,841 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:52,841 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 13:19:52,842 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 13:19:52,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 13:19:52,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:19:52,843 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 23 states. [2018-07-25 13:19:52,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:52,875 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-07-25 13:19:52,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:19:52,875 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2018-07-25 13:19:52,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:52,876 INFO L225 Difference]: With dead ends: 53 [2018-07-25 13:19:52,876 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 13:19:52,877 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:19:52,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 13:19:52,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-25 13:19:52,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-25 13:19:52,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-07-25 13:19:52,883 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2018-07-25 13:19:52,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:52,883 INFO L472 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-07-25 13:19:52,883 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 13:19:52,883 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-07-25 13:19:52,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 13:19:52,884 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:52,884 INFO L354 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1] [2018-07-25 13:19:52,885 INFO L415 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:52,885 INFO L82 PathProgramCache]: Analyzing trace with hash 973686887, now seen corresponding path program 21 times [2018-07-25 13:19:52,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:53,004 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:53,004 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:53,005 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 13:19:53,006 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 13:19:53,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 13:19:53,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:19:53,007 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 24 states. [2018-07-25 13:19:53,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:53,025 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-07-25 13:19:53,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:19:53,025 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 48 [2018-07-25 13:19:53,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:53,026 INFO L225 Difference]: With dead ends: 55 [2018-07-25 13:19:53,031 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 13:19:53,032 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:19:53,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 13:19:53,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-25 13:19:53,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 13:19:53,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-07-25 13:19:53,042 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2018-07-25 13:19:53,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:53,042 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-07-25 13:19:53,045 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 13:19:53,046 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-07-25 13:19:53,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 13:19:53,046 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:53,046 INFO L354 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1] [2018-07-25 13:19:53,047 INFO L415 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:53,047 INFO L82 PathProgramCache]: Analyzing trace with hash -673330333, now seen corresponding path program 22 times [2018-07-25 13:19:53,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:53,164 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:53,164 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-25 13:19:53,165 INFO L451 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-25 13:19:53,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-25 13:19:53,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:19:53,166 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 25 states. [2018-07-25 13:19:53,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:53,185 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-07-25 13:19:53,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 13:19:53,185 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2018-07-25 13:19:53,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:53,186 INFO L225 Difference]: With dead ends: 57 [2018-07-25 13:19:53,186 INFO L226 Difference]: Without dead ends: 53 [2018-07-25 13:19:53,187 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:19:53,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-25 13:19:53,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-25 13:19:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-25 13:19:53,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-07-25 13:19:53,192 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2018-07-25 13:19:53,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:53,192 INFO L472 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-07-25 13:19:53,192 INFO L473 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-25 13:19:53,192 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-07-25 13:19:53,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-25 13:19:53,193 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:53,193 INFO L354 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1] [2018-07-25 13:19:53,193 INFO L415 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:53,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1386053471, now seen corresponding path program 23 times [2018-07-25 13:19:53,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:53,308 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:53,308 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:53,309 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 13:19:53,309 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 13:19:53,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 13:19:53,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:19:53,310 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 26 states. [2018-07-25 13:19:53,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:53,329 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-07-25 13:19:53,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 13:19:53,330 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 52 [2018-07-25 13:19:53,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:53,331 INFO L225 Difference]: With dead ends: 59 [2018-07-25 13:19:53,331 INFO L226 Difference]: Without dead ends: 55 [2018-07-25 13:19:53,332 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:19:53,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-25 13:19:53,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-25 13:19:53,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-25 13:19:53,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-07-25 13:19:53,336 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2018-07-25 13:19:53,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:53,336 INFO L472 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-07-25 13:19:53,337 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 13:19:53,337 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-07-25 13:19:53,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-25 13:19:53,337 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:53,337 INFO L354 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1, 1] [2018-07-25 13:19:53,338 INFO L415 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:53,338 INFO L82 PathProgramCache]: Analyzing trace with hash 473965659, now seen corresponding path program 24 times [2018-07-25 13:19:53,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:53,469 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:53,469 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:53,469 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-25 13:19:53,470 INFO L451 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-25 13:19:53,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-25 13:19:53,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:19:53,471 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 27 states. [2018-07-25 13:19:53,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:53,490 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-07-25 13:19:53,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 13:19:53,490 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 54 [2018-07-25 13:19:53,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:53,491 INFO L225 Difference]: With dead ends: 61 [2018-07-25 13:19:53,491 INFO L226 Difference]: Without dead ends: 57 [2018-07-25 13:19:53,492 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:19:53,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-25 13:19:53,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-25 13:19:53,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-25 13:19:53,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-07-25 13:19:53,501 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2018-07-25 13:19:53,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:53,501 INFO L472 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-07-25 13:19:53,501 INFO L473 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-25 13:19:53,501 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-07-25 13:19:53,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-25 13:19:53,502 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:53,502 INFO L354 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1, 1] [2018-07-25 13:19:53,502 INFO L415 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:53,503 INFO L82 PathProgramCache]: Analyzing trace with hash 130906711, now seen corresponding path program 25 times [2018-07-25 13:19:53,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:53,628 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:53,628 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:53,629 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 13:19:53,629 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 13:19:53,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 13:19:53,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:19:53,631 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 28 states. [2018-07-25 13:19:53,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:53,650 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-07-25 13:19:53,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 13:19:53,650 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 56 [2018-07-25 13:19:53,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:53,651 INFO L225 Difference]: With dead ends: 63 [2018-07-25 13:19:53,651 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 13:19:53,652 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:19:53,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 13:19:53,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-25 13:19:53,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-25 13:19:53,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-07-25 13:19:53,655 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2018-07-25 13:19:53,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:53,655 INFO L472 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-07-25 13:19:53,655 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 13:19:53,656 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-07-25 13:19:53,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-25 13:19:53,656 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:53,660 INFO L354 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1, 1] [2018-07-25 13:19:53,661 INFO L415 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:53,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1163739475, now seen corresponding path program 26 times [2018-07-25 13:19:53,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:53,808 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:53,808 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:53,809 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-25 13:19:53,809 INFO L451 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-25 13:19:53,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-25 13:19:53,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:19:53,810 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 29 states. [2018-07-25 13:19:53,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:53,842 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-07-25 13:19:53,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 13:19:53,843 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2018-07-25 13:19:53,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:53,843 INFO L225 Difference]: With dead ends: 65 [2018-07-25 13:19:53,843 INFO L226 Difference]: Without dead ends: 61 [2018-07-25 13:19:53,844 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:19:53,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-25 13:19:53,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-25 13:19:53,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-25 13:19:53,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-07-25 13:19:53,855 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2018-07-25 13:19:53,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:53,856 INFO L472 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-07-25 13:19:53,856 INFO L473 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-25 13:19:53,856 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-07-25 13:19:53,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-25 13:19:53,857 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:53,857 INFO L354 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1, 1] [2018-07-25 13:19:53,857 INFO L415 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:53,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1578580303, now seen corresponding path program 27 times [2018-07-25 13:19:53,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:54,002 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:54,002 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:54,003 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 13:19:54,003 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 13:19:54,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 13:19:54,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:19:54,004 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 30 states. [2018-07-25 13:19:54,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:54,031 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-07-25 13:19:54,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 13:19:54,031 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 60 [2018-07-25 13:19:54,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:54,032 INFO L225 Difference]: With dead ends: 67 [2018-07-25 13:19:54,032 INFO L226 Difference]: Without dead ends: 63 [2018-07-25 13:19:54,033 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:19:54,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-25 13:19:54,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-25 13:19:54,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-25 13:19:54,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-07-25 13:19:54,037 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2018-07-25 13:19:54,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:54,037 INFO L472 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-07-25 13:19:54,037 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 13:19:54,038 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-07-25 13:19:54,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-25 13:19:54,038 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:54,038 INFO L354 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1, 1] [2018-07-25 13:19:54,039 INFO L415 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:54,039 INFO L82 PathProgramCache]: Analyzing trace with hash 808657483, now seen corresponding path program 28 times [2018-07-25 13:19:54,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:54,250 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:54,250 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:54,250 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-25 13:19:54,251 INFO L451 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-25 13:19:54,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-25 13:19:54,252 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:19:54,252 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 31 states. [2018-07-25 13:19:54,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:54,276 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2018-07-25 13:19:54,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 13:19:54,277 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 62 [2018-07-25 13:19:54,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:54,278 INFO L225 Difference]: With dead ends: 69 [2018-07-25 13:19:54,278 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 13:19:54,279 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:19:54,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 13:19:54,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 13:19:54,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 13:19:54,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-07-25 13:19:54,283 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2018-07-25 13:19:54,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:54,284 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-07-25 13:19:54,284 INFO L473 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-25 13:19:54,284 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-07-25 13:19:54,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-25 13:19:54,284 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:54,285 INFO L354 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1, 1] [2018-07-25 13:19:54,285 INFO L415 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:54,285 INFO L82 PathProgramCache]: Analyzing trace with hash -352797625, now seen corresponding path program 29 times [2018-07-25 13:19:54,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:54,423 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:54,424 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:54,424 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 13:19:54,424 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 13:19:54,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 13:19:54,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:19:54,426 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 32 states. [2018-07-25 13:19:54,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:54,445 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-07-25 13:19:54,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 13:19:54,445 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 64 [2018-07-25 13:19:54,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:54,446 INFO L225 Difference]: With dead ends: 71 [2018-07-25 13:19:54,446 INFO L226 Difference]: Without dead ends: 67 [2018-07-25 13:19:54,447 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:19:54,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-25 13:19:54,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-25 13:19:54,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-25 13:19:54,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-07-25 13:19:54,451 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2018-07-25 13:19:54,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:54,451 INFO L472 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-07-25 13:19:54,451 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 13:19:54,451 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-07-25 13:19:54,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-25 13:19:54,452 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:54,452 INFO L354 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1, 1] [2018-07-25 13:19:54,452 INFO L415 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:54,452 INFO L82 PathProgramCache]: Analyzing trace with hash 180340547, now seen corresponding path program 30 times [2018-07-25 13:19:54,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:54,611 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:54,611 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:54,611 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-25 13:19:54,612 INFO L451 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-25 13:19:54,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-25 13:19:54,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:19:54,613 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 33 states. [2018-07-25 13:19:54,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:54,639 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2018-07-25 13:19:54,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 13:19:54,639 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 66 [2018-07-25 13:19:54,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:54,640 INFO L225 Difference]: With dead ends: 73 [2018-07-25 13:19:54,640 INFO L226 Difference]: Without dead ends: 69 [2018-07-25 13:19:54,641 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:19:54,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-25 13:19:54,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-25 13:19:54,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-25 13:19:54,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-07-25 13:19:54,645 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2018-07-25 13:19:54,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:54,646 INFO L472 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-07-25 13:19:54,646 INFO L473 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-25 13:19:54,646 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-07-25 13:19:54,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-25 13:19:54,646 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:54,647 INFO L354 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1, 1] [2018-07-25 13:19:54,647 INFO L415 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:54,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1425015615, now seen corresponding path program 31 times [2018-07-25 13:19:54,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:54,807 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:54,807 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:54,808 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 13:19:54,808 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 13:19:54,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 13:19:54,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:19:54,809 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 34 states. [2018-07-25 13:19:54,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:54,841 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-07-25 13:19:54,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 13:19:54,841 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 68 [2018-07-25 13:19:54,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:54,843 INFO L225 Difference]: With dead ends: 75 [2018-07-25 13:19:54,843 INFO L226 Difference]: Without dead ends: 71 [2018-07-25 13:19:54,844 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:19:54,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-25 13:19:54,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-25 13:19:54,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-25 13:19:54,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-07-25 13:19:54,847 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2018-07-25 13:19:54,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:54,847 INFO L472 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-07-25 13:19:54,847 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 13:19:54,847 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-07-25 13:19:54,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-25 13:19:54,848 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:54,848 INFO L354 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1, 1, 1] [2018-07-25 13:19:54,848 INFO L415 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:54,848 INFO L82 PathProgramCache]: Analyzing trace with hash -738119621, now seen corresponding path program 32 times [2018-07-25 13:19:54,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:54,977 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:54,977 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-25 13:19:54,977 INFO L451 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-25 13:19:54,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-25 13:19:54,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:19:54,979 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 35 states. [2018-07-25 13:19:55,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:55,006 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-07-25 13:19:55,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 13:19:55,006 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 70 [2018-07-25 13:19:55,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:55,007 INFO L225 Difference]: With dead ends: 77 [2018-07-25 13:19:55,007 INFO L226 Difference]: Without dead ends: 73 [2018-07-25 13:19:55,008 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:19:55,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-25 13:19:55,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-25 13:19:55,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-25 13:19:55,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-07-25 13:19:55,011 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2018-07-25 13:19:55,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:55,011 INFO L472 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-07-25 13:19:55,011 INFO L473 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-25 13:19:55,012 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-07-25 13:19:55,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-25 13:19:55,012 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:55,012 INFO L354 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1, 1] [2018-07-25 13:19:55,013 INFO L415 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:55,013 INFO L82 PathProgramCache]: Analyzing trace with hash -746910153, now seen corresponding path program 33 times [2018-07-25 13:19:55,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:55,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:55,155 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:55,155 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 13:19:55,155 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 13:19:55,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 13:19:55,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:19:55,157 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 36 states. [2018-07-25 13:19:55,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:55,185 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2018-07-25 13:19:55,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 13:19:55,186 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 72 [2018-07-25 13:19:55,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:55,186 INFO L225 Difference]: With dead ends: 79 [2018-07-25 13:19:55,187 INFO L226 Difference]: Without dead ends: 75 [2018-07-25 13:19:55,187 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:19:55,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-25 13:19:55,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-25 13:19:55,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-25 13:19:55,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-07-25 13:19:55,190 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2018-07-25 13:19:55,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:55,192 INFO L472 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-07-25 13:19:55,192 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 13:19:55,192 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-07-25 13:19:55,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-25 13:19:55,192 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:55,193 INFO L354 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1, 1, 1] [2018-07-25 13:19:55,193 INFO L415 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:55,193 INFO L82 PathProgramCache]: Analyzing trace with hash -604676813, now seen corresponding path program 34 times [2018-07-25 13:19:55,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:55,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:55,339 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:55,339 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-25 13:19:55,339 INFO L451 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-25 13:19:55,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-25 13:19:55,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:19:55,340 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 37 states. [2018-07-25 13:19:55,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:55,370 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-07-25 13:19:55,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 13:19:55,370 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 74 [2018-07-25 13:19:55,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:55,371 INFO L225 Difference]: With dead ends: 81 [2018-07-25 13:19:55,371 INFO L226 Difference]: Without dead ends: 77 [2018-07-25 13:19:55,372 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:19:55,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-25 13:19:55,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-25 13:19:55,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-25 13:19:55,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-07-25 13:19:55,375 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2018-07-25 13:19:55,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:55,375 INFO L472 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-07-25 13:19:55,375 INFO L473 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-25 13:19:55,375 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-07-25 13:19:55,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-25 13:19:55,376 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:55,376 INFO L354 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1, 1] [2018-07-25 13:19:55,376 INFO L415 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:55,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1357390545, now seen corresponding path program 35 times [2018-07-25 13:19:55,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:55,519 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:55,519 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 13:19:55,519 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 13:19:55,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 13:19:55,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:19:55,521 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 38 states. [2018-07-25 13:19:55,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:55,543 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-07-25 13:19:55,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 13:19:55,543 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 76 [2018-07-25 13:19:55,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:55,544 INFO L225 Difference]: With dead ends: 83 [2018-07-25 13:19:55,544 INFO L226 Difference]: Without dead ends: 79 [2018-07-25 13:19:55,545 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:19:55,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-25 13:19:55,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-25 13:19:55,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-25 13:19:55,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-07-25 13:19:55,548 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2018-07-25 13:19:55,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:55,549 INFO L472 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-07-25 13:19:55,549 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 13:19:55,549 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-07-25 13:19:55,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-25 13:19:55,549 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:55,550 INFO L354 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1, 1, 1] [2018-07-25 13:19:55,550 INFO L415 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:55,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1134186027, now seen corresponding path program 36 times [2018-07-25 13:19:55,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:55,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:55,693 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:55,693 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-25 13:19:55,693 INFO L451 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-25 13:19:55,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-25 13:19:55,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:19:55,694 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 39 states. [2018-07-25 13:19:55,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:55,724 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2018-07-25 13:19:55,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 13:19:55,724 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 78 [2018-07-25 13:19:55,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:55,725 INFO L225 Difference]: With dead ends: 85 [2018-07-25 13:19:55,725 INFO L226 Difference]: Without dead ends: 81 [2018-07-25 13:19:55,726 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:19:55,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-25 13:19:55,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-25 13:19:55,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-25 13:19:55,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-07-25 13:19:55,729 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2018-07-25 13:19:55,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:55,729 INFO L472 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-07-25 13:19:55,729 INFO L473 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-25 13:19:55,730 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-07-25 13:19:55,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-25 13:19:55,730 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:55,730 INFO L354 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1, 1] [2018-07-25 13:19:55,731 INFO L415 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:55,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1052479449, now seen corresponding path program 37 times [2018-07-25 13:19:55,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:55,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:55,879 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:55,880 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 13:19:55,880 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 13:19:55,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 13:19:55,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:19:55,881 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 40 states. [2018-07-25 13:19:55,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:55,917 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-07-25 13:19:55,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 13:19:55,917 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 80 [2018-07-25 13:19:55,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:55,918 INFO L225 Difference]: With dead ends: 87 [2018-07-25 13:19:55,918 INFO L226 Difference]: Without dead ends: 83 [2018-07-25 13:19:55,919 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:19:55,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-25 13:19:55,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-25 13:19:55,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 13:19:55,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-07-25 13:19:55,922 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2018-07-25 13:19:55,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:55,923 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-07-25 13:19:55,923 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 13:19:55,923 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-07-25 13:19:55,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-25 13:19:55,924 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:55,924 INFO L354 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1, 1, 1] [2018-07-25 13:19:55,924 INFO L415 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:55,924 INFO L82 PathProgramCache]: Analyzing trace with hash 2095973155, now seen corresponding path program 38 times [2018-07-25 13:19:55,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:56,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:56,082 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:56,083 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-25 13:19:56,083 INFO L451 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-25 13:19:56,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-25 13:19:56,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:19:56,085 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 41 states. [2018-07-25 13:19:56,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:56,127 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2018-07-25 13:19:56,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 13:19:56,127 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 82 [2018-07-25 13:19:56,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:56,128 INFO L225 Difference]: With dead ends: 89 [2018-07-25 13:19:56,129 INFO L226 Difference]: Without dead ends: 85 [2018-07-25 13:19:56,130 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:19:56,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-25 13:19:56,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-25 13:19:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 13:19:56,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-07-25 13:19:56,134 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2018-07-25 13:19:56,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:56,135 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-07-25 13:19:56,135 INFO L473 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-25 13:19:56,135 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-07-25 13:19:56,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-25 13:19:56,136 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:56,136 INFO L354 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1, 1] [2018-07-25 13:19:56,136 INFO L415 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:56,136 INFO L82 PathProgramCache]: Analyzing trace with hash -193018081, now seen corresponding path program 39 times [2018-07-25 13:19:56,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:56,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:56,339 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:56,339 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 13:19:56,339 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 13:19:56,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 13:19:56,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:19:56,341 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 42 states. [2018-07-25 13:19:56,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:56,389 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-07-25 13:19:56,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 13:19:56,389 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 84 [2018-07-25 13:19:56,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:56,390 INFO L225 Difference]: With dead ends: 91 [2018-07-25 13:19:56,390 INFO L226 Difference]: Without dead ends: 87 [2018-07-25 13:19:56,391 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:19:56,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-25 13:19:56,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-25 13:19:56,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 13:19:56,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-07-25 13:19:56,395 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2018-07-25 13:19:56,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:56,395 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-07-25 13:19:56,396 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 13:19:56,396 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-07-25 13:19:56,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-25 13:19:56,397 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:56,397 INFO L354 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1, 1, 1] [2018-07-25 13:19:56,397 INFO L415 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:56,397 INFO L82 PathProgramCache]: Analyzing trace with hash -890340325, now seen corresponding path program 40 times [2018-07-25 13:19:56,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:56,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:56,624 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:56,625 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-25 13:19:56,625 INFO L451 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-25 13:19:56,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-25 13:19:56,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:19:56,627 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 43 states. [2018-07-25 13:19:56,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:56,662 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2018-07-25 13:19:56,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 13:19:56,663 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 86 [2018-07-25 13:19:56,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:56,663 INFO L225 Difference]: With dead ends: 93 [2018-07-25 13:19:56,664 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 13:19:56,665 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:19:56,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 13:19:56,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-25 13:19:56,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 13:19:56,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-07-25 13:19:56,668 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2018-07-25 13:19:56,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:56,668 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-07-25 13:19:56,668 INFO L473 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-25 13:19:56,668 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-07-25 13:19:56,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-25 13:19:56,669 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:56,669 INFO L354 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1, 1] [2018-07-25 13:19:56,670 INFO L415 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:56,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1002118633, now seen corresponding path program 41 times [2018-07-25 13:19:56,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:56,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:56,832 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:56,832 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 13:19:56,832 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 13:19:56,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 13:19:56,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:19:56,834 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 44 states. [2018-07-25 13:19:56,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:56,860 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2018-07-25 13:19:56,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-25 13:19:56,861 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 88 [2018-07-25 13:19:56,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:56,861 INFO L225 Difference]: With dead ends: 95 [2018-07-25 13:19:56,861 INFO L226 Difference]: Without dead ends: 91 [2018-07-25 13:19:56,863 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:19:56,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-25 13:19:56,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-25 13:19:56,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-25 13:19:56,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-07-25 13:19:56,866 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2018-07-25 13:19:56,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:56,866 INFO L472 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-07-25 13:19:56,866 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 13:19:56,867 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-07-25 13:19:56,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-25 13:19:56,867 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:56,867 INFO L354 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1, 1, 1] [2018-07-25 13:19:56,868 INFO L415 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:56,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1046890221, now seen corresponding path program 42 times [2018-07-25 13:19:56,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:57,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:57,036 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:57,036 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-25 13:19:57,037 INFO L451 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-25 13:19:57,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-25 13:19:57,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:19:57,038 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 45 states. [2018-07-25 13:19:57,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:57,077 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2018-07-25 13:19:57,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 13:19:57,077 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 90 [2018-07-25 13:19:57,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:57,078 INFO L225 Difference]: With dead ends: 97 [2018-07-25 13:19:57,078 INFO L226 Difference]: Without dead ends: 93 [2018-07-25 13:19:57,079 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:19:57,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-25 13:19:57,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-25 13:19:57,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-25 13:19:57,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-07-25 13:19:57,083 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2018-07-25 13:19:57,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:57,083 INFO L472 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-07-25 13:19:57,084 INFO L473 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-25 13:19:57,084 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-07-25 13:19:57,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-25 13:19:57,085 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:57,085 INFO L354 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1, 1] [2018-07-25 13:19:57,085 INFO L415 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:57,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1122713329, now seen corresponding path program 43 times [2018-07-25 13:19:57,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:57,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:57,271 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:57,272 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-25 13:19:57,272 INFO L451 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-25 13:19:57,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-25 13:19:57,274 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:19:57,275 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 46 states. [2018-07-25 13:19:57,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:57,310 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2018-07-25 13:19:57,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 13:19:57,311 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 92 [2018-07-25 13:19:57,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:57,312 INFO L225 Difference]: With dead ends: 99 [2018-07-25 13:19:57,312 INFO L226 Difference]: Without dead ends: 95 [2018-07-25 13:19:57,313 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:19:57,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-25 13:19:57,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-25 13:19:57,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-25 13:19:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-07-25 13:19:57,317 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2018-07-25 13:19:57,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:57,317 INFO L472 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-07-25 13:19:57,318 INFO L473 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-25 13:19:57,318 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-07-25 13:19:57,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-25 13:19:57,318 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:57,319 INFO L354 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1, 1, 1] [2018-07-25 13:19:57,319 INFO L415 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:57,319 INFO L82 PathProgramCache]: Analyzing trace with hash -974276085, now seen corresponding path program 44 times [2018-07-25 13:19:57,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:57,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:57,501 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:57,501 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-25 13:19:57,501 INFO L451 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-25 13:19:57,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-25 13:19:57,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:19:57,503 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 47 states. [2018-07-25 13:19:57,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:57,536 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2018-07-25 13:19:57,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-25 13:19:57,536 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 94 [2018-07-25 13:19:57,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:57,537 INFO L225 Difference]: With dead ends: 101 [2018-07-25 13:19:57,537 INFO L226 Difference]: Without dead ends: 97 [2018-07-25 13:19:57,538 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:19:57,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-25 13:19:57,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-25 13:19:57,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-25 13:19:57,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-07-25 13:19:57,541 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2018-07-25 13:19:57,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:57,542 INFO L472 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-07-25 13:19:57,542 INFO L473 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-25 13:19:57,542 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-07-25 13:19:57,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-25 13:19:57,544 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:57,544 INFO L354 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1, 1] [2018-07-25 13:19:57,544 INFO L415 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:57,544 INFO L82 PathProgramCache]: Analyzing trace with hash -60005369, now seen corresponding path program 45 times [2018-07-25 13:19:57,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:57,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:57,720 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:57,721 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-25 13:19:57,721 INFO L451 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-25 13:19:57,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-25 13:19:57,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:19:57,722 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 48 states. [2018-07-25 13:19:57,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:57,751 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2018-07-25 13:19:57,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-25 13:19:57,751 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 96 [2018-07-25 13:19:57,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:57,752 INFO L225 Difference]: With dead ends: 103 [2018-07-25 13:19:57,752 INFO L226 Difference]: Without dead ends: 99 [2018-07-25 13:19:57,753 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:19:57,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-25 13:19:57,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-25 13:19:57,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-25 13:19:57,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-07-25 13:19:57,757 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-07-25 13:19:57,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:57,757 INFO L472 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-07-25 13:19:57,757 INFO L473 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-25 13:19:57,757 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-07-25 13:19:57,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-25 13:19:57,758 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:57,758 INFO L354 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1, 1, 1] [2018-07-25 13:19:57,759 INFO L415 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:57,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1914142973, now seen corresponding path program 46 times [2018-07-25 13:19:57,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:57,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:57,941 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:57,942 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-25 13:19:57,942 INFO L451 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-25 13:19:57,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-25 13:19:57,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:19:57,943 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 49 states. [2018-07-25 13:19:57,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:57,974 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2018-07-25 13:19:57,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-25 13:19:57,974 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 98 [2018-07-25 13:19:57,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:57,975 INFO L225 Difference]: With dead ends: 105 [2018-07-25 13:19:57,975 INFO L226 Difference]: Without dead ends: 101 [2018-07-25 13:19:57,976 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:19:57,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-25 13:19:57,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-25 13:19:57,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-25 13:19:57,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2018-07-25 13:19:57,979 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2018-07-25 13:19:57,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:57,980 INFO L472 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2018-07-25 13:19:57,980 INFO L473 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-25 13:19:57,980 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2018-07-25 13:19:57,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-25 13:19:57,981 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:57,981 INFO L354 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1, 1] [2018-07-25 13:19:57,981 INFO L415 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:57,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1328952577, now seen corresponding path program 47 times [2018-07-25 13:19:57,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:58,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:58,178 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:58,178 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-25 13:19:58,178 INFO L451 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-25 13:19:58,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-25 13:19:58,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 13:19:58,180 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 50 states. [2018-07-25 13:19:58,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:58,218 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2018-07-25 13:19:58,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-25 13:19:58,218 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 100 [2018-07-25 13:19:58,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:58,219 INFO L225 Difference]: With dead ends: 107 [2018-07-25 13:19:58,219 INFO L226 Difference]: Without dead ends: 103 [2018-07-25 13:19:58,221 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 13:19:58,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-25 13:19:58,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-25 13:19:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-25 13:19:58,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-07-25 13:19:58,227 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2018-07-25 13:19:58,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:58,227 INFO L472 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-07-25 13:19:58,227 INFO L473 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-25 13:19:58,228 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-07-25 13:19:58,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-25 13:19:58,229 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:58,229 INFO L354 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1, 1, 1] [2018-07-25 13:19:58,230 INFO L415 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:58,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1601697797, now seen corresponding path program 48 times [2018-07-25 13:19:58,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:58,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:58,422 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:58,422 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-25 13:19:58,423 INFO L451 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-25 13:19:58,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-25 13:19:58,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:19:58,424 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 51 states. [2018-07-25 13:19:58,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:58,481 INFO L93 Difference]: Finished difference Result 109 states and 111 transitions. [2018-07-25 13:19:58,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-25 13:19:58,481 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 102 [2018-07-25 13:19:58,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:58,482 INFO L225 Difference]: With dead ends: 109 [2018-07-25 13:19:58,482 INFO L226 Difference]: Without dead ends: 105 [2018-07-25 13:19:58,483 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:19:58,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-25 13:19:58,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-25 13:19:58,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-25 13:19:58,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-07-25 13:19:58,490 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2018-07-25 13:19:58,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:58,491 INFO L472 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-07-25 13:19:58,491 INFO L473 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-25 13:19:58,491 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-07-25 13:19:58,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-25 13:19:58,492 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:58,493 INFO L354 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1, 1] [2018-07-25 13:19:58,493 INFO L415 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:58,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1716849161, now seen corresponding path program 49 times [2018-07-25 13:19:58,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:58,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:58,731 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:58,731 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-25 13:19:58,731 INFO L451 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-25 13:19:58,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-25 13:19:58,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:19:58,733 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 52 states. [2018-07-25 13:19:58,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:58,770 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-07-25 13:19:58,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-25 13:19:58,770 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 104 [2018-07-25 13:19:58,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:58,772 INFO L225 Difference]: With dead ends: 111 [2018-07-25 13:19:58,772 INFO L226 Difference]: Without dead ends: 107 [2018-07-25 13:19:58,773 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:19:58,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-25 13:19:58,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-07-25 13:19:58,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-25 13:19:58,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-07-25 13:19:58,777 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2018-07-25 13:19:58,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:58,778 INFO L472 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-07-25 13:19:58,778 INFO L473 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-25 13:19:58,778 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-07-25 13:19:58,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-25 13:19:58,779 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:58,779 INFO L354 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1, 1, 1] [2018-07-25 13:19:58,779 INFO L415 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:58,780 INFO L82 PathProgramCache]: Analyzing trace with hash -708160269, now seen corresponding path program 50 times [2018-07-25 13:19:58,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:59,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:59,036 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:59,036 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-25 13:19:59,036 INFO L451 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-25 13:19:59,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-25 13:19:59,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:19:59,039 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 53 states. [2018-07-25 13:19:59,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:59,080 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2018-07-25 13:19:59,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-25 13:19:59,080 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 106 [2018-07-25 13:19:59,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:59,081 INFO L225 Difference]: With dead ends: 113 [2018-07-25 13:19:59,081 INFO L226 Difference]: Without dead ends: 109 [2018-07-25 13:19:59,082 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:19:59,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-25 13:19:59,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-07-25 13:19:59,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-25 13:19:59,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-07-25 13:19:59,092 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2018-07-25 13:19:59,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:59,092 INFO L472 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-07-25 13:19:59,092 INFO L473 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-25 13:19:59,092 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-07-25 13:19:59,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-25 13:19:59,096 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:59,097 INFO L354 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1, 1] [2018-07-25 13:19:59,097 INFO L415 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:59,097 INFO L82 PathProgramCache]: Analyzing trace with hash -2020743953, now seen corresponding path program 51 times [2018-07-25 13:19:59,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:59,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:59,295 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:59,295 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-25 13:19:59,295 INFO L451 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-25 13:19:59,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-25 13:19:59,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:19:59,297 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 54 states. [2018-07-25 13:19:59,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:59,350 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2018-07-25 13:19:59,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-25 13:19:59,350 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 108 [2018-07-25 13:19:59,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:59,351 INFO L225 Difference]: With dead ends: 115 [2018-07-25 13:19:59,351 INFO L226 Difference]: Without dead ends: 111 [2018-07-25 13:19:59,352 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:19:59,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-25 13:19:59,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-07-25 13:19:59,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-25 13:19:59,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-07-25 13:19:59,357 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2018-07-25 13:19:59,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:59,357 INFO L472 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-07-25 13:19:59,357 INFO L473 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-25 13:19:59,357 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-07-25 13:19:59,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-25 13:19:59,358 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:59,358 INFO L354 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1, 1, 1] [2018-07-25 13:19:59,359 INFO L415 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:59,359 INFO L82 PathProgramCache]: Analyzing trace with hash -693279253, now seen corresponding path program 52 times [2018-07-25 13:19:59,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:59,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:59,566 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:59,566 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-25 13:19:59,567 INFO L451 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-25 13:19:59,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-25 13:19:59,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:19:59,568 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 55 states. [2018-07-25 13:19:59,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:59,627 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2018-07-25 13:19:59,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-25 13:19:59,627 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 110 [2018-07-25 13:19:59,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:59,628 INFO L225 Difference]: With dead ends: 117 [2018-07-25 13:19:59,628 INFO L226 Difference]: Without dead ends: 113 [2018-07-25 13:19:59,629 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:19:59,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-25 13:19:59,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-07-25 13:19:59,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-25 13:19:59,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-07-25 13:19:59,633 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2018-07-25 13:19:59,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:59,633 INFO L472 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-07-25 13:19:59,633 INFO L473 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-25 13:19:59,636 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-07-25 13:19:59,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-25 13:19:59,637 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:59,638 INFO L354 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1, 1, 1] [2018-07-25 13:19:59,638 INFO L415 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:59,638 INFO L82 PathProgramCache]: Analyzing trace with hash -604989465, now seen corresponding path program 53 times [2018-07-25 13:19:59,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:19:59,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:19:59,845 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:19:59,845 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-25 13:19:59,845 INFO L451 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-25 13:19:59,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-25 13:19:59,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:19:59,847 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 56 states. [2018-07-25 13:19:59,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:19:59,912 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2018-07-25 13:19:59,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-25 13:19:59,912 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 112 [2018-07-25 13:19:59,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:19:59,913 INFO L225 Difference]: With dead ends: 119 [2018-07-25 13:19:59,913 INFO L226 Difference]: Without dead ends: 115 [2018-07-25 13:19:59,917 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:19:59,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-25 13:19:59,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-07-25 13:19:59,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-25 13:19:59,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-07-25 13:19:59,921 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2018-07-25 13:19:59,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:19:59,921 INFO L472 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-07-25 13:19:59,922 INFO L473 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-25 13:19:59,922 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-07-25 13:19:59,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-25 13:19:59,923 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:19:59,923 INFO L354 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1, 1, 1] [2018-07-25 13:19:59,923 INFO L415 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:19:59,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1657849117, now seen corresponding path program 54 times [2018-07-25 13:19:59,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:19:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:00,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:00,144 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:00,145 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-25 13:20:00,145 INFO L451 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-25 13:20:00,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-25 13:20:00,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:20:00,147 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 57 states. [2018-07-25 13:20:00,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:00,214 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2018-07-25 13:20:00,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-25 13:20:00,215 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 114 [2018-07-25 13:20:00,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:00,216 INFO L225 Difference]: With dead ends: 121 [2018-07-25 13:20:00,216 INFO L226 Difference]: Without dead ends: 117 [2018-07-25 13:20:00,217 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:20:00,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-07-25 13:20:00,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-07-25 13:20:00,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-25 13:20:00,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-07-25 13:20:00,221 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2018-07-25 13:20:00,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:00,222 INFO L472 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-07-25 13:20:00,222 INFO L473 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-25 13:20:00,222 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-07-25 13:20:00,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-25 13:20:00,223 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:00,223 INFO L354 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1, 1, 1] [2018-07-25 13:20:00,223 INFO L415 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:00,224 INFO L82 PathProgramCache]: Analyzing trace with hash 156307167, now seen corresponding path program 55 times [2018-07-25 13:20:00,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:00,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:00,456 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:00,456 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-25 13:20:00,460 INFO L451 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-25 13:20:00,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-25 13:20:00,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:20:00,461 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 58 states. [2018-07-25 13:20:00,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:00,502 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2018-07-25 13:20:00,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-25 13:20:00,502 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 116 [2018-07-25 13:20:00,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:00,503 INFO L225 Difference]: With dead ends: 123 [2018-07-25 13:20:00,503 INFO L226 Difference]: Without dead ends: 119 [2018-07-25 13:20:00,504 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:20:00,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-25 13:20:00,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-25 13:20:00,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-25 13:20:00,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-07-25 13:20:00,508 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2018-07-25 13:20:00,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:00,508 INFO L472 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-07-25 13:20:00,509 INFO L473 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-25 13:20:00,509 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-07-25 13:20:00,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-25 13:20:00,510 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:00,510 INFO L354 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1, 1, 1] [2018-07-25 13:20:00,510 INFO L415 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:00,511 INFO L82 PathProgramCache]: Analyzing trace with hash -196226085, now seen corresponding path program 56 times [2018-07-25 13:20:00,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:00,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:00,744 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:00,744 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-25 13:20:00,744 INFO L451 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-25 13:20:00,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-25 13:20:00,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:20:00,749 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 59 states. [2018-07-25 13:20:00,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:00,816 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2018-07-25 13:20:00,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-25 13:20:00,816 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 118 [2018-07-25 13:20:00,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:00,818 INFO L225 Difference]: With dead ends: 125 [2018-07-25 13:20:00,818 INFO L226 Difference]: Without dead ends: 121 [2018-07-25 13:20:00,820 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:20:00,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-25 13:20:00,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-07-25 13:20:00,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 13:20:00,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-07-25 13:20:00,824 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2018-07-25 13:20:00,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:00,824 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-07-25 13:20:00,824 INFO L473 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-25 13:20:00,824 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-07-25 13:20:00,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-25 13:20:00,825 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:00,826 INFO L354 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1, 1, 1] [2018-07-25 13:20:00,826 INFO L415 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:00,826 INFO L82 PathProgramCache]: Analyzing trace with hash 321735127, now seen corresponding path program 57 times [2018-07-25 13:20:00,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:01,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:01,080 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:01,080 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-25 13:20:01,081 INFO L451 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-25 13:20:01,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-25 13:20:01,082 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 13:20:01,082 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 60 states. [2018-07-25 13:20:01,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:01,147 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2018-07-25 13:20:01,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-25 13:20:01,148 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 120 [2018-07-25 13:20:01,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:01,149 INFO L225 Difference]: With dead ends: 127 [2018-07-25 13:20:01,149 INFO L226 Difference]: Without dead ends: 123 [2018-07-25 13:20:01,150 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 13:20:01,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-25 13:20:01,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-07-25 13:20:01,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-07-25 13:20:01,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-07-25 13:20:01,156 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2018-07-25 13:20:01,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:01,156 INFO L472 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-07-25 13:20:01,157 INFO L473 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-25 13:20:01,157 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-07-25 13:20:01,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-25 13:20:01,158 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:01,158 INFO L354 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1, 1, 1] [2018-07-25 13:20:01,158 INFO L415 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:01,159 INFO L82 PathProgramCache]: Analyzing trace with hash -133746477, now seen corresponding path program 58 times [2018-07-25 13:20:01,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:01,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:01,474 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:01,474 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-25 13:20:01,474 INFO L451 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-25 13:20:01,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-25 13:20:01,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:20:01,476 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 61 states. [2018-07-25 13:20:01,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:01,519 INFO L93 Difference]: Finished difference Result 129 states and 131 transitions. [2018-07-25 13:20:01,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-25 13:20:01,519 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 122 [2018-07-25 13:20:01,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:01,520 INFO L225 Difference]: With dead ends: 129 [2018-07-25 13:20:01,521 INFO L226 Difference]: Without dead ends: 125 [2018-07-25 13:20:01,521 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:20:01,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-25 13:20:01,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-07-25 13:20:01,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-25 13:20:01,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-07-25 13:20:01,525 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2018-07-25 13:20:01,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:01,526 INFO L472 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-07-25 13:20:01,526 INFO L473 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-25 13:20:01,526 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-07-25 13:20:01,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-25 13:20:01,527 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:01,527 INFO L354 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1, 1, 1] [2018-07-25 13:20:01,527 INFO L415 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:01,528 INFO L82 PathProgramCache]: Analyzing trace with hash 235096271, now seen corresponding path program 59 times [2018-07-25 13:20:01,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:01,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:01,738 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:01,739 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-25 13:20:01,739 INFO L451 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-25 13:20:01,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-25 13:20:01,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:20:01,741 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 62 states. [2018-07-25 13:20:01,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:01,812 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2018-07-25 13:20:01,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 13:20:01,813 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 124 [2018-07-25 13:20:01,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:01,814 INFO L225 Difference]: With dead ends: 131 [2018-07-25 13:20:01,814 INFO L226 Difference]: Without dead ends: 127 [2018-07-25 13:20:01,815 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:20:01,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-25 13:20:01,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-07-25 13:20:01,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-25 13:20:01,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-07-25 13:20:01,819 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2018-07-25 13:20:01,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:01,819 INFO L472 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-07-25 13:20:01,820 INFO L473 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-25 13:20:01,820 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-07-25 13:20:01,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-25 13:20:01,821 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:01,821 INFO L354 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1, 1, 1] [2018-07-25 13:20:01,821 INFO L415 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:01,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1789308469, now seen corresponding path program 60 times [2018-07-25 13:20:01,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:02,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:02,050 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:02,051 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-25 13:20:02,051 INFO L451 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-25 13:20:02,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-25 13:20:02,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:20:02,053 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 63 states. [2018-07-25 13:20:02,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:02,106 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2018-07-25 13:20:02,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-25 13:20:02,106 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 126 [2018-07-25 13:20:02,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:02,107 INFO L225 Difference]: With dead ends: 133 [2018-07-25 13:20:02,107 INFO L226 Difference]: Without dead ends: 129 [2018-07-25 13:20:02,108 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:20:02,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-25 13:20:02,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-07-25 13:20:02,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-25 13:20:02,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-07-25 13:20:02,112 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2018-07-25 13:20:02,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:02,113 INFO L472 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-07-25 13:20:02,113 INFO L473 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-25 13:20:02,113 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-07-25 13:20:02,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-25 13:20:02,114 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:02,114 INFO L354 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1, 1, 1] [2018-07-25 13:20:02,115 INFO L415 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:02,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1622078521, now seen corresponding path program 61 times [2018-07-25 13:20:02,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:02,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:02,333 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:02,333 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-25 13:20:02,334 INFO L451 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-25 13:20:02,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-25 13:20:02,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:20:02,335 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 64 states. [2018-07-25 13:20:02,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:02,404 INFO L93 Difference]: Finished difference Result 135 states and 137 transitions. [2018-07-25 13:20:02,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-25 13:20:02,405 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 128 [2018-07-25 13:20:02,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:02,406 INFO L225 Difference]: With dead ends: 135 [2018-07-25 13:20:02,406 INFO L226 Difference]: Without dead ends: 131 [2018-07-25 13:20:02,407 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:20:02,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-25 13:20:02,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-07-25 13:20:02,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-25 13:20:02,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-07-25 13:20:02,411 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2018-07-25 13:20:02,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:02,412 INFO L472 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-07-25 13:20:02,412 INFO L473 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-25 13:20:02,412 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-07-25 13:20:02,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-25 13:20:02,413 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:02,413 INFO L354 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1, 1, 1] [2018-07-25 13:20:02,413 INFO L415 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:02,414 INFO L82 PathProgramCache]: Analyzing trace with hash 172111555, now seen corresponding path program 62 times [2018-07-25 13:20:02,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:02,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:02,644 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:02,644 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-25 13:20:02,645 INFO L451 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-25 13:20:02,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-25 13:20:02,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:20:02,647 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 65 states. [2018-07-25 13:20:02,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:02,701 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2018-07-25 13:20:02,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-25 13:20:02,701 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 130 [2018-07-25 13:20:02,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:02,702 INFO L225 Difference]: With dead ends: 137 [2018-07-25 13:20:02,702 INFO L226 Difference]: Without dead ends: 133 [2018-07-25 13:20:02,703 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:20:02,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-25 13:20:02,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-07-25 13:20:02,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-25 13:20:02,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-07-25 13:20:02,707 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2018-07-25 13:20:02,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:02,708 INFO L472 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-07-25 13:20:02,708 INFO L473 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-25 13:20:02,708 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-07-25 13:20:02,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-25 13:20:02,709 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:02,709 INFO L354 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1, 1, 1] [2018-07-25 13:20:02,710 INFO L415 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:02,710 INFO L82 PathProgramCache]: Analyzing trace with hash 2106888895, now seen corresponding path program 63 times [2018-07-25 13:20:02,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:02,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:02,946 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:02,946 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-25 13:20:02,947 INFO L451 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-25 13:20:02,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-25 13:20:02,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:20:02,949 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 66 states. [2018-07-25 13:20:03,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:03,015 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2018-07-25 13:20:03,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-25 13:20:03,015 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 132 [2018-07-25 13:20:03,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:03,017 INFO L225 Difference]: With dead ends: 139 [2018-07-25 13:20:03,017 INFO L226 Difference]: Without dead ends: 135 [2018-07-25 13:20:03,018 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:20:03,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-25 13:20:03,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-07-25 13:20:03,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-07-25 13:20:03,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-07-25 13:20:03,028 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2018-07-25 13:20:03,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:03,028 INFO L472 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-07-25 13:20:03,028 INFO L473 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-25 13:20:03,028 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-07-25 13:20:03,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-25 13:20:03,032 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:03,032 INFO L354 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1, 1, 1] [2018-07-25 13:20:03,032 INFO L415 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:03,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1707073467, now seen corresponding path program 64 times [2018-07-25 13:20:03,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:03,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:03,273 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:03,273 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-25 13:20:03,273 INFO L451 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-25 13:20:03,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-25 13:20:03,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:20:03,275 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 67 states. [2018-07-25 13:20:03,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:03,351 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2018-07-25 13:20:03,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-25 13:20:03,351 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 134 [2018-07-25 13:20:03,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:03,352 INFO L225 Difference]: With dead ends: 141 [2018-07-25 13:20:03,352 INFO L226 Difference]: Without dead ends: 137 [2018-07-25 13:20:03,353 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:20:03,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-25 13:20:03,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-07-25 13:20:03,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-25 13:20:03,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-07-25 13:20:03,357 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2018-07-25 13:20:03,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:03,358 INFO L472 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-07-25 13:20:03,358 INFO L473 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-25 13:20:03,358 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-07-25 13:20:03,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-25 13:20:03,360 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:03,360 INFO L354 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1, 1, 1] [2018-07-25 13:20:03,360 INFO L415 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:03,360 INFO L82 PathProgramCache]: Analyzing trace with hash -263463497, now seen corresponding path program 65 times [2018-07-25 13:20:03,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:03,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:03,642 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:03,642 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-25 13:20:03,642 INFO L451 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-25 13:20:03,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-25 13:20:03,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 13:20:03,644 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 68 states. [2018-07-25 13:20:03,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:03,717 INFO L93 Difference]: Finished difference Result 143 states and 145 transitions. [2018-07-25 13:20:03,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-25 13:20:03,717 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 136 [2018-07-25 13:20:03,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:03,718 INFO L225 Difference]: With dead ends: 143 [2018-07-25 13:20:03,718 INFO L226 Difference]: Without dead ends: 139 [2018-07-25 13:20:03,719 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 13:20:03,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-25 13:20:03,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-07-25 13:20:03,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-07-25 13:20:03,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-07-25 13:20:03,726 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2018-07-25 13:20:03,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:03,726 INFO L472 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-07-25 13:20:03,726 INFO L473 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-25 13:20:03,726 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-07-25 13:20:03,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-25 13:20:03,727 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:03,727 INFO L354 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1, 1, 1] [2018-07-25 13:20:03,727 INFO L415 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:03,728 INFO L82 PathProgramCache]: Analyzing trace with hash 131091635, now seen corresponding path program 66 times [2018-07-25 13:20:03,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:03,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:03,990 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:03,990 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-25 13:20:03,990 INFO L451 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-25 13:20:03,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-25 13:20:03,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:20:03,992 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 69 states. [2018-07-25 13:20:04,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:04,090 INFO L93 Difference]: Finished difference Result 145 states and 147 transitions. [2018-07-25 13:20:04,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-25 13:20:04,091 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 138 [2018-07-25 13:20:04,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:04,092 INFO L225 Difference]: With dead ends: 145 [2018-07-25 13:20:04,092 INFO L226 Difference]: Without dead ends: 141 [2018-07-25 13:20:04,093 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:20:04,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-25 13:20:04,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-07-25 13:20:04,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-25 13:20:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-07-25 13:20:04,098 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2018-07-25 13:20:04,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:04,098 INFO L472 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-07-25 13:20:04,098 INFO L473 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-25 13:20:04,098 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-07-25 13:20:04,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-25 13:20:04,101 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:04,101 INFO L354 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1, 1, 1] [2018-07-25 13:20:04,101 INFO L415 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:04,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1341451439, now seen corresponding path program 67 times [2018-07-25 13:20:04,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:04,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:04,372 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:04,372 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-25 13:20:04,373 INFO L451 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-25 13:20:04,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-25 13:20:04,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:20:04,374 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 70 states. [2018-07-25 13:20:04,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:04,477 INFO L93 Difference]: Finished difference Result 147 states and 149 transitions. [2018-07-25 13:20:04,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-25 13:20:04,478 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 140 [2018-07-25 13:20:04,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:04,479 INFO L225 Difference]: With dead ends: 147 [2018-07-25 13:20:04,479 INFO L226 Difference]: Without dead ends: 143 [2018-07-25 13:20:04,480 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:20:04,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-25 13:20:04,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-07-25 13:20:04,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-25 13:20:04,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-07-25 13:20:04,485 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2018-07-25 13:20:04,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:04,485 INFO L472 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-07-25 13:20:04,485 INFO L473 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-25 13:20:04,485 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-07-25 13:20:04,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-25 13:20:04,486 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:04,486 INFO L354 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1, 1, 1] [2018-07-25 13:20:04,487 INFO L415 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:04,487 INFO L82 PathProgramCache]: Analyzing trace with hash 561085867, now seen corresponding path program 68 times [2018-07-25 13:20:04,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:04,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:04,766 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:04,766 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-25 13:20:04,766 INFO L451 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-25 13:20:04,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-25 13:20:04,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:20:04,768 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 71 states. [2018-07-25 13:20:04,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:04,864 INFO L93 Difference]: Finished difference Result 149 states and 151 transitions. [2018-07-25 13:20:04,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-25 13:20:04,864 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 142 [2018-07-25 13:20:04,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:04,866 INFO L225 Difference]: With dead ends: 149 [2018-07-25 13:20:04,866 INFO L226 Difference]: Without dead ends: 145 [2018-07-25 13:20:04,867 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:20:04,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-25 13:20:04,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-07-25 13:20:04,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-25 13:20:04,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-07-25 13:20:04,872 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2018-07-25 13:20:04,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:04,872 INFO L472 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-07-25 13:20:04,873 INFO L473 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-25 13:20:04,873 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-07-25 13:20:04,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-25 13:20:04,873 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:04,874 INFO L354 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1, 1, 1] [2018-07-25 13:20:04,874 INFO L415 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:04,874 INFO L82 PathProgramCache]: Analyzing trace with hash -2045919321, now seen corresponding path program 69 times [2018-07-25 13:20:04,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:05,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:05,140 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:05,140 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-25 13:20:05,140 INFO L451 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-25 13:20:05,141 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-25 13:20:05,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:20:05,142 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 72 states. [2018-07-25 13:20:05,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:05,237 INFO L93 Difference]: Finished difference Result 151 states and 153 transitions. [2018-07-25 13:20:05,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-25 13:20:05,237 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 144 [2018-07-25 13:20:05,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:05,238 INFO L225 Difference]: With dead ends: 151 [2018-07-25 13:20:05,238 INFO L226 Difference]: Without dead ends: 147 [2018-07-25 13:20:05,239 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:20:05,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-25 13:20:05,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-07-25 13:20:05,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-25 13:20:05,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-07-25 13:20:05,243 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2018-07-25 13:20:05,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:05,244 INFO L472 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-07-25 13:20:05,244 INFO L473 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-25 13:20:05,244 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-07-25 13:20:05,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-25 13:20:05,245 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:05,245 INFO L354 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1, 1, 1] [2018-07-25 13:20:05,245 INFO L415 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:05,248 INFO L82 PathProgramCache]: Analyzing trace with hash 882995875, now seen corresponding path program 70 times [2018-07-25 13:20:05,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:05,538 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:05,538 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:05,538 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-25 13:20:05,539 INFO L451 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-25 13:20:05,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-25 13:20:05,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:20:05,541 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 73 states. [2018-07-25 13:20:05,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:05,605 INFO L93 Difference]: Finished difference Result 153 states and 155 transitions. [2018-07-25 13:20:05,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-25 13:20:05,605 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 146 [2018-07-25 13:20:05,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:05,606 INFO L225 Difference]: With dead ends: 153 [2018-07-25 13:20:05,606 INFO L226 Difference]: Without dead ends: 149 [2018-07-25 13:20:05,608 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:20:05,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-25 13:20:05,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-07-25 13:20:05,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-25 13:20:05,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2018-07-25 13:20:05,612 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2018-07-25 13:20:05,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:05,613 INFO L472 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2018-07-25 13:20:05,613 INFO L473 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-25 13:20:05,613 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2018-07-25 13:20:05,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-25 13:20:05,614 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:05,614 INFO L354 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1, 1, 1] [2018-07-25 13:20:05,614 INFO L415 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:05,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1928046945, now seen corresponding path program 71 times [2018-07-25 13:20:05,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:05,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:05,990 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:05,990 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-25 13:20:05,991 INFO L451 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-25 13:20:05,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-25 13:20:05,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:20:05,993 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 74 states. [2018-07-25 13:20:06,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:06,111 INFO L93 Difference]: Finished difference Result 155 states and 157 transitions. [2018-07-25 13:20:06,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-25 13:20:06,111 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 148 [2018-07-25 13:20:06,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:06,112 INFO L225 Difference]: With dead ends: 155 [2018-07-25 13:20:06,113 INFO L226 Difference]: Without dead ends: 151 [2018-07-25 13:20:06,114 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:20:06,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-25 13:20:06,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-07-25 13:20:06,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-25 13:20:06,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-07-25 13:20:06,121 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2018-07-25 13:20:06,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:06,122 INFO L472 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-07-25 13:20:06,122 INFO L473 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-25 13:20:06,122 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-07-25 13:20:06,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-25 13:20:06,123 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:06,123 INFO L354 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1, 1, 1] [2018-07-25 13:20:06,124 INFO L415 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:06,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1805767781, now seen corresponding path program 72 times [2018-07-25 13:20:06,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:06,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:06,520 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:06,520 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-25 13:20:06,521 INFO L451 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-25 13:20:06,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-25 13:20:06,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:20:06,522 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 75 states. [2018-07-25 13:20:06,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:06,629 INFO L93 Difference]: Finished difference Result 157 states and 159 transitions. [2018-07-25 13:20:06,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-25 13:20:06,629 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 150 [2018-07-25 13:20:06,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:06,630 INFO L225 Difference]: With dead ends: 157 [2018-07-25 13:20:06,630 INFO L226 Difference]: Without dead ends: 153 [2018-07-25 13:20:06,631 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:20:06,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-25 13:20:06,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-07-25 13:20:06,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-25 13:20:06,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-07-25 13:20:06,635 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2018-07-25 13:20:06,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:06,636 INFO L472 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-07-25 13:20:06,636 INFO L473 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-25 13:20:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-07-25 13:20:06,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-25 13:20:06,637 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:06,637 INFO L354 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1, 1, 1] [2018-07-25 13:20:06,637 INFO L415 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:06,637 INFO L82 PathProgramCache]: Analyzing trace with hash -259608169, now seen corresponding path program 73 times [2018-07-25 13:20:06,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:06,929 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:06,930 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:06,930 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-25 13:20:06,930 INFO L451 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-25 13:20:06,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-25 13:20:06,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:20:06,933 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 76 states. [2018-07-25 13:20:07,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:07,001 INFO L93 Difference]: Finished difference Result 159 states and 161 transitions. [2018-07-25 13:20:07,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-25 13:20:07,002 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 152 [2018-07-25 13:20:07,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:07,003 INFO L225 Difference]: With dead ends: 159 [2018-07-25 13:20:07,003 INFO L226 Difference]: Without dead ends: 155 [2018-07-25 13:20:07,004 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:20:07,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-25 13:20:07,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-25 13:20:07,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-25 13:20:07,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-07-25 13:20:07,008 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2018-07-25 13:20:07,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:07,009 INFO L472 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-07-25 13:20:07,009 INFO L473 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-25 13:20:07,009 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-07-25 13:20:07,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-25 13:20:07,010 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:07,010 INFO L354 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1, 1, 1] [2018-07-25 13:20:07,010 INFO L415 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:07,010 INFO L82 PathProgramCache]: Analyzing trace with hash -458905453, now seen corresponding path program 74 times [2018-07-25 13:20:07,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:07,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:07,295 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:07,295 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-25 13:20:07,296 INFO L451 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-25 13:20:07,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-25 13:20:07,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:20:07,298 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 77 states. [2018-07-25 13:20:07,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:07,418 INFO L93 Difference]: Finished difference Result 161 states and 163 transitions. [2018-07-25 13:20:07,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-25 13:20:07,418 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 154 [2018-07-25 13:20:07,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:07,419 INFO L225 Difference]: With dead ends: 161 [2018-07-25 13:20:07,419 INFO L226 Difference]: Without dead ends: 157 [2018-07-25 13:20:07,421 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:20:07,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-25 13:20:07,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-07-25 13:20:07,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-07-25 13:20:07,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-07-25 13:20:07,425 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2018-07-25 13:20:07,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:07,426 INFO L472 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-07-25 13:20:07,426 INFO L473 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-25 13:20:07,426 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-07-25 13:20:07,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-25 13:20:07,427 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:07,427 INFO L354 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1, 1, 1] [2018-07-25 13:20:07,427 INFO L415 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:07,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1289932943, now seen corresponding path program 75 times [2018-07-25 13:20:07,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:07,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:07,724 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:07,725 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-25 13:20:07,725 INFO L451 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-25 13:20:07,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-25 13:20:07,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:20:07,727 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 78 states. [2018-07-25 13:20:07,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:07,804 INFO L93 Difference]: Finished difference Result 163 states and 165 transitions. [2018-07-25 13:20:07,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-25 13:20:07,804 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 156 [2018-07-25 13:20:07,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:07,805 INFO L225 Difference]: With dead ends: 163 [2018-07-25 13:20:07,805 INFO L226 Difference]: Without dead ends: 159 [2018-07-25 13:20:07,806 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:20:07,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-07-25 13:20:07,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-07-25 13:20:07,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-07-25 13:20:07,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-07-25 13:20:07,811 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2018-07-25 13:20:07,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:07,811 INFO L472 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-07-25 13:20:07,811 INFO L473 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-25 13:20:07,812 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-07-25 13:20:07,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-25 13:20:07,812 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:07,813 INFO L354 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1, 1, 1] [2018-07-25 13:20:07,813 INFO L415 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:07,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1703548533, now seen corresponding path program 76 times [2018-07-25 13:20:07,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:08,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:08,128 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:08,129 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-25 13:20:08,129 INFO L451 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-25 13:20:08,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-25 13:20:08,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:20:08,131 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 79 states. [2018-07-25 13:20:08,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:08,240 INFO L93 Difference]: Finished difference Result 165 states and 167 transitions. [2018-07-25 13:20:08,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-25 13:20:08,240 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 158 [2018-07-25 13:20:08,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:08,241 INFO L225 Difference]: With dead ends: 165 [2018-07-25 13:20:08,241 INFO L226 Difference]: Without dead ends: 161 [2018-07-25 13:20:08,243 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:20:08,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-07-25 13:20:08,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-07-25 13:20:08,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-25 13:20:08,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-07-25 13:20:08,250 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2018-07-25 13:20:08,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:08,250 INFO L472 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-07-25 13:20:08,250 INFO L473 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-25 13:20:08,250 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-07-25 13:20:08,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-25 13:20:08,251 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:08,251 INFO L354 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1, 1, 1] [2018-07-25 13:20:08,252 INFO L415 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:08,252 INFO L82 PathProgramCache]: Analyzing trace with hash -811158649, now seen corresponding path program 77 times [2018-07-25 13:20:08,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:08,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:08,565 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:08,565 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-25 13:20:08,566 INFO L451 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-25 13:20:08,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-25 13:20:08,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 13:20:08,567 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 80 states. [2018-07-25 13:20:08,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:08,702 INFO L93 Difference]: Finished difference Result 167 states and 169 transitions. [2018-07-25 13:20:08,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-25 13:20:08,702 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 160 [2018-07-25 13:20:08,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:08,704 INFO L225 Difference]: With dead ends: 167 [2018-07-25 13:20:08,704 INFO L226 Difference]: Without dead ends: 163 [2018-07-25 13:20:08,705 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 13:20:08,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-25 13:20:08,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-07-25 13:20:08,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-25 13:20:08,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-07-25 13:20:08,711 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2018-07-25 13:20:08,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:08,711 INFO L472 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-07-25 13:20:08,711 INFO L473 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-25 13:20:08,711 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-07-25 13:20:08,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-25 13:20:08,712 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:08,712 INFO L354 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1, 1, 1] [2018-07-25 13:20:08,713 INFO L415 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:08,713 INFO L82 PathProgramCache]: Analyzing trace with hash 2077027971, now seen corresponding path program 78 times [2018-07-25 13:20:08,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:09,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:09,047 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:09,048 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-25 13:20:09,048 INFO L451 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-25 13:20:09,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-25 13:20:09,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:20:09,049 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 81 states. [2018-07-25 13:20:09,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:09,136 INFO L93 Difference]: Finished difference Result 169 states and 171 transitions. [2018-07-25 13:20:09,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-25 13:20:09,136 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 162 [2018-07-25 13:20:09,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:09,138 INFO L225 Difference]: With dead ends: 169 [2018-07-25 13:20:09,138 INFO L226 Difference]: Without dead ends: 165 [2018-07-25 13:20:09,139 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:20:09,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-07-25 13:20:09,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-07-25 13:20:09,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-07-25 13:20:09,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-07-25 13:20:09,143 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2018-07-25 13:20:09,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:09,143 INFO L472 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-07-25 13:20:09,143 INFO L473 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-25 13:20:09,143 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-07-25 13:20:09,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-25 13:20:09,144 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:09,144 INFO L354 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1, 1, 1] [2018-07-25 13:20:09,145 INFO L415 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:09,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1219470721, now seen corresponding path program 79 times [2018-07-25 13:20:09,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:09,452 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:09,452 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-25 13:20:09,453 INFO L451 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-25 13:20:09,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-25 13:20:09,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 13:20:09,455 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 82 states. [2018-07-25 13:20:09,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:09,539 INFO L93 Difference]: Finished difference Result 171 states and 173 transitions. [2018-07-25 13:20:09,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-25 13:20:09,540 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 164 [2018-07-25 13:20:09,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:09,541 INFO L225 Difference]: With dead ends: 171 [2018-07-25 13:20:09,541 INFO L226 Difference]: Without dead ends: 167 [2018-07-25 13:20:09,543 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 13:20:09,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-25 13:20:09,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-07-25 13:20:09,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-07-25 13:20:09,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-07-25 13:20:09,548 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2018-07-25 13:20:09,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:09,549 INFO L472 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-07-25 13:20:09,549 INFO L473 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-25 13:20:09,549 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-07-25 13:20:09,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-07-25 13:20:09,550 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:09,550 INFO L354 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1, 1, 1] [2018-07-25 13:20:09,550 INFO L415 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:09,552 INFO L82 PathProgramCache]: Analyzing trace with hash 531150715, now seen corresponding path program 80 times [2018-07-25 13:20:09,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:09,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:09,871 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:09,871 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-25 13:20:09,871 INFO L451 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-25 13:20:09,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-25 13:20:09,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:20:09,873 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 83 states. [2018-07-25 13:20:09,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:09,947 INFO L93 Difference]: Finished difference Result 173 states and 175 transitions. [2018-07-25 13:20:09,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-25 13:20:09,947 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 166 [2018-07-25 13:20:09,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:09,948 INFO L225 Difference]: With dead ends: 173 [2018-07-25 13:20:09,949 INFO L226 Difference]: Without dead ends: 169 [2018-07-25 13:20:09,950 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:20:09,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-07-25 13:20:09,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-07-25 13:20:09,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-07-25 13:20:09,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-07-25 13:20:09,954 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2018-07-25 13:20:09,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:09,954 INFO L472 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-07-25 13:20:09,954 INFO L473 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-25 13:20:09,955 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-07-25 13:20:09,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-07-25 13:20:09,955 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:09,956 INFO L354 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1, 1, 1] [2018-07-25 13:20:09,956 INFO L415 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:09,956 INFO L82 PathProgramCache]: Analyzing trace with hash -748829321, now seen corresponding path program 81 times [2018-07-25 13:20:09,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:10,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:10,264 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:10,264 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-25 13:20:10,264 INFO L451 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-25 13:20:10,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-25 13:20:10,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 13:20:10,266 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 84 states. [2018-07-25 13:20:10,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:10,327 INFO L93 Difference]: Finished difference Result 175 states and 177 transitions. [2018-07-25 13:20:10,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-25 13:20:10,328 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 168 [2018-07-25 13:20:10,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:10,329 INFO L225 Difference]: With dead ends: 175 [2018-07-25 13:20:10,329 INFO L226 Difference]: Without dead ends: 171 [2018-07-25 13:20:10,330 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 13:20:10,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-07-25 13:20:10,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-07-25 13:20:10,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-07-25 13:20:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-07-25 13:20:10,335 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2018-07-25 13:20:10,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:10,335 INFO L472 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-07-25 13:20:10,335 INFO L473 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-25 13:20:10,335 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-07-25 13:20:10,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-25 13:20:10,336 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:10,336 INFO L354 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1, 1, 1] [2018-07-25 13:20:10,336 INFO L415 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:10,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1845970035, now seen corresponding path program 82 times [2018-07-25 13:20:10,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:10,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:10,658 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:10,658 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:10,658 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-25 13:20:10,659 INFO L451 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-25 13:20:10,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-25 13:20:10,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:20:10,660 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 85 states. [2018-07-25 13:20:10,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:10,717 INFO L93 Difference]: Finished difference Result 177 states and 179 transitions. [2018-07-25 13:20:10,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-25 13:20:10,717 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 170 [2018-07-25 13:20:10,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:10,719 INFO L225 Difference]: With dead ends: 177 [2018-07-25 13:20:10,719 INFO L226 Difference]: Without dead ends: 173 [2018-07-25 13:20:10,720 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:20:10,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-07-25 13:20:10,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-07-25 13:20:10,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-25 13:20:10,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2018-07-25 13:20:10,724 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2018-07-25 13:20:10,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:10,725 INFO L472 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2018-07-25 13:20:10,725 INFO L473 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-25 13:20:10,725 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2018-07-25 13:20:10,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-25 13:20:10,726 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:10,726 INFO L354 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1, 1, 1] [2018-07-25 13:20:10,726 INFO L415 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:10,727 INFO L82 PathProgramCache]: Analyzing trace with hash 72152175, now seen corresponding path program 83 times [2018-07-25 13:20:10,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:11,060 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:11,060 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:11,060 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-25 13:20:11,061 INFO L451 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-25 13:20:11,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-25 13:20:11,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 13:20:11,062 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 86 states. [2018-07-25 13:20:11,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:11,167 INFO L93 Difference]: Finished difference Result 179 states and 181 transitions. [2018-07-25 13:20:11,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-25 13:20:11,167 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 172 [2018-07-25 13:20:11,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:11,168 INFO L225 Difference]: With dead ends: 179 [2018-07-25 13:20:11,169 INFO L226 Difference]: Without dead ends: 175 [2018-07-25 13:20:11,170 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 13:20:11,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-07-25 13:20:11,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-07-25 13:20:11,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-07-25 13:20:11,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-07-25 13:20:11,176 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2018-07-25 13:20:11,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:11,176 INFO L472 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-07-25 13:20:11,176 INFO L473 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-25 13:20:11,177 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-07-25 13:20:11,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-07-25 13:20:11,178 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:11,178 INFO L354 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1, 1, 1] [2018-07-25 13:20:11,178 INFO L415 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:11,178 INFO L82 PathProgramCache]: Analyzing trace with hash 535205227, now seen corresponding path program 84 times [2018-07-25 13:20:11,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:11,551 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:11,551 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:11,551 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-25 13:20:11,551 INFO L451 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-25 13:20:11,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-25 13:20:11,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:20:11,553 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 87 states. [2018-07-25 13:20:11,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:11,682 INFO L93 Difference]: Finished difference Result 181 states and 183 transitions. [2018-07-25 13:20:11,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-25 13:20:11,683 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 174 [2018-07-25 13:20:11,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:11,684 INFO L225 Difference]: With dead ends: 181 [2018-07-25 13:20:11,684 INFO L226 Difference]: Without dead ends: 177 [2018-07-25 13:20:11,685 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:20:11,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-07-25 13:20:11,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-07-25 13:20:11,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-07-25 13:20:11,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-07-25 13:20:11,691 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2018-07-25 13:20:11,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:11,691 INFO L472 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-07-25 13:20:11,691 INFO L473 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-25 13:20:11,691 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-07-25 13:20:11,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-25 13:20:11,692 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:11,692 INFO L354 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1, 1, 1] [2018-07-25 13:20:11,693 INFO L415 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:11,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1147410585, now seen corresponding path program 85 times [2018-07-25 13:20:11,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:11,919 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:11,919 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-25 13:20:11,920 INFO L451 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-25 13:20:11,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-25 13:20:11,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 13:20:11,921 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 88 states. [2018-07-25 13:20:12,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:12,009 INFO L93 Difference]: Finished difference Result 183 states and 185 transitions. [2018-07-25 13:20:12,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-25 13:20:12,009 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 176 [2018-07-25 13:20:12,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:12,010 INFO L225 Difference]: With dead ends: 183 [2018-07-25 13:20:12,010 INFO L226 Difference]: Without dead ends: 179 [2018-07-25 13:20:12,011 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 13:20:12,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-25 13:20:12,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-07-25 13:20:12,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-07-25 13:20:12,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-07-25 13:20:12,016 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2018-07-25 13:20:12,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:12,016 INFO L472 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-07-25 13:20:12,016 INFO L473 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-25 13:20:12,016 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-07-25 13:20:12,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-25 13:20:12,017 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:12,017 INFO L354 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1, 1, 1] [2018-07-25 13:20:12,018 INFO L415 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:12,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1061464675, now seen corresponding path program 86 times [2018-07-25 13:20:12,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:12,242 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:12,243 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:12,243 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-25 13:20:12,243 INFO L451 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-25 13:20:12,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-25 13:20:12,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:20:12,245 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 89 states. [2018-07-25 13:20:12,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:12,309 INFO L93 Difference]: Finished difference Result 185 states and 187 transitions. [2018-07-25 13:20:12,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-25 13:20:12,310 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 178 [2018-07-25 13:20:12,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:12,311 INFO L225 Difference]: With dead ends: 185 [2018-07-25 13:20:12,311 INFO L226 Difference]: Without dead ends: 181 [2018-07-25 13:20:12,312 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:20:12,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-07-25 13:20:12,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-07-25 13:20:12,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-25 13:20:12,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-07-25 13:20:12,319 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2018-07-25 13:20:12,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:12,322 INFO L472 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-07-25 13:20:12,322 INFO L473 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-25 13:20:12,322 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-07-25 13:20:12,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-25 13:20:12,325 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:12,325 INFO L354 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1, 1, 1] [2018-07-25 13:20:12,325 INFO L415 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:12,326 INFO L82 PathProgramCache]: Analyzing trace with hash 2076745311, now seen corresponding path program 87 times [2018-07-25 13:20:12,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:12,648 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:12,648 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-25 13:20:12,649 INFO L451 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-25 13:20:12,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-25 13:20:12,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 13:20:12,650 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 90 states. [2018-07-25 13:20:12,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:12,764 INFO L93 Difference]: Finished difference Result 187 states and 189 transitions. [2018-07-25 13:20:12,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-25 13:20:12,764 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 180 [2018-07-25 13:20:12,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:12,765 INFO L225 Difference]: With dead ends: 187 [2018-07-25 13:20:12,765 INFO L226 Difference]: Without dead ends: 183 [2018-07-25 13:20:12,769 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 13:20:12,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-25 13:20:12,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-07-25 13:20:12,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-25 13:20:12,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-07-25 13:20:12,777 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2018-07-25 13:20:12,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:12,777 INFO L472 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-07-25 13:20:12,778 INFO L473 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-25 13:20:12,778 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-07-25 13:20:12,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-07-25 13:20:12,779 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:12,779 INFO L354 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1, 1, 1] [2018-07-25 13:20:12,779 INFO L415 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:12,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1491106981, now seen corresponding path program 88 times [2018-07-25 13:20:12,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:13,049 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:13,049 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:13,050 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-25 13:20:13,050 INFO L451 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-25 13:20:13,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-25 13:20:13,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:20:13,052 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 91 states. [2018-07-25 13:20:13,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:13,125 INFO L93 Difference]: Finished difference Result 189 states and 191 transitions. [2018-07-25 13:20:13,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-25 13:20:13,126 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 182 [2018-07-25 13:20:13,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:13,127 INFO L225 Difference]: With dead ends: 189 [2018-07-25 13:20:13,127 INFO L226 Difference]: Without dead ends: 185 [2018-07-25 13:20:13,128 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:20:13,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-25 13:20:13,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-07-25 13:20:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-25 13:20:13,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2018-07-25 13:20:13,134 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2018-07-25 13:20:13,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:13,134 INFO L472 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2018-07-25 13:20:13,134 INFO L473 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-25 13:20:13,134 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2018-07-25 13:20:13,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-25 13:20:13,135 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:13,136 INFO L354 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1, 1, 1] [2018-07-25 13:20:13,136 INFO L415 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:13,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1481709911, now seen corresponding path program 89 times [2018-07-25 13:20:13,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:13,402 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:13,402 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:13,403 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-25 13:20:13,403 INFO L451 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-25 13:20:13,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-25 13:20:13,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 13:20:13,404 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 92 states. [2018-07-25 13:20:13,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:13,527 INFO L93 Difference]: Finished difference Result 191 states and 193 transitions. [2018-07-25 13:20:13,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-25 13:20:13,527 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 184 [2018-07-25 13:20:13,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:13,528 INFO L225 Difference]: With dead ends: 191 [2018-07-25 13:20:13,528 INFO L226 Difference]: Without dead ends: 187 [2018-07-25 13:20:13,529 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 13:20:13,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-07-25 13:20:13,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-07-25 13:20:13,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-07-25 13:20:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-07-25 13:20:13,534 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2018-07-25 13:20:13,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:13,535 INFO L472 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-07-25 13:20:13,535 INFO L473 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-25 13:20:13,535 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-07-25 13:20:13,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-07-25 13:20:13,536 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:13,536 INFO L354 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1, 1, 1] [2018-07-25 13:20:13,536 INFO L415 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:13,537 INFO L82 PathProgramCache]: Analyzing trace with hash -2089476013, now seen corresponding path program 90 times [2018-07-25 13:20:13,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:13,873 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:13,873 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:13,874 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-25 13:20:13,874 INFO L451 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-25 13:20:13,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-25 13:20:13,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:20:13,875 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 93 states. [2018-07-25 13:20:14,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:14,008 INFO L93 Difference]: Finished difference Result 193 states and 195 transitions. [2018-07-25 13:20:14,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-25 13:20:14,008 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 186 [2018-07-25 13:20:14,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:14,010 INFO L225 Difference]: With dead ends: 193 [2018-07-25 13:20:14,010 INFO L226 Difference]: Without dead ends: 189 [2018-07-25 13:20:14,011 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:20:14,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-07-25 13:20:14,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-07-25 13:20:14,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-07-25 13:20:14,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-07-25 13:20:14,017 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2018-07-25 13:20:14,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:14,017 INFO L472 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-07-25 13:20:14,017 INFO L473 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-25 13:20:14,018 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-07-25 13:20:14,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-07-25 13:20:14,019 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:14,019 INFO L354 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1, 1, 1] [2018-07-25 13:20:14,019 INFO L415 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:14,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1974687823, now seen corresponding path program 91 times [2018-07-25 13:20:14,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:14,460 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:14,460 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:14,460 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-25 13:20:14,461 INFO L451 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-25 13:20:14,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-25 13:20:14,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 13:20:14,463 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 94 states. [2018-07-25 13:20:14,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:14,594 INFO L93 Difference]: Finished difference Result 195 states and 197 transitions. [2018-07-25 13:20:14,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-25 13:20:14,594 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 188 [2018-07-25 13:20:14,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:14,595 INFO L225 Difference]: With dead ends: 195 [2018-07-25 13:20:14,595 INFO L226 Difference]: Without dead ends: 191 [2018-07-25 13:20:14,597 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 13:20:14,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-07-25 13:20:14,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-07-25 13:20:14,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-07-25 13:20:14,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2018-07-25 13:20:14,602 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2018-07-25 13:20:14,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:14,603 INFO L472 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2018-07-25 13:20:14,603 INFO L473 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-25 13:20:14,603 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2018-07-25 13:20:14,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-07-25 13:20:14,604 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:14,604 INFO L354 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1, 1, 1] [2018-07-25 13:20:14,605 INFO L415 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:14,605 INFO L82 PathProgramCache]: Analyzing trace with hash -784105141, now seen corresponding path program 92 times [2018-07-25 13:20:14,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:14,997 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:14,997 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:14,997 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-25 13:20:14,998 INFO L451 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-25 13:20:14,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-25 13:20:14,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:20:14,999 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 95 states. [2018-07-25 13:20:15,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:15,156 INFO L93 Difference]: Finished difference Result 197 states and 199 transitions. [2018-07-25 13:20:15,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-25 13:20:15,156 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 190 [2018-07-25 13:20:15,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:15,157 INFO L225 Difference]: With dead ends: 197 [2018-07-25 13:20:15,158 INFO L226 Difference]: Without dead ends: 193 [2018-07-25 13:20:15,159 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:20:15,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-07-25 13:20:15,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-07-25 13:20:15,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-07-25 13:20:15,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-07-25 13:20:15,164 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2018-07-25 13:20:15,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:15,164 INFO L472 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-07-25 13:20:15,164 INFO L473 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-25 13:20:15,164 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-07-25 13:20:15,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-07-25 13:20:15,165 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:15,165 INFO L354 BasicCegarLoop]: trace histogram [94, 93, 1, 1, 1, 1, 1] [2018-07-25 13:20:15,166 INFO L415 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:15,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1989321913, now seen corresponding path program 93 times [2018-07-25 13:20:15,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:15,452 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:15,453 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:15,453 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-25 13:20:15,453 INFO L451 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-25 13:20:15,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-25 13:20:15,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 13:20:15,454 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 96 states. [2018-07-25 13:20:15,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:15,600 INFO L93 Difference]: Finished difference Result 199 states and 201 transitions. [2018-07-25 13:20:15,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-25 13:20:15,600 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 192 [2018-07-25 13:20:15,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:15,601 INFO L225 Difference]: With dead ends: 199 [2018-07-25 13:20:15,601 INFO L226 Difference]: Without dead ends: 195 [2018-07-25 13:20:15,603 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 13:20:15,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-07-25 13:20:15,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-07-25 13:20:15,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-07-25 13:20:15,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-07-25 13:20:15,608 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2018-07-25 13:20:15,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:15,608 INFO L472 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-07-25 13:20:15,608 INFO L473 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-25 13:20:15,608 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-07-25 13:20:15,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-07-25 13:20:15,609 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:15,609 INFO L354 BasicCegarLoop]: trace histogram [95, 94, 1, 1, 1, 1, 1] [2018-07-25 13:20:15,609 INFO L415 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:15,610 INFO L82 PathProgramCache]: Analyzing trace with hash -561469885, now seen corresponding path program 94 times [2018-07-25 13:20:15,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:15,897 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:15,897 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:15,897 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-25 13:20:15,897 INFO L451 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-25 13:20:15,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-25 13:20:15,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:20:15,899 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 97 states. [2018-07-25 13:20:16,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:16,073 INFO L93 Difference]: Finished difference Result 201 states and 203 transitions. [2018-07-25 13:20:16,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-25 13:20:16,074 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 194 [2018-07-25 13:20:16,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:16,075 INFO L225 Difference]: With dead ends: 201 [2018-07-25 13:20:16,075 INFO L226 Difference]: Without dead ends: 197 [2018-07-25 13:20:16,076 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:20:16,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-07-25 13:20:16,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-07-25 13:20:16,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-07-25 13:20:16,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-07-25 13:20:16,081 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2018-07-25 13:20:16,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:16,081 INFO L472 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-07-25 13:20:16,081 INFO L473 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-25 13:20:16,082 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-07-25 13:20:16,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-07-25 13:20:16,083 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:16,083 INFO L354 BasicCegarLoop]: trace histogram [96, 95, 1, 1, 1, 1, 1] [2018-07-25 13:20:16,083 INFO L415 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:16,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1509761599, now seen corresponding path program 95 times [2018-07-25 13:20:16,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:16,497 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:16,497 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:16,497 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-25 13:20:16,498 INFO L451 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-25 13:20:16,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-25 13:20:16,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 13:20:16,499 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 98 states. [2018-07-25 13:20:16,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:16,654 INFO L93 Difference]: Finished difference Result 203 states and 205 transitions. [2018-07-25 13:20:16,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-25 13:20:16,654 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 196 [2018-07-25 13:20:16,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:16,655 INFO L225 Difference]: With dead ends: 203 [2018-07-25 13:20:16,655 INFO L226 Difference]: Without dead ends: 199 [2018-07-25 13:20:16,656 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 13:20:16,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-07-25 13:20:16,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-07-25 13:20:16,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-07-25 13:20:16,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-07-25 13:20:16,661 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2018-07-25 13:20:16,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:16,662 INFO L472 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-07-25 13:20:16,662 INFO L473 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-25 13:20:16,662 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-07-25 13:20:16,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-07-25 13:20:16,663 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:16,663 INFO L354 BasicCegarLoop]: trace histogram [97, 96, 1, 1, 1, 1, 1] [2018-07-25 13:20:16,663 INFO L415 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:16,664 INFO L82 PathProgramCache]: Analyzing trace with hash -901607621, now seen corresponding path program 96 times [2018-07-25 13:20:16,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:16,948 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:16,949 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:16,949 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-25 13:20:16,949 INFO L451 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-25 13:20:16,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-25 13:20:16,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 13:20:16,950 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 99 states. [2018-07-25 13:20:17,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:17,113 INFO L93 Difference]: Finished difference Result 205 states and 207 transitions. [2018-07-25 13:20:17,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-25 13:20:17,113 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 198 [2018-07-25 13:20:17,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:17,114 INFO L225 Difference]: With dead ends: 205 [2018-07-25 13:20:17,115 INFO L226 Difference]: Without dead ends: 201 [2018-07-25 13:20:17,116 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 13:20:17,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-07-25 13:20:17,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-07-25 13:20:17,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-07-25 13:20:17,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-07-25 13:20:17,121 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2018-07-25 13:20:17,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:17,121 INFO L472 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-07-25 13:20:17,121 INFO L473 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-25 13:20:17,121 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-07-25 13:20:17,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-07-25 13:20:17,122 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:17,123 INFO L354 BasicCegarLoop]: trace histogram [98, 97, 1, 1, 1, 1, 1] [2018-07-25 13:20:17,123 INFO L415 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:17,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1054911799, now seen corresponding path program 97 times [2018-07-25 13:20:17,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:17,429 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:17,429 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:17,429 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-25 13:20:17,430 INFO L451 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-25 13:20:17,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-25 13:20:17,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 13:20:17,432 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 100 states. [2018-07-25 13:20:17,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:17,591 INFO L93 Difference]: Finished difference Result 207 states and 209 transitions. [2018-07-25 13:20:17,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-25 13:20:17,591 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 200 [2018-07-25 13:20:17,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:17,592 INFO L225 Difference]: With dead ends: 207 [2018-07-25 13:20:17,592 INFO L226 Difference]: Without dead ends: 203 [2018-07-25 13:20:17,594 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 13:20:17,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-07-25 13:20:17,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-07-25 13:20:17,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-25 13:20:17,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2018-07-25 13:20:17,599 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2018-07-25 13:20:17,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:17,599 INFO L472 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2018-07-25 13:20:17,599 INFO L473 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-25 13:20:17,599 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2018-07-25 13:20:17,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-07-25 13:20:17,600 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:17,600 INFO L354 BasicCegarLoop]: trace histogram [99, 98, 1, 1, 1, 1, 1] [2018-07-25 13:20:17,600 INFO L415 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:17,601 INFO L82 PathProgramCache]: Analyzing trace with hash 74398771, now seen corresponding path program 98 times [2018-07-25 13:20:17,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:17,930 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:17,930 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:17,930 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-25 13:20:17,930 INFO L451 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-25 13:20:17,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-25 13:20:17,932 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 13:20:17,932 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 101 states. [2018-07-25 13:20:18,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:18,071 INFO L93 Difference]: Finished difference Result 209 states and 211 transitions. [2018-07-25 13:20:18,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-25 13:20:18,072 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 202 [2018-07-25 13:20:18,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:18,073 INFO L225 Difference]: With dead ends: 209 [2018-07-25 13:20:18,073 INFO L226 Difference]: Without dead ends: 205 [2018-07-25 13:20:18,073 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 13:20:18,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-07-25 13:20:18,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-07-25 13:20:18,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-07-25 13:20:18,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-07-25 13:20:18,077 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2018-07-25 13:20:18,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:18,078 INFO L472 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-07-25 13:20:18,078 INFO L473 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-25 13:20:18,078 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-07-25 13:20:18,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-07-25 13:20:18,078 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:18,078 INFO L354 BasicCegarLoop]: trace histogram [100, 99, 1, 1, 1, 1, 1] [2018-07-25 13:20:18,079 INFO L415 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:18,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1600783313, now seen corresponding path program 99 times [2018-07-25 13:20:18,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:18,403 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:18,403 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:18,403 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-25 13:20:18,404 INFO L451 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-25 13:20:18,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-25 13:20:18,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 13:20:18,405 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 102 states. [2018-07-25 13:20:18,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:18,484 INFO L93 Difference]: Finished difference Result 211 states and 213 transitions. [2018-07-25 13:20:18,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-25 13:20:18,485 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 204 [2018-07-25 13:20:18,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:18,485 INFO L225 Difference]: With dead ends: 211 [2018-07-25 13:20:18,486 INFO L226 Difference]: Without dead ends: 207 [2018-07-25 13:20:18,487 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 13:20:18,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-07-25 13:20:18,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-07-25 13:20:18,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-07-25 13:20:18,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-07-25 13:20:18,492 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2018-07-25 13:20:18,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:18,492 INFO L472 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-07-25 13:20:18,492 INFO L473 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-25 13:20:18,492 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-07-25 13:20:18,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-07-25 13:20:18,493 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:18,493 INFO L354 BasicCegarLoop]: trace histogram [101, 100, 1, 1, 1, 1, 1] [2018-07-25 13:20:18,494 INFO L415 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:18,494 INFO L82 PathProgramCache]: Analyzing trace with hash -838030037, now seen corresponding path program 100 times [2018-07-25 13:20:18,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:18,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:18,896 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:18,896 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-25 13:20:18,896 INFO L451 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-25 13:20:18,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-25 13:20:18,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 13:20:18,898 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 103 states. [2018-07-25 13:20:19,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:19,061 INFO L93 Difference]: Finished difference Result 213 states and 215 transitions. [2018-07-25 13:20:19,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-25 13:20:19,061 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 206 [2018-07-25 13:20:19,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:19,062 INFO L225 Difference]: With dead ends: 213 [2018-07-25 13:20:19,062 INFO L226 Difference]: Without dead ends: 209 [2018-07-25 13:20:19,063 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 13:20:19,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-07-25 13:20:19,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-07-25 13:20:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-07-25 13:20:19,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2018-07-25 13:20:19,068 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2018-07-25 13:20:19,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:19,069 INFO L472 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2018-07-25 13:20:19,069 INFO L473 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-25 13:20:19,069 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2018-07-25 13:20:19,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-07-25 13:20:19,070 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:19,070 INFO L354 BasicCegarLoop]: trace histogram [102, 101, 1, 1, 1, 1, 1] [2018-07-25 13:20:19,070 INFO L415 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:19,071 INFO L82 PathProgramCache]: Analyzing trace with hash 2023427879, now seen corresponding path program 101 times [2018-07-25 13:20:19,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:19,551 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:19,552 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:19,552 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-25 13:20:19,552 INFO L451 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-25 13:20:19,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-25 13:20:19,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 13:20:19,554 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 104 states. [2018-07-25 13:20:19,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:19,718 INFO L93 Difference]: Finished difference Result 215 states and 217 transitions. [2018-07-25 13:20:19,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-25 13:20:19,718 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 208 [2018-07-25 13:20:19,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:19,719 INFO L225 Difference]: With dead ends: 215 [2018-07-25 13:20:19,719 INFO L226 Difference]: Without dead ends: 211 [2018-07-25 13:20:19,721 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 13:20:19,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-07-25 13:20:19,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-07-25 13:20:19,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-07-25 13:20:19,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-07-25 13:20:19,726 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2018-07-25 13:20:19,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:19,726 INFO L472 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-07-25 13:20:19,726 INFO L473 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-25 13:20:19,727 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-07-25 13:20:19,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-07-25 13:20:19,728 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:19,728 INFO L354 BasicCegarLoop]: trace histogram [103, 102, 1, 1, 1, 1, 1] [2018-07-25 13:20:19,728 INFO L415 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:19,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1189551581, now seen corresponding path program 102 times [2018-07-25 13:20:19,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:20,049 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:20,049 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:20,049 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-07-25 13:20:20,049 INFO L451 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-25 13:20:20,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-25 13:20:20,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 13:20:20,052 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 105 states. [2018-07-25 13:20:20,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:20,191 INFO L93 Difference]: Finished difference Result 217 states and 219 transitions. [2018-07-25 13:20:20,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-07-25 13:20:20,191 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 210 [2018-07-25 13:20:20,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:20,192 INFO L225 Difference]: With dead ends: 217 [2018-07-25 13:20:20,192 INFO L226 Difference]: Without dead ends: 213 [2018-07-25 13:20:20,193 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 13:20:20,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-07-25 13:20:20,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-07-25 13:20:20,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-07-25 13:20:20,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2018-07-25 13:20:20,198 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2018-07-25 13:20:20,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:20,198 INFO L472 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2018-07-25 13:20:20,198 INFO L473 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-25 13:20:20,198 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2018-07-25 13:20:20,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-07-25 13:20:20,200 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:20,200 INFO L354 BasicCegarLoop]: trace histogram [104, 103, 1, 1, 1, 1, 1] [2018-07-25 13:20:20,200 INFO L415 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:20,200 INFO L82 PathProgramCache]: Analyzing trace with hash -781326817, now seen corresponding path program 103 times [2018-07-25 13:20:20,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:20,565 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:20,565 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-25 13:20:20,566 INFO L451 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-07-25 13:20:20,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-07-25 13:20:20,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 13:20:20,568 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 106 states. [2018-07-25 13:20:20,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:20,690 INFO L93 Difference]: Finished difference Result 219 states and 221 transitions. [2018-07-25 13:20:20,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-25 13:20:20,690 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 212 [2018-07-25 13:20:20,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:20,691 INFO L225 Difference]: With dead ends: 219 [2018-07-25 13:20:20,691 INFO L226 Difference]: Without dead ends: 215 [2018-07-25 13:20:20,692 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 13:20:20,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-07-25 13:20:20,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-07-25 13:20:20,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-07-25 13:20:20,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2018-07-25 13:20:20,697 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 212 [2018-07-25 13:20:20,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:20,697 INFO L472 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2018-07-25 13:20:20,697 INFO L473 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-07-25 13:20:20,697 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2018-07-25 13:20:20,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-07-25 13:20:20,698 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:20,698 INFO L354 BasicCegarLoop]: trace histogram [105, 104, 1, 1, 1, 1, 1] [2018-07-25 13:20:20,699 INFO L415 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:20,699 INFO L82 PathProgramCache]: Analyzing trace with hash 680647451, now seen corresponding path program 104 times [2018-07-25 13:20:20,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:21,059 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:21,059 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:21,060 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-07-25 13:20:21,060 INFO L451 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-07-25 13:20:21,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-07-25 13:20:21,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 13:20:21,062 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 107 states. [2018-07-25 13:20:21,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:21,240 INFO L93 Difference]: Finished difference Result 221 states and 223 transitions. [2018-07-25 13:20:21,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-07-25 13:20:21,240 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 214 [2018-07-25 13:20:21,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:21,241 INFO L225 Difference]: With dead ends: 221 [2018-07-25 13:20:21,241 INFO L226 Difference]: Without dead ends: 217 [2018-07-25 13:20:21,242 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 13:20:21,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-07-25 13:20:21,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-07-25 13:20:21,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-07-25 13:20:21,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-07-25 13:20:21,246 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 214 [2018-07-25 13:20:21,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:21,247 INFO L472 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-07-25 13:20:21,247 INFO L473 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-07-25 13:20:21,247 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-07-25 13:20:21,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-07-25 13:20:21,248 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:21,248 INFO L354 BasicCegarLoop]: trace histogram [106, 105, 1, 1, 1, 1, 1] [2018-07-25 13:20:21,248 INFO L415 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:21,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1183613207, now seen corresponding path program 105 times [2018-07-25 13:20:21,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:21,723 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:21,723 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:21,723 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-07-25 13:20:21,723 INFO L451 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-07-25 13:20:21,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-07-25 13:20:21,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 13:20:21,725 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 108 states. [2018-07-25 13:20:21,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:21,896 INFO L93 Difference]: Finished difference Result 223 states and 225 transitions. [2018-07-25 13:20:21,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-25 13:20:21,896 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 216 [2018-07-25 13:20:21,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:21,897 INFO L225 Difference]: With dead ends: 223 [2018-07-25 13:20:21,897 INFO L226 Difference]: Without dead ends: 219 [2018-07-25 13:20:21,898 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 13:20:21,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-07-25 13:20:21,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-07-25 13:20:21,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-07-25 13:20:21,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 220 transitions. [2018-07-25 13:20:21,901 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 220 transitions. Word has length 216 [2018-07-25 13:20:21,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:21,901 INFO L472 AbstractCegarLoop]: Abstraction has 219 states and 220 transitions. [2018-07-25 13:20:21,901 INFO L473 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-07-25 13:20:21,901 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 220 transitions. [2018-07-25 13:20:21,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-07-25 13:20:21,902 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:21,902 INFO L354 BasicCegarLoop]: trace histogram [107, 106, 1, 1, 1, 1, 1] [2018-07-25 13:20:21,902 INFO L415 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:21,903 INFO L82 PathProgramCache]: Analyzing trace with hash -797599725, now seen corresponding path program 106 times [2018-07-25 13:20:21,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:22,256 INFO L134 CoverageAnalysis]: Checked inductivity of 11342 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:22,256 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:22,257 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-07-25 13:20:22,257 INFO L451 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-07-25 13:20:22,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-07-25 13:20:22,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 13:20:22,259 INFO L87 Difference]: Start difference. First operand 219 states and 220 transitions. Second operand 109 states. [2018-07-25 13:20:22,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:22,585 INFO L93 Difference]: Finished difference Result 225 states and 227 transitions. [2018-07-25 13:20:22,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-07-25 13:20:22,586 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 218 [2018-07-25 13:20:22,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:22,586 INFO L225 Difference]: With dead ends: 225 [2018-07-25 13:20:22,587 INFO L226 Difference]: Without dead ends: 221 [2018-07-25 13:20:22,588 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 13:20:22,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-07-25 13:20:22,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-07-25 13:20:22,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-07-25 13:20:22,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 222 transitions. [2018-07-25 13:20:22,594 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 222 transitions. Word has length 218 [2018-07-25 13:20:22,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:22,594 INFO L472 AbstractCegarLoop]: Abstraction has 221 states and 222 transitions. [2018-07-25 13:20:22,594 INFO L473 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-07-25 13:20:22,595 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 222 transitions. [2018-07-25 13:20:22,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-07-25 13:20:22,596 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:22,596 INFO L354 BasicCegarLoop]: trace histogram [108, 107, 1, 1, 1, 1, 1] [2018-07-25 13:20:22,596 INFO L415 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:22,597 INFO L82 PathProgramCache]: Analyzing trace with hash -2072715249, now seen corresponding path program 107 times [2018-07-25 13:20:22,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:23,068 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:23,069 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:23,069 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-07-25 13:20:23,069 INFO L451 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-07-25 13:20:23,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-07-25 13:20:23,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 13:20:23,071 INFO L87 Difference]: Start difference. First operand 221 states and 222 transitions. Second operand 110 states. [2018-07-25 13:20:23,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:23,283 INFO L93 Difference]: Finished difference Result 227 states and 229 transitions. [2018-07-25 13:20:23,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-07-25 13:20:23,284 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 220 [2018-07-25 13:20:23,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:23,284 INFO L225 Difference]: With dead ends: 227 [2018-07-25 13:20:23,284 INFO L226 Difference]: Without dead ends: 223 [2018-07-25 13:20:23,286 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 13:20:23,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-07-25 13:20:23,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-07-25 13:20:23,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-07-25 13:20:23,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 224 transitions. [2018-07-25 13:20:23,290 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 224 transitions. Word has length 220 [2018-07-25 13:20:23,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:23,290 INFO L472 AbstractCegarLoop]: Abstraction has 223 states and 224 transitions. [2018-07-25 13:20:23,290 INFO L473 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-07-25 13:20:23,290 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 224 transitions. [2018-07-25 13:20:23,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-07-25 13:20:23,291 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:23,292 INFO L354 BasicCegarLoop]: trace histogram [109, 108, 1, 1, 1, 1, 1] [2018-07-25 13:20:23,292 INFO L415 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:23,292 INFO L82 PathProgramCache]: Analyzing trace with hash 901912843, now seen corresponding path program 108 times [2018-07-25 13:20:23,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:23,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:23,680 INFO L134 CoverageAnalysis]: Checked inductivity of 11772 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:23,681 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:23,681 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-07-25 13:20:23,681 INFO L451 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-07-25 13:20:23,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-07-25 13:20:23,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 13:20:23,684 INFO L87 Difference]: Start difference. First operand 223 states and 224 transitions. Second operand 111 states. [2018-07-25 13:20:23,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:23,901 INFO L93 Difference]: Finished difference Result 229 states and 231 transitions. [2018-07-25 13:20:23,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-25 13:20:23,901 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 222 [2018-07-25 13:20:23,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:23,901 INFO L225 Difference]: With dead ends: 229 [2018-07-25 13:20:23,902 INFO L226 Difference]: Without dead ends: 225 [2018-07-25 13:20:23,902 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 13:20:23,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-07-25 13:20:23,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-07-25 13:20:23,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-07-25 13:20:23,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2018-07-25 13:20:23,905 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 222 [2018-07-25 13:20:23,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:23,906 INFO L472 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2018-07-25 13:20:23,906 INFO L473 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-07-25 13:20:23,906 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2018-07-25 13:20:23,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-07-25 13:20:23,907 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:23,907 INFO L354 BasicCegarLoop]: trace histogram [110, 109, 1, 1, 1, 1, 1] [2018-07-25 13:20:23,907 INFO L415 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:23,907 INFO L82 PathProgramCache]: Analyzing trace with hash -928709881, now seen corresponding path program 109 times [2018-07-25 13:20:23,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:24,278 INFO L134 CoverageAnalysis]: Checked inductivity of 11990 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:24,278 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:24,278 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-07-25 13:20:24,279 INFO L451 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-07-25 13:20:24,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-07-25 13:20:24,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 13:20:24,281 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 112 states. [2018-07-25 13:20:24,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:24,569 INFO L93 Difference]: Finished difference Result 231 states and 233 transitions. [2018-07-25 13:20:24,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-25 13:20:24,569 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 224 [2018-07-25 13:20:24,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:24,570 INFO L225 Difference]: With dead ends: 231 [2018-07-25 13:20:24,570 INFO L226 Difference]: Without dead ends: 227 [2018-07-25 13:20:24,571 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 13:20:24,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-07-25 13:20:24,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-07-25 13:20:24,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-07-25 13:20:24,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 228 transitions. [2018-07-25 13:20:24,576 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 228 transitions. Word has length 224 [2018-07-25 13:20:24,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:24,576 INFO L472 AbstractCegarLoop]: Abstraction has 227 states and 228 transitions. [2018-07-25 13:20:24,576 INFO L473 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-07-25 13:20:24,576 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 228 transitions. [2018-07-25 13:20:24,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-07-25 13:20:24,577 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:24,577 INFO L354 BasicCegarLoop]: trace histogram [111, 110, 1, 1, 1, 1, 1] [2018-07-25 13:20:24,577 INFO L415 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:24,577 INFO L82 PathProgramCache]: Analyzing trace with hash 779443715, now seen corresponding path program 110 times [2018-07-25 13:20:24,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:25,013 INFO L134 CoverageAnalysis]: Checked inductivity of 12210 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:25,014 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:25,014 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-07-25 13:20:25,014 INFO L451 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-07-25 13:20:25,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-07-25 13:20:25,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 13:20:25,015 INFO L87 Difference]: Start difference. First operand 227 states and 228 transitions. Second operand 113 states. [2018-07-25 13:20:25,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:25,245 INFO L93 Difference]: Finished difference Result 233 states and 235 transitions. [2018-07-25 13:20:25,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-25 13:20:25,245 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 226 [2018-07-25 13:20:25,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:25,246 INFO L225 Difference]: With dead ends: 233 [2018-07-25 13:20:25,246 INFO L226 Difference]: Without dead ends: 229 [2018-07-25 13:20:25,247 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 13:20:25,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-07-25 13:20:25,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-07-25 13:20:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-07-25 13:20:25,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 230 transitions. [2018-07-25 13:20:25,250 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 230 transitions. Word has length 226 [2018-07-25 13:20:25,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:25,250 INFO L472 AbstractCegarLoop]: Abstraction has 229 states and 230 transitions. [2018-07-25 13:20:25,250 INFO L473 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-07-25 13:20:25,250 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 230 transitions. [2018-07-25 13:20:25,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-07-25 13:20:25,251 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:25,251 INFO L354 BasicCegarLoop]: trace histogram [112, 111, 1, 1, 1, 1, 1] [2018-07-25 13:20:25,251 INFO L415 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:25,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1637542399, now seen corresponding path program 111 times [2018-07-25 13:20:25,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:25,623 INFO L134 CoverageAnalysis]: Checked inductivity of 12432 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:25,624 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:25,624 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-07-25 13:20:25,624 INFO L451 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-07-25 13:20:25,625 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-07-25 13:20:25,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 13:20:25,626 INFO L87 Difference]: Start difference. First operand 229 states and 230 transitions. Second operand 114 states. [2018-07-25 13:20:25,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:25,882 INFO L93 Difference]: Finished difference Result 235 states and 237 transitions. [2018-07-25 13:20:25,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-07-25 13:20:25,882 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 228 [2018-07-25 13:20:25,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:25,883 INFO L225 Difference]: With dead ends: 235 [2018-07-25 13:20:25,883 INFO L226 Difference]: Without dead ends: 231 [2018-07-25 13:20:25,885 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 13:20:25,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-07-25 13:20:25,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-07-25 13:20:25,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-07-25 13:20:25,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2018-07-25 13:20:25,889 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 228 [2018-07-25 13:20:25,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:25,889 INFO L472 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2018-07-25 13:20:25,890 INFO L473 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-07-25 13:20:25,890 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2018-07-25 13:20:25,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-07-25 13:20:25,891 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:25,891 INFO L354 BasicCegarLoop]: trace histogram [113, 112, 1, 1, 1, 1, 1] [2018-07-25 13:20:25,891 INFO L415 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:25,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1636656891, now seen corresponding path program 112 times [2018-07-25 13:20:25,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:26,291 INFO L134 CoverageAnalysis]: Checked inductivity of 12656 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:26,291 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:26,291 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-07-25 13:20:26,292 INFO L451 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-07-25 13:20:26,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-07-25 13:20:26,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 13:20:26,294 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 115 states. [2018-07-25 13:20:26,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:26,519 INFO L93 Difference]: Finished difference Result 237 states and 239 transitions. [2018-07-25 13:20:26,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-07-25 13:20:26,520 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 230 [2018-07-25 13:20:26,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:26,520 INFO L225 Difference]: With dead ends: 237 [2018-07-25 13:20:26,521 INFO L226 Difference]: Without dead ends: 233 [2018-07-25 13:20:26,522 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 13:20:26,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-07-25 13:20:26,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-07-25 13:20:26,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-07-25 13:20:26,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 234 transitions. [2018-07-25 13:20:26,527 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 234 transitions. Word has length 230 [2018-07-25 13:20:26,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:26,527 INFO L472 AbstractCegarLoop]: Abstraction has 233 states and 234 transitions. [2018-07-25 13:20:26,527 INFO L473 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-07-25 13:20:26,527 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 234 transitions. [2018-07-25 13:20:26,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-07-25 13:20:26,528 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:26,528 INFO L354 BasicCegarLoop]: trace histogram [114, 113, 1, 1, 1, 1, 1] [2018-07-25 13:20:26,529 INFO L415 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:26,529 INFO L82 PathProgramCache]: Analyzing trace with hash 785683703, now seen corresponding path program 113 times [2018-07-25 13:20:26,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:27,109 INFO L134 CoverageAnalysis]: Checked inductivity of 12882 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:27,109 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:27,109 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-07-25 13:20:27,110 INFO L451 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-07-25 13:20:27,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-07-25 13:20:27,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 13:20:27,113 INFO L87 Difference]: Start difference. First operand 233 states and 234 transitions. Second operand 116 states. [2018-07-25 13:20:27,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:27,307 INFO L93 Difference]: Finished difference Result 239 states and 241 transitions. [2018-07-25 13:20:27,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-25 13:20:27,307 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 232 [2018-07-25 13:20:27,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:27,308 INFO L225 Difference]: With dead ends: 239 [2018-07-25 13:20:27,308 INFO L226 Difference]: Without dead ends: 235 [2018-07-25 13:20:27,309 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 13:20:27,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-07-25 13:20:27,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-07-25 13:20:27,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-07-25 13:20:27,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 236 transitions. [2018-07-25 13:20:27,314 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 236 transitions. Word has length 232 [2018-07-25 13:20:27,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:27,314 INFO L472 AbstractCegarLoop]: Abstraction has 235 states and 236 transitions. [2018-07-25 13:20:27,315 INFO L473 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-07-25 13:20:27,315 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 236 transitions. [2018-07-25 13:20:27,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-07-25 13:20:27,316 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:27,316 INFO L354 BasicCegarLoop]: trace histogram [115, 114, 1, 1, 1, 1, 1] [2018-07-25 13:20:27,316 INFO L415 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:27,317 INFO L82 PathProgramCache]: Analyzing trace with hash -955763725, now seen corresponding path program 114 times [2018-07-25 13:20:27,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:27,773 INFO L134 CoverageAnalysis]: Checked inductivity of 13110 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:27,773 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:27,774 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-07-25 13:20:27,774 INFO L451 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-07-25 13:20:27,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-07-25 13:20:27,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 13:20:27,776 INFO L87 Difference]: Start difference. First operand 235 states and 236 transitions. Second operand 117 states. [2018-07-25 13:20:28,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:28,056 INFO L93 Difference]: Finished difference Result 241 states and 243 transitions. [2018-07-25 13:20:28,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-07-25 13:20:28,056 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 234 [2018-07-25 13:20:28,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:28,057 INFO L225 Difference]: With dead ends: 241 [2018-07-25 13:20:28,057 INFO L226 Difference]: Without dead ends: 237 [2018-07-25 13:20:28,059 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 13:20:28,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-07-25 13:20:28,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-07-25 13:20:28,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-07-25 13:20:28,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 238 transitions. [2018-07-25 13:20:28,066 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 238 transitions. Word has length 234 [2018-07-25 13:20:28,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:28,066 INFO L472 AbstractCegarLoop]: Abstraction has 237 states and 238 transitions. [2018-07-25 13:20:28,066 INFO L473 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-07-25 13:20:28,067 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 238 transitions. [2018-07-25 13:20:28,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-07-25 13:20:28,068 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:28,068 INFO L354 BasicCegarLoop]: trace histogram [116, 115, 1, 1, 1, 1, 1] [2018-07-25 13:20:28,068 INFO L415 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:28,069 INFO L82 PathProgramCache]: Analyzing trace with hash 550503407, now seen corresponding path program 115 times [2018-07-25 13:20:28,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:28,737 INFO L134 CoverageAnalysis]: Checked inductivity of 13340 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:28,738 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:28,738 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-07-25 13:20:28,738 INFO L451 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-07-25 13:20:28,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-07-25 13:20:28,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 13:20:28,740 INFO L87 Difference]: Start difference. First operand 237 states and 238 transitions. Second operand 118 states. [2018-07-25 13:20:28,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:28,927 INFO L93 Difference]: Finished difference Result 243 states and 245 transitions. [2018-07-25 13:20:28,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-25 13:20:28,927 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 236 [2018-07-25 13:20:28,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:28,927 INFO L225 Difference]: With dead ends: 243 [2018-07-25 13:20:28,927 INFO L226 Difference]: Without dead ends: 239 [2018-07-25 13:20:28,928 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 13:20:28,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-07-25 13:20:28,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-07-25 13:20:28,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-07-25 13:20:28,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 240 transitions. [2018-07-25 13:20:28,932 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 240 transitions. Word has length 236 [2018-07-25 13:20:28,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:28,932 INFO L472 AbstractCegarLoop]: Abstraction has 239 states and 240 transitions. [2018-07-25 13:20:28,932 INFO L473 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-07-25 13:20:28,932 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 240 transitions. [2018-07-25 13:20:28,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-07-25 13:20:28,933 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:28,933 INFO L354 BasicCegarLoop]: trace histogram [117, 116, 1, 1, 1, 1, 1] [2018-07-25 13:20:28,934 INFO L415 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:28,934 INFO L82 PathProgramCache]: Analyzing trace with hash 669238507, now seen corresponding path program 116 times [2018-07-25 13:20:28,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:29,409 INFO L134 CoverageAnalysis]: Checked inductivity of 13572 backedges. 0 proven. 13572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:29,410 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:29,410 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-07-25 13:20:29,410 INFO L451 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-07-25 13:20:29,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-07-25 13:20:29,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 13:20:29,412 INFO L87 Difference]: Start difference. First operand 239 states and 240 transitions. Second operand 119 states. [2018-07-25 13:20:29,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:29,580 INFO L93 Difference]: Finished difference Result 245 states and 247 transitions. [2018-07-25 13:20:29,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-07-25 13:20:29,580 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 238 [2018-07-25 13:20:29,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:29,580 INFO L225 Difference]: With dead ends: 245 [2018-07-25 13:20:29,580 INFO L226 Difference]: Without dead ends: 241 [2018-07-25 13:20:29,582 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 13:20:29,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-07-25 13:20:29,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-07-25 13:20:29,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-07-25 13:20:29,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 242 transitions. [2018-07-25 13:20:29,586 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 242 transitions. Word has length 238 [2018-07-25 13:20:29,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:29,586 INFO L472 AbstractCegarLoop]: Abstraction has 241 states and 242 transitions. [2018-07-25 13:20:29,586 INFO L473 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-07-25 13:20:29,587 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 242 transitions. [2018-07-25 13:20:29,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-07-25 13:20:29,587 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:29,588 INFO L354 BasicCegarLoop]: trace histogram [118, 117, 1, 1, 1, 1, 1] [2018-07-25 13:20:29,588 INFO L415 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:29,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1190447385, now seen corresponding path program 117 times [2018-07-25 13:20:29,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:30,046 INFO L134 CoverageAnalysis]: Checked inductivity of 13806 backedges. 0 proven. 13806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:30,047 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:30,047 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-07-25 13:20:30,047 INFO L451 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-07-25 13:20:30,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-07-25 13:20:30,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 13:20:30,050 INFO L87 Difference]: Start difference. First operand 241 states and 242 transitions. Second operand 120 states. [2018-07-25 13:20:30,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:30,341 INFO L93 Difference]: Finished difference Result 247 states and 249 transitions. [2018-07-25 13:20:30,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-07-25 13:20:30,341 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 240 [2018-07-25 13:20:30,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:30,342 INFO L225 Difference]: With dead ends: 247 [2018-07-25 13:20:30,342 INFO L226 Difference]: Without dead ends: 243 [2018-07-25 13:20:30,344 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 13:20:30,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-07-25 13:20:30,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-07-25 13:20:30,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-07-25 13:20:30,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 244 transitions. [2018-07-25 13:20:30,347 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 244 transitions. Word has length 240 [2018-07-25 13:20:30,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:30,347 INFO L472 AbstractCegarLoop]: Abstraction has 243 states and 244 transitions. [2018-07-25 13:20:30,347 INFO L473 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-07-25 13:20:30,347 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 244 transitions. [2018-07-25 13:20:30,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-07-25 13:20:30,348 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:30,348 INFO L354 BasicCegarLoop]: trace histogram [119, 118, 1, 1, 1, 1, 1] [2018-07-25 13:20:30,348 INFO L415 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:30,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1642194461, now seen corresponding path program 118 times [2018-07-25 13:20:30,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:30,854 INFO L134 CoverageAnalysis]: Checked inductivity of 14042 backedges. 0 proven. 14042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:30,855 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:30,855 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-07-25 13:20:30,855 INFO L451 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-07-25 13:20:30,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-07-25 13:20:30,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 13:20:30,857 INFO L87 Difference]: Start difference. First operand 243 states and 244 transitions. Second operand 121 states. [2018-07-25 13:20:31,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:31,119 INFO L93 Difference]: Finished difference Result 249 states and 251 transitions. [2018-07-25 13:20:31,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-07-25 13:20:31,119 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 242 [2018-07-25 13:20:31,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:31,120 INFO L225 Difference]: With dead ends: 249 [2018-07-25 13:20:31,120 INFO L226 Difference]: Without dead ends: 245 [2018-07-25 13:20:31,122 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 13:20:31,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-07-25 13:20:31,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-07-25 13:20:31,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-07-25 13:20:31,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 246 transitions. [2018-07-25 13:20:31,125 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 246 transitions. Word has length 242 [2018-07-25 13:20:31,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:31,125 INFO L472 AbstractCegarLoop]: Abstraction has 245 states and 246 transitions. [2018-07-25 13:20:31,125 INFO L473 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-07-25 13:20:31,125 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 246 transitions. [2018-07-25 13:20:31,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-07-25 13:20:31,126 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:31,126 INFO L354 BasicCegarLoop]: trace histogram [120, 119, 1, 1, 1, 1, 1] [2018-07-25 13:20:31,126 INFO L415 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:31,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1979437601, now seen corresponding path program 119 times [2018-07-25 13:20:31,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:31,726 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 14280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:31,726 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:31,726 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-07-25 13:20:31,726 INFO L451 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-07-25 13:20:31,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-07-25 13:20:31,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 13:20:31,728 INFO L87 Difference]: Start difference. First operand 245 states and 246 transitions. Second operand 122 states. [2018-07-25 13:20:31,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:31,834 INFO L93 Difference]: Finished difference Result 251 states and 253 transitions. [2018-07-25 13:20:31,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-07-25 13:20:31,835 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 244 [2018-07-25 13:20:31,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:31,835 INFO L225 Difference]: With dead ends: 251 [2018-07-25 13:20:31,835 INFO L226 Difference]: Without dead ends: 247 [2018-07-25 13:20:31,837 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 13:20:31,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-07-25 13:20:31,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-07-25 13:20:31,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-07-25 13:20:31,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 248 transitions. [2018-07-25 13:20:31,840 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 248 transitions. Word has length 244 [2018-07-25 13:20:31,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:31,840 INFO L472 AbstractCegarLoop]: Abstraction has 247 states and 248 transitions. [2018-07-25 13:20:31,840 INFO L473 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-07-25 13:20:31,840 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 248 transitions. [2018-07-25 13:20:31,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-07-25 13:20:31,841 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:31,841 INFO L354 BasicCegarLoop]: trace histogram [121, 120, 1, 1, 1, 1, 1] [2018-07-25 13:20:31,841 INFO L415 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:31,841 INFO L82 PathProgramCache]: Analyzing trace with hash 347419355, now seen corresponding path program 120 times [2018-07-25 13:20:31,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:32,370 INFO L134 CoverageAnalysis]: Checked inductivity of 14520 backedges. 0 proven. 14520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:32,370 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:32,370 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-07-25 13:20:32,370 INFO L451 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-07-25 13:20:32,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-07-25 13:20:32,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 13:20:32,374 INFO L87 Difference]: Start difference. First operand 247 states and 248 transitions. Second operand 123 states. [2018-07-25 13:20:32,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:32,722 INFO L93 Difference]: Finished difference Result 253 states and 255 transitions. [2018-07-25 13:20:32,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-07-25 13:20:32,722 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 246 [2018-07-25 13:20:32,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:32,723 INFO L225 Difference]: With dead ends: 253 [2018-07-25 13:20:32,723 INFO L226 Difference]: Without dead ends: 249 [2018-07-25 13:20:32,724 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 13:20:32,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-07-25 13:20:32,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-07-25 13:20:32,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-07-25 13:20:32,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 250 transitions. [2018-07-25 13:20:32,729 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 250 transitions. Word has length 246 [2018-07-25 13:20:32,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:32,729 INFO L472 AbstractCegarLoop]: Abstraction has 249 states and 250 transitions. [2018-07-25 13:20:32,729 INFO L473 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-07-25 13:20:32,729 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 250 transitions. [2018-07-25 13:20:32,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-07-25 13:20:32,730 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:32,730 INFO L354 BasicCegarLoop]: trace histogram [122, 121, 1, 1, 1, 1, 1] [2018-07-25 13:20:32,731 INFO L415 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:32,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1221007145, now seen corresponding path program 121 times [2018-07-25 13:20:32,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:33,234 INFO L134 CoverageAnalysis]: Checked inductivity of 14762 backedges. 0 proven. 14762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:33,235 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:33,235 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-07-25 13:20:33,235 INFO L451 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-07-25 13:20:33,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-07-25 13:20:33,237 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 13:20:33,237 INFO L87 Difference]: Start difference. First operand 249 states and 250 transitions. Second operand 124 states. [2018-07-25 13:20:33,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:33,558 INFO L93 Difference]: Finished difference Result 255 states and 257 transitions. [2018-07-25 13:20:33,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-07-25 13:20:33,558 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 248 [2018-07-25 13:20:33,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:33,559 INFO L225 Difference]: With dead ends: 255 [2018-07-25 13:20:33,559 INFO L226 Difference]: Without dead ends: 251 [2018-07-25 13:20:33,560 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 13:20:33,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-07-25 13:20:33,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-07-25 13:20:33,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-07-25 13:20:33,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 252 transitions. [2018-07-25 13:20:33,564 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 252 transitions. Word has length 248 [2018-07-25 13:20:33,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:33,564 INFO L472 AbstractCegarLoop]: Abstraction has 251 states and 252 transitions. [2018-07-25 13:20:33,564 INFO L473 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-07-25 13:20:33,564 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 252 transitions. [2018-07-25 13:20:33,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-07-25 13:20:33,565 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:33,565 INFO L354 BasicCegarLoop]: trace histogram [123, 122, 1, 1, 1, 1, 1] [2018-07-25 13:20:33,566 INFO L415 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:33,566 INFO L82 PathProgramCache]: Analyzing trace with hash -945352749, now seen corresponding path program 122 times [2018-07-25 13:20:33,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:33,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:34,210 INFO L134 CoverageAnalysis]: Checked inductivity of 15006 backedges. 0 proven. 15006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:34,211 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:34,211 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-07-25 13:20:34,211 INFO L451 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-07-25 13:20:34,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-07-25 13:20:34,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 13:20:34,214 INFO L87 Difference]: Start difference. First operand 251 states and 252 transitions. Second operand 125 states. [2018-07-25 13:20:34,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:34,534 INFO L93 Difference]: Finished difference Result 257 states and 259 transitions. [2018-07-25 13:20:34,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-07-25 13:20:34,534 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 250 [2018-07-25 13:20:34,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:34,535 INFO L225 Difference]: With dead ends: 257 [2018-07-25 13:20:34,535 INFO L226 Difference]: Without dead ends: 253 [2018-07-25 13:20:34,536 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 13:20:34,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-07-25 13:20:34,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-07-25 13:20:34,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-07-25 13:20:34,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 254 transitions. [2018-07-25 13:20:34,539 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 254 transitions. Word has length 250 [2018-07-25 13:20:34,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:34,540 INFO L472 AbstractCegarLoop]: Abstraction has 253 states and 254 transitions. [2018-07-25 13:20:34,540 INFO L473 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-07-25 13:20:34,540 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 254 transitions. [2018-07-25 13:20:34,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-07-25 13:20:34,541 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:34,541 INFO L354 BasicCegarLoop]: trace histogram [124, 123, 1, 1, 1, 1, 1] [2018-07-25 13:20:34,541 INFO L415 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:34,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1965516751, now seen corresponding path program 123 times [2018-07-25 13:20:34,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:35,103 INFO L134 CoverageAnalysis]: Checked inductivity of 15252 backedges. 0 proven. 15252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:35,103 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:35,103 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-07-25 13:20:35,104 INFO L451 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-07-25 13:20:35,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-07-25 13:20:35,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 13:20:35,106 INFO L87 Difference]: Start difference. First operand 253 states and 254 transitions. Second operand 126 states. [2018-07-25 13:20:35,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:35,429 INFO L93 Difference]: Finished difference Result 259 states and 261 transitions. [2018-07-25 13:20:35,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-07-25 13:20:35,429 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 252 [2018-07-25 13:20:35,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:35,430 INFO L225 Difference]: With dead ends: 259 [2018-07-25 13:20:35,430 INFO L226 Difference]: Without dead ends: 255 [2018-07-25 13:20:35,432 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 13:20:35,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-07-25 13:20:35,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-07-25 13:20:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-07-25 13:20:35,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 256 transitions. [2018-07-25 13:20:35,435 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 256 transitions. Word has length 252 [2018-07-25 13:20:35,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:35,435 INFO L472 AbstractCegarLoop]: Abstraction has 255 states and 256 transitions. [2018-07-25 13:20:35,435 INFO L473 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-07-25 13:20:35,436 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 256 transitions. [2018-07-25 13:20:35,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-07-25 13:20:35,436 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:35,436 INFO L354 BasicCegarLoop]: trace histogram [125, 124, 1, 1, 1, 1, 1] [2018-07-25 13:20:35,436 INFO L415 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:35,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1007570741, now seen corresponding path program 124 times [2018-07-25 13:20:35,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:36,148 INFO L134 CoverageAnalysis]: Checked inductivity of 15500 backedges. 0 proven. 15500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:36,149 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:36,149 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-07-25 13:20:36,149 INFO L451 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-07-25 13:20:36,150 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-07-25 13:20:36,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 13:20:36,150 INFO L87 Difference]: Start difference. First operand 255 states and 256 transitions. Second operand 127 states. [2018-07-25 13:20:36,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:36,460 INFO L93 Difference]: Finished difference Result 261 states and 263 transitions. [2018-07-25 13:20:36,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-07-25 13:20:36,460 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 254 [2018-07-25 13:20:36,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:36,461 INFO L225 Difference]: With dead ends: 261 [2018-07-25 13:20:36,461 INFO L226 Difference]: Without dead ends: 257 [2018-07-25 13:20:36,462 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 13:20:36,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-07-25 13:20:36,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2018-07-25 13:20:36,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-07-25 13:20:36,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 258 transitions. [2018-07-25 13:20:36,466 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 258 transitions. Word has length 254 [2018-07-25 13:20:36,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:36,467 INFO L472 AbstractCegarLoop]: Abstraction has 257 states and 258 transitions. [2018-07-25 13:20:36,467 INFO L473 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-07-25 13:20:36,467 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 258 transitions. [2018-07-25 13:20:36,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-07-25 13:20:36,468 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:36,468 INFO L354 BasicCegarLoop]: trace histogram [126, 125, 1, 1, 1, 1, 1] [2018-07-25 13:20:36,468 INFO L415 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:36,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1991398713, now seen corresponding path program 125 times [2018-07-25 13:20:36,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:37,043 INFO L134 CoverageAnalysis]: Checked inductivity of 15750 backedges. 0 proven. 15750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:37,044 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:37,044 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-07-25 13:20:37,044 INFO L451 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-07-25 13:20:37,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-07-25 13:20:37,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 13:20:37,048 INFO L87 Difference]: Start difference. First operand 257 states and 258 transitions. Second operand 128 states. [2018-07-25 13:20:37,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:37,415 INFO L93 Difference]: Finished difference Result 263 states and 265 transitions. [2018-07-25 13:20:37,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-07-25 13:20:37,415 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 256 [2018-07-25 13:20:37,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:37,416 INFO L225 Difference]: With dead ends: 263 [2018-07-25 13:20:37,416 INFO L226 Difference]: Without dead ends: 259 [2018-07-25 13:20:37,418 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 13:20:37,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-07-25 13:20:37,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-07-25 13:20:37,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-07-25 13:20:37,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 260 transitions. [2018-07-25 13:20:37,423 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 260 transitions. Word has length 256 [2018-07-25 13:20:37,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:37,423 INFO L472 AbstractCegarLoop]: Abstraction has 259 states and 260 transitions. [2018-07-25 13:20:37,423 INFO L473 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-07-25 13:20:37,423 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 260 transitions. [2018-07-25 13:20:37,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-07-25 13:20:37,424 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:37,424 INFO L354 BasicCegarLoop]: trace histogram [127, 126, 1, 1, 1, 1, 1] [2018-07-25 13:20:37,425 INFO L415 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:37,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1737692611, now seen corresponding path program 126 times [2018-07-25 13:20:37,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:38,019 INFO L134 CoverageAnalysis]: Checked inductivity of 16002 backedges. 0 proven. 16002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:38,019 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:38,019 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-07-25 13:20:38,019 INFO L451 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-07-25 13:20:38,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-07-25 13:20:38,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 13:20:38,023 INFO L87 Difference]: Start difference. First operand 259 states and 260 transitions. Second operand 129 states. [2018-07-25 13:20:38,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:38,413 INFO L93 Difference]: Finished difference Result 265 states and 267 transitions. [2018-07-25 13:20:38,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-07-25 13:20:38,413 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 258 [2018-07-25 13:20:38,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:38,414 INFO L225 Difference]: With dead ends: 265 [2018-07-25 13:20:38,414 INFO L226 Difference]: Without dead ends: 261 [2018-07-25 13:20:38,416 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 13:20:38,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-07-25 13:20:38,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2018-07-25 13:20:38,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-07-25 13:20:38,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 262 transitions. [2018-07-25 13:20:38,419 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 262 transitions. Word has length 258 [2018-07-25 13:20:38,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:38,420 INFO L472 AbstractCegarLoop]: Abstraction has 261 states and 262 transitions. [2018-07-25 13:20:38,420 INFO L473 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-07-25 13:20:38,420 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 262 transitions. [2018-07-25 13:20:38,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-07-25 13:20:38,421 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:38,421 INFO L354 BasicCegarLoop]: trace histogram [128, 127, 1, 1, 1, 1, 1] [2018-07-25 13:20:38,421 INFO L415 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:38,421 INFO L82 PathProgramCache]: Analyzing trace with hash -903237185, now seen corresponding path program 127 times [2018-07-25 13:20:38,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:39,248 INFO L134 CoverageAnalysis]: Checked inductivity of 16256 backedges. 0 proven. 16256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:39,249 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:39,255 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-07-25 13:20:39,256 INFO L451 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-07-25 13:20:39,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-07-25 13:20:39,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 13:20:39,262 INFO L87 Difference]: Start difference. First operand 261 states and 262 transitions. Second operand 130 states. [2018-07-25 13:20:39,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:39,478 INFO L93 Difference]: Finished difference Result 267 states and 269 transitions. [2018-07-25 13:20:39,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-07-25 13:20:39,478 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 260 [2018-07-25 13:20:39,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:39,479 INFO L225 Difference]: With dead ends: 267 [2018-07-25 13:20:39,479 INFO L226 Difference]: Without dead ends: 263 [2018-07-25 13:20:39,481 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 13:20:39,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-07-25 13:20:39,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-07-25 13:20:39,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-07-25 13:20:39,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 264 transitions. [2018-07-25 13:20:39,484 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 264 transitions. Word has length 260 [2018-07-25 13:20:39,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:39,485 INFO L472 AbstractCegarLoop]: Abstraction has 263 states and 264 transitions. [2018-07-25 13:20:39,485 INFO L473 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-07-25 13:20:39,485 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 264 transitions. [2018-07-25 13:20:39,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-07-25 13:20:39,486 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:39,486 INFO L354 BasicCegarLoop]: trace histogram [129, 128, 1, 1, 1, 1, 1] [2018-07-25 13:20:39,486 INFO L415 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:39,486 INFO L82 PathProgramCache]: Analyzing trace with hash -511099205, now seen corresponding path program 128 times [2018-07-25 13:20:39,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:40,050 INFO L134 CoverageAnalysis]: Checked inductivity of 16512 backedges. 0 proven. 16512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:40,050 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:40,051 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-07-25 13:20:40,051 INFO L451 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-07-25 13:20:40,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-07-25 13:20:40,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 13:20:40,054 INFO L87 Difference]: Start difference. First operand 263 states and 264 transitions. Second operand 131 states. [2018-07-25 13:20:40,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:40,385 INFO L93 Difference]: Finished difference Result 269 states and 271 transitions. [2018-07-25 13:20:40,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-07-25 13:20:40,385 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 262 [2018-07-25 13:20:40,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:40,386 INFO L225 Difference]: With dead ends: 269 [2018-07-25 13:20:40,386 INFO L226 Difference]: Without dead ends: 265 [2018-07-25 13:20:40,388 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 13:20:40,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-07-25 13:20:40,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2018-07-25 13:20:40,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-07-25 13:20:40,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 266 transitions. [2018-07-25 13:20:40,393 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 266 transitions. Word has length 262 [2018-07-25 13:20:40,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:40,393 INFO L472 AbstractCegarLoop]: Abstraction has 265 states and 266 transitions. [2018-07-25 13:20:40,393 INFO L473 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-07-25 13:20:40,393 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 266 transitions. [2018-07-25 13:20:40,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-07-25 13:20:40,394 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:40,395 INFO L354 BasicCegarLoop]: trace histogram [130, 129, 1, 1, 1, 1, 1] [2018-07-25 13:20:40,395 INFO L415 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:40,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1623622473, now seen corresponding path program 129 times [2018-07-25 13:20:40,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:41,035 INFO L134 CoverageAnalysis]: Checked inductivity of 16770 backedges. 0 proven. 16770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:41,036 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:41,036 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-07-25 13:20:41,036 INFO L451 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-07-25 13:20:41,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-07-25 13:20:41,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 13:20:41,039 INFO L87 Difference]: Start difference. First operand 265 states and 266 transitions. Second operand 132 states. [2018-07-25 13:20:41,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:41,465 INFO L93 Difference]: Finished difference Result 271 states and 273 transitions. [2018-07-25 13:20:41,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-07-25 13:20:41,465 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 264 [2018-07-25 13:20:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:41,466 INFO L225 Difference]: With dead ends: 271 [2018-07-25 13:20:41,466 INFO L226 Difference]: Without dead ends: 267 [2018-07-25 13:20:41,468 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 13:20:41,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-07-25 13:20:41,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-07-25 13:20:41,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-07-25 13:20:41,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 268 transitions. [2018-07-25 13:20:41,471 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 268 transitions. Word has length 264 [2018-07-25 13:20:41,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:41,471 INFO L472 AbstractCegarLoop]: Abstraction has 267 states and 268 transitions. [2018-07-25 13:20:41,471 INFO L473 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-07-25 13:20:41,471 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 268 transitions. [2018-07-25 13:20:41,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-07-25 13:20:41,472 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:41,472 INFO L354 BasicCegarLoop]: trace histogram [131, 130, 1, 1, 1, 1, 1] [2018-07-25 13:20:41,472 INFO L415 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:41,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1311626317, now seen corresponding path program 130 times [2018-07-25 13:20:41,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:42,075 INFO L134 CoverageAnalysis]: Checked inductivity of 17030 backedges. 0 proven. 17030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:42,075 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:42,075 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-07-25 13:20:42,076 INFO L451 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-07-25 13:20:42,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-07-25 13:20:42,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 13:20:42,078 INFO L87 Difference]: Start difference. First operand 267 states and 268 transitions. Second operand 133 states. [2018-07-25 13:20:42,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:42,218 INFO L93 Difference]: Finished difference Result 273 states and 275 transitions. [2018-07-25 13:20:42,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-07-25 13:20:42,218 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 266 [2018-07-25 13:20:42,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:42,219 INFO L225 Difference]: With dead ends: 273 [2018-07-25 13:20:42,219 INFO L226 Difference]: Without dead ends: 269 [2018-07-25 13:20:42,221 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 13:20:42,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-07-25 13:20:42,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-07-25 13:20:42,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-07-25 13:20:42,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 270 transitions. [2018-07-25 13:20:42,224 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 270 transitions. Word has length 266 [2018-07-25 13:20:42,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:42,224 INFO L472 AbstractCegarLoop]: Abstraction has 269 states and 270 transitions. [2018-07-25 13:20:42,224 INFO L473 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-07-25 13:20:42,224 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 270 transitions. [2018-07-25 13:20:42,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-07-25 13:20:42,225 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:42,225 INFO L354 BasicCegarLoop]: trace histogram [132, 131, 1, 1, 1, 1, 1] [2018-07-25 13:20:42,225 INFO L415 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:42,225 INFO L82 PathProgramCache]: Analyzing trace with hash -2131031121, now seen corresponding path program 131 times [2018-07-25 13:20:42,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:42,875 INFO L134 CoverageAnalysis]: Checked inductivity of 17292 backedges. 0 proven. 17292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:42,875 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:42,875 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-07-25 13:20:42,876 INFO L451 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-07-25 13:20:42,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-07-25 13:20:42,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 13:20:42,878 INFO L87 Difference]: Start difference. First operand 269 states and 270 transitions. Second operand 134 states. [2018-07-25 13:20:43,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:43,318 INFO L93 Difference]: Finished difference Result 275 states and 277 transitions. [2018-07-25 13:20:43,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-07-25 13:20:43,319 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 268 [2018-07-25 13:20:43,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:43,319 INFO L225 Difference]: With dead ends: 275 [2018-07-25 13:20:43,319 INFO L226 Difference]: Without dead ends: 271 [2018-07-25 13:20:43,321 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 13:20:43,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-07-25 13:20:43,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-07-25 13:20:43,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-07-25 13:20:43,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 272 transitions. [2018-07-25 13:20:43,324 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 272 transitions. Word has length 268 [2018-07-25 13:20:43,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:43,324 INFO L472 AbstractCegarLoop]: Abstraction has 271 states and 272 transitions. [2018-07-25 13:20:43,324 INFO L473 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-07-25 13:20:43,325 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 272 transitions. [2018-07-25 13:20:43,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-07-25 13:20:43,325 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:43,325 INFO L354 BasicCegarLoop]: trace histogram [133, 132, 1, 1, 1, 1, 1] [2018-07-25 13:20:43,325 INFO L415 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:43,326 INFO L82 PathProgramCache]: Analyzing trace with hash 694934699, now seen corresponding path program 132 times [2018-07-25 13:20:43,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:44,108 INFO L134 CoverageAnalysis]: Checked inductivity of 17556 backedges. 0 proven. 17556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:44,109 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:44,109 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-07-25 13:20:44,109 INFO L451 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-07-25 13:20:44,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-07-25 13:20:44,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 13:20:44,112 INFO L87 Difference]: Start difference. First operand 271 states and 272 transitions. Second operand 135 states. [2018-07-25 13:20:44,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:44,504 INFO L93 Difference]: Finished difference Result 277 states and 279 transitions. [2018-07-25 13:20:44,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-07-25 13:20:44,505 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 270 [2018-07-25 13:20:44,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:44,505 INFO L225 Difference]: With dead ends: 277 [2018-07-25 13:20:44,505 INFO L226 Difference]: Without dead ends: 273 [2018-07-25 13:20:44,507 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 13:20:44,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-07-25 13:20:44,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-07-25 13:20:44,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-07-25 13:20:44,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 274 transitions. [2018-07-25 13:20:44,512 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 274 transitions. Word has length 270 [2018-07-25 13:20:44,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:44,512 INFO L472 AbstractCegarLoop]: Abstraction has 273 states and 274 transitions. [2018-07-25 13:20:44,513 INFO L473 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-07-25 13:20:44,513 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 274 transitions. [2018-07-25 13:20:44,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-07-25 13:20:44,514 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:44,514 INFO L354 BasicCegarLoop]: trace histogram [134, 133, 1, 1, 1, 1, 1] [2018-07-25 13:20:44,514 INFO L415 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:44,514 INFO L82 PathProgramCache]: Analyzing trace with hash 2028756647, now seen corresponding path program 133 times [2018-07-25 13:20:44,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:45,312 INFO L134 CoverageAnalysis]: Checked inductivity of 17822 backedges. 0 proven. 17822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:45,313 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:45,313 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-07-25 13:20:45,313 INFO L451 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-07-25 13:20:45,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-07-25 13:20:45,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 13:20:45,317 INFO L87 Difference]: Start difference. First operand 273 states and 274 transitions. Second operand 136 states. [2018-07-25 13:20:45,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:45,832 INFO L93 Difference]: Finished difference Result 279 states and 281 transitions. [2018-07-25 13:20:45,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-07-25 13:20:45,832 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 272 [2018-07-25 13:20:45,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:45,832 INFO L225 Difference]: With dead ends: 279 [2018-07-25 13:20:45,833 INFO L226 Difference]: Without dead ends: 275 [2018-07-25 13:20:45,834 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 13:20:45,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-07-25 13:20:45,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-07-25 13:20:45,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-07-25 13:20:45,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 276 transitions. [2018-07-25 13:20:45,837 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 276 transitions. Word has length 272 [2018-07-25 13:20:45,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:45,838 INFO L472 AbstractCegarLoop]: Abstraction has 275 states and 276 transitions. [2018-07-25 13:20:45,838 INFO L473 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-07-25 13:20:45,838 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 276 transitions. [2018-07-25 13:20:45,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-07-25 13:20:45,838 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:45,839 INFO L354 BasicCegarLoop]: trace histogram [135, 134, 1, 1, 1, 1, 1] [2018-07-25 13:20:45,839 INFO L415 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:45,839 INFO L82 PathProgramCache]: Analyzing trace with hash -363572829, now seen corresponding path program 134 times [2018-07-25 13:20:45,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:46,564 INFO L134 CoverageAnalysis]: Checked inductivity of 18090 backedges. 0 proven. 18090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:46,564 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:46,564 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-07-25 13:20:46,565 INFO L451 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-07-25 13:20:46,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-07-25 13:20:46,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 13:20:46,568 INFO L87 Difference]: Start difference. First operand 275 states and 276 transitions. Second operand 137 states. [2018-07-25 13:20:47,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:47,013 INFO L93 Difference]: Finished difference Result 281 states and 283 transitions. [2018-07-25 13:20:47,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-07-25 13:20:47,013 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 274 [2018-07-25 13:20:47,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:47,014 INFO L225 Difference]: With dead ends: 281 [2018-07-25 13:20:47,014 INFO L226 Difference]: Without dead ends: 277 [2018-07-25 13:20:47,016 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 13:20:47,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-07-25 13:20:47,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-07-25 13:20:47,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-07-25 13:20:47,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 278 transitions. [2018-07-25 13:20:47,019 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 278 transitions. Word has length 274 [2018-07-25 13:20:47,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:47,019 INFO L472 AbstractCegarLoop]: Abstraction has 277 states and 278 transitions. [2018-07-25 13:20:47,019 INFO L473 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-07-25 13:20:47,019 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 278 transitions. [2018-07-25 13:20:47,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-07-25 13:20:47,020 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:47,020 INFO L354 BasicCegarLoop]: trace histogram [136, 135, 1, 1, 1, 1, 1] [2018-07-25 13:20:47,020 INFO L415 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:47,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1584695905, now seen corresponding path program 135 times [2018-07-25 13:20:47,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:47,753 INFO L134 CoverageAnalysis]: Checked inductivity of 18360 backedges. 0 proven. 18360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:47,753 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:47,753 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-07-25 13:20:47,753 INFO L451 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-07-25 13:20:47,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-07-25 13:20:47,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 13:20:47,756 INFO L87 Difference]: Start difference. First operand 277 states and 278 transitions. Second operand 138 states. [2018-07-25 13:20:48,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:48,073 INFO L93 Difference]: Finished difference Result 283 states and 285 transitions. [2018-07-25 13:20:48,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-07-25 13:20:48,073 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 276 [2018-07-25 13:20:48,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:48,074 INFO L225 Difference]: With dead ends: 283 [2018-07-25 13:20:48,074 INFO L226 Difference]: Without dead ends: 279 [2018-07-25 13:20:48,077 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 13:20:48,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-07-25 13:20:48,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-07-25 13:20:48,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-07-25 13:20:48,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 280 transitions. [2018-07-25 13:20:48,082 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 280 transitions. Word has length 276 [2018-07-25 13:20:48,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:48,082 INFO L472 AbstractCegarLoop]: Abstraction has 279 states and 280 transitions. [2018-07-25 13:20:48,083 INFO L473 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-07-25 13:20:48,083 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 280 transitions. [2018-07-25 13:20:48,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-07-25 13:20:48,084 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:48,084 INFO L354 BasicCegarLoop]: trace histogram [137, 136, 1, 1, 1, 1, 1] [2018-07-25 13:20:48,084 INFO L415 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:48,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1737067163, now seen corresponding path program 136 times [2018-07-25 13:20:48,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:48,990 INFO L134 CoverageAnalysis]: Checked inductivity of 18632 backedges. 0 proven. 18632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:48,991 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:48,991 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-07-25 13:20:48,991 INFO L451 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-07-25 13:20:48,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-07-25 13:20:48,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 13:20:48,994 INFO L87 Difference]: Start difference. First operand 279 states and 280 transitions. Second operand 139 states. [2018-07-25 13:20:49,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:49,218 INFO L93 Difference]: Finished difference Result 285 states and 287 transitions. [2018-07-25 13:20:49,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-07-25 13:20:49,218 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 278 [2018-07-25 13:20:49,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:49,219 INFO L225 Difference]: With dead ends: 285 [2018-07-25 13:20:49,219 INFO L226 Difference]: Without dead ends: 281 [2018-07-25 13:20:49,221 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 13:20:49,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-07-25 13:20:49,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-07-25 13:20:49,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-07-25 13:20:49,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 282 transitions. [2018-07-25 13:20:49,224 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 282 transitions. Word has length 278 [2018-07-25 13:20:49,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:49,225 INFO L472 AbstractCegarLoop]: Abstraction has 281 states and 282 transitions. [2018-07-25 13:20:49,225 INFO L473 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-07-25 13:20:49,225 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 282 transitions. [2018-07-25 13:20:49,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-07-25 13:20:49,225 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:49,226 INFO L354 BasicCegarLoop]: trace histogram [138, 137, 1, 1, 1, 1, 1] [2018-07-25 13:20:49,226 INFO L415 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:49,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1504292713, now seen corresponding path program 137 times [2018-07-25 13:20:49,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:49,935 INFO L134 CoverageAnalysis]: Checked inductivity of 18906 backedges. 0 proven. 18906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:49,936 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:49,936 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-07-25 13:20:49,936 INFO L451 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-07-25 13:20:49,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-07-25 13:20:49,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 13:20:49,941 INFO L87 Difference]: Start difference. First operand 281 states and 282 transitions. Second operand 140 states. [2018-07-25 13:20:50,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:50,135 INFO L93 Difference]: Finished difference Result 287 states and 289 transitions. [2018-07-25 13:20:50,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-07-25 13:20:50,136 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 280 [2018-07-25 13:20:50,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:50,136 INFO L225 Difference]: With dead ends: 287 [2018-07-25 13:20:50,136 INFO L226 Difference]: Without dead ends: 283 [2018-07-25 13:20:50,138 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 13:20:50,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-07-25 13:20:50,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-07-25 13:20:50,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-07-25 13:20:50,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 284 transitions. [2018-07-25 13:20:50,141 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 284 transitions. Word has length 280 [2018-07-25 13:20:50,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:50,142 INFO L472 AbstractCegarLoop]: Abstraction has 283 states and 284 transitions. [2018-07-25 13:20:50,142 INFO L473 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-07-25 13:20:50,142 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 284 transitions. [2018-07-25 13:20:50,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-07-25 13:20:50,142 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:50,143 INFO L354 BasicCegarLoop]: trace histogram [139, 138, 1, 1, 1, 1, 1] [2018-07-25 13:20:50,143 INFO L415 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:50,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1695123347, now seen corresponding path program 138 times [2018-07-25 13:20:50,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:50,884 INFO L134 CoverageAnalysis]: Checked inductivity of 19182 backedges. 0 proven. 19182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:50,885 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:50,885 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-07-25 13:20:50,885 INFO L451 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-07-25 13:20:50,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-07-25 13:20:50,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 13:20:50,889 INFO L87 Difference]: Start difference. First operand 283 states and 284 transitions. Second operand 141 states. [2018-07-25 13:20:51,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:51,094 INFO L93 Difference]: Finished difference Result 289 states and 291 transitions. [2018-07-25 13:20:51,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-07-25 13:20:51,094 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 282 [2018-07-25 13:20:51,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:51,095 INFO L225 Difference]: With dead ends: 289 [2018-07-25 13:20:51,095 INFO L226 Difference]: Without dead ends: 285 [2018-07-25 13:20:51,097 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 13:20:51,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-07-25 13:20:51,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-07-25 13:20:51,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-07-25 13:20:51,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 286 transitions. [2018-07-25 13:20:51,100 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 286 transitions. Word has length 282 [2018-07-25 13:20:51,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:51,100 INFO L472 AbstractCegarLoop]: Abstraction has 285 states and 286 transitions. [2018-07-25 13:20:51,100 INFO L473 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-07-25 13:20:51,101 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 286 transitions. [2018-07-25 13:20:51,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-07-25 13:20:51,101 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:51,101 INFO L354 BasicCegarLoop]: trace histogram [140, 139, 1, 1, 1, 1, 1] [2018-07-25 13:20:51,102 INFO L415 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:51,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1137373071, now seen corresponding path program 139 times [2018-07-25 13:20:51,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:51,836 INFO L134 CoverageAnalysis]: Checked inductivity of 19460 backedges. 0 proven. 19460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:51,836 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:51,836 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-07-25 13:20:51,837 INFO L451 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-07-25 13:20:51,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-07-25 13:20:51,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 13:20:51,841 INFO L87 Difference]: Start difference. First operand 285 states and 286 transitions. Second operand 142 states. [2018-07-25 13:20:52,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:52,088 INFO L93 Difference]: Finished difference Result 291 states and 293 transitions. [2018-07-25 13:20:52,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-07-25 13:20:52,088 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 284 [2018-07-25 13:20:52,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:52,089 INFO L225 Difference]: With dead ends: 291 [2018-07-25 13:20:52,089 INFO L226 Difference]: Without dead ends: 287 [2018-07-25 13:20:52,091 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 13:20:52,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-07-25 13:20:52,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-07-25 13:20:52,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-07-25 13:20:52,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 288 transitions. [2018-07-25 13:20:52,095 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 288 transitions. Word has length 284 [2018-07-25 13:20:52,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:52,095 INFO L472 AbstractCegarLoop]: Abstraction has 287 states and 288 transitions. [2018-07-25 13:20:52,096 INFO L473 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-07-25 13:20:52,096 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 288 transitions. [2018-07-25 13:20:52,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-07-25 13:20:52,097 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:52,097 INFO L354 BasicCegarLoop]: trace histogram [141, 140, 1, 1, 1, 1, 1] [2018-07-25 13:20:52,097 INFO L415 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:52,098 INFO L82 PathProgramCache]: Analyzing trace with hash 2010269835, now seen corresponding path program 140 times [2018-07-25 13:20:52,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:52,953 INFO L134 CoverageAnalysis]: Checked inductivity of 19740 backedges. 0 proven. 19740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:52,953 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:52,953 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-07-25 13:20:52,953 INFO L451 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-07-25 13:20:52,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-07-25 13:20:52,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 13:20:52,957 INFO L87 Difference]: Start difference. First operand 287 states and 288 transitions. Second operand 143 states. [2018-07-25 13:20:53,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:53,340 INFO L93 Difference]: Finished difference Result 293 states and 295 transitions. [2018-07-25 13:20:53,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-07-25 13:20:53,340 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 286 [2018-07-25 13:20:53,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:53,341 INFO L225 Difference]: With dead ends: 293 [2018-07-25 13:20:53,342 INFO L226 Difference]: Without dead ends: 289 [2018-07-25 13:20:53,343 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 13:20:53,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-07-25 13:20:53,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2018-07-25 13:20:53,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-07-25 13:20:53,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 290 transitions. [2018-07-25 13:20:53,347 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 290 transitions. Word has length 286 [2018-07-25 13:20:53,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:53,347 INFO L472 AbstractCegarLoop]: Abstraction has 289 states and 290 transitions. [2018-07-25 13:20:53,347 INFO L473 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-07-25 13:20:53,347 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 290 transitions. [2018-07-25 13:20:53,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-07-25 13:20:53,348 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:53,348 INFO L354 BasicCegarLoop]: trace histogram [142, 141, 1, 1, 1, 1, 1] [2018-07-25 13:20:53,348 INFO L415 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:53,349 INFO L82 PathProgramCache]: Analyzing trace with hash -949529977, now seen corresponding path program 141 times [2018-07-25 13:20:53,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:54,200 INFO L134 CoverageAnalysis]: Checked inductivity of 20022 backedges. 0 proven. 20022 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:54,201 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:54,201 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-07-25 13:20:54,201 INFO L451 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-07-25 13:20:54,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-07-25 13:20:54,204 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 13:20:54,205 INFO L87 Difference]: Start difference. First operand 289 states and 290 transitions. Second operand 144 states. [2018-07-25 13:20:54,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:54,750 INFO L93 Difference]: Finished difference Result 295 states and 297 transitions. [2018-07-25 13:20:54,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-07-25 13:20:54,750 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 288 [2018-07-25 13:20:54,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:54,751 INFO L225 Difference]: With dead ends: 295 [2018-07-25 13:20:54,751 INFO L226 Difference]: Without dead ends: 291 [2018-07-25 13:20:54,754 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 13:20:54,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-07-25 13:20:54,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2018-07-25 13:20:54,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-07-25 13:20:54,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 292 transitions. [2018-07-25 13:20:54,757 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 292 transitions. Word has length 288 [2018-07-25 13:20:54,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:54,757 INFO L472 AbstractCegarLoop]: Abstraction has 291 states and 292 transitions. [2018-07-25 13:20:54,757 INFO L473 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-07-25 13:20:54,758 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 292 transitions. [2018-07-25 13:20:54,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-07-25 13:20:54,758 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:54,758 INFO L354 BasicCegarLoop]: trace histogram [143, 142, 1, 1, 1, 1, 1] [2018-07-25 13:20:54,759 INFO L415 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:54,759 INFO L82 PathProgramCache]: Analyzing trace with hash -2048799357, now seen corresponding path program 142 times [2018-07-25 13:20:54,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:55,525 INFO L134 CoverageAnalysis]: Checked inductivity of 20306 backedges. 0 proven. 20306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:55,526 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:55,526 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-07-25 13:20:55,526 INFO L451 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-07-25 13:20:55,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-07-25 13:20:55,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 13:20:55,530 INFO L87 Difference]: Start difference. First operand 291 states and 292 transitions. Second operand 145 states. [2018-07-25 13:20:56,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:56,190 INFO L93 Difference]: Finished difference Result 297 states and 299 transitions. [2018-07-25 13:20:56,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-07-25 13:20:56,190 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 290 [2018-07-25 13:20:56,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:56,190 INFO L225 Difference]: With dead ends: 297 [2018-07-25 13:20:56,190 INFO L226 Difference]: Without dead ends: 293 [2018-07-25 13:20:56,193 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 13:20:56,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-07-25 13:20:56,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-07-25 13:20:56,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-07-25 13:20:56,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 294 transitions. [2018-07-25 13:20:56,196 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 294 transitions. Word has length 290 [2018-07-25 13:20:56,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:56,196 INFO L472 AbstractCegarLoop]: Abstraction has 293 states and 294 transitions. [2018-07-25 13:20:56,196 INFO L473 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-07-25 13:20:56,197 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 294 transitions. [2018-07-25 13:20:56,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-07-25 13:20:56,198 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:56,198 INFO L354 BasicCegarLoop]: trace histogram [144, 143, 1, 1, 1, 1, 1] [2018-07-25 13:20:56,198 INFO L415 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:56,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1884718721, now seen corresponding path program 143 times [2018-07-25 13:20:56,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:56,991 INFO L134 CoverageAnalysis]: Checked inductivity of 20592 backedges. 0 proven. 20592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:56,991 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:56,991 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-07-25 13:20:56,991 INFO L451 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-07-25 13:20:56,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-07-25 13:20:56,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 13:20:56,995 INFO L87 Difference]: Start difference. First operand 293 states and 294 transitions. Second operand 146 states. [2018-07-25 13:20:57,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:57,570 INFO L93 Difference]: Finished difference Result 299 states and 301 transitions. [2018-07-25 13:20:57,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-07-25 13:20:57,570 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 292 [2018-07-25 13:20:57,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:57,571 INFO L225 Difference]: With dead ends: 299 [2018-07-25 13:20:57,571 INFO L226 Difference]: Without dead ends: 295 [2018-07-25 13:20:57,573 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 13:20:57,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-07-25 13:20:57,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-07-25 13:20:57,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-07-25 13:20:57,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2018-07-25 13:20:57,576 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 292 [2018-07-25 13:20:57,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:57,577 INFO L472 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2018-07-25 13:20:57,577 INFO L473 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-07-25 13:20:57,577 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2018-07-25 13:20:57,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-07-25 13:20:57,578 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:57,578 INFO L354 BasicCegarLoop]: trace histogram [145, 144, 1, 1, 1, 1, 1] [2018-07-25 13:20:57,579 INFO L415 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:57,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1177949819, now seen corresponding path program 144 times [2018-07-25 13:20:57,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:58,420 INFO L134 CoverageAnalysis]: Checked inductivity of 20880 backedges. 0 proven. 20880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:58,421 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:58,421 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-07-25 13:20:58,422 INFO L451 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-07-25 13:20:58,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-07-25 13:20:58,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 13:20:58,425 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 147 states. [2018-07-25 13:20:58,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:20:58,967 INFO L93 Difference]: Finished difference Result 301 states and 303 transitions. [2018-07-25 13:20:58,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-07-25 13:20:58,967 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 294 [2018-07-25 13:20:58,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:20:58,968 INFO L225 Difference]: With dead ends: 301 [2018-07-25 13:20:58,968 INFO L226 Difference]: Without dead ends: 297 [2018-07-25 13:20:58,970 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 13:20:58,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-07-25 13:20:58,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2018-07-25 13:20:58,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-07-25 13:20:58,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 298 transitions. [2018-07-25 13:20:58,973 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 298 transitions. Word has length 294 [2018-07-25 13:20:58,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:20:58,973 INFO L472 AbstractCegarLoop]: Abstraction has 297 states and 298 transitions. [2018-07-25 13:20:58,974 INFO L473 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-07-25 13:20:58,974 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 298 transitions. [2018-07-25 13:20:58,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-07-25 13:20:58,974 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:20:58,975 INFO L354 BasicCegarLoop]: trace histogram [146, 145, 1, 1, 1, 1, 1] [2018-07-25 13:20:58,975 INFO L415 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:20:58,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1945148297, now seen corresponding path program 145 times [2018-07-25 13:20:58,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:20:59,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:20:59,768 INFO L134 CoverageAnalysis]: Checked inductivity of 21170 backedges. 0 proven. 21170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:20:59,768 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:20:59,768 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-07-25 13:20:59,769 INFO L451 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-07-25 13:20:59,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-07-25 13:20:59,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 13:20:59,773 INFO L87 Difference]: Start difference. First operand 297 states and 298 transitions. Second operand 148 states. [2018-07-25 13:21:00,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:00,115 INFO L93 Difference]: Finished difference Result 303 states and 305 transitions. [2018-07-25 13:21:00,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-07-25 13:21:00,115 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 296 [2018-07-25 13:21:00,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:00,116 INFO L225 Difference]: With dead ends: 303 [2018-07-25 13:21:00,116 INFO L226 Difference]: Without dead ends: 299 [2018-07-25 13:21:00,118 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 13:21:00,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-07-25 13:21:00,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2018-07-25 13:21:00,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-07-25 13:21:00,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 300 transitions. [2018-07-25 13:21:00,121 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 300 transitions. Word has length 296 [2018-07-25 13:21:00,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:00,121 INFO L472 AbstractCegarLoop]: Abstraction has 299 states and 300 transitions. [2018-07-25 13:21:00,121 INFO L473 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-07-25 13:21:00,121 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 300 transitions. [2018-07-25 13:21:00,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-07-25 13:21:00,122 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:00,122 INFO L354 BasicCegarLoop]: trace histogram [147, 146, 1, 1, 1, 1, 1] [2018-07-25 13:21:00,123 INFO L415 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:00,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1060297869, now seen corresponding path program 146 times [2018-07-25 13:21:00,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 21462 backedges. 0 proven. 21462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:00,930 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:00,930 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-07-25 13:21:00,930 INFO L451 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-07-25 13:21:00,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-07-25 13:21:00,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 13:21:00,934 INFO L87 Difference]: Start difference. First operand 299 states and 300 transitions. Second operand 149 states. [2018-07-25 13:21:01,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:01,646 INFO L93 Difference]: Finished difference Result 305 states and 307 transitions. [2018-07-25 13:21:01,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-07-25 13:21:01,646 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 298 [2018-07-25 13:21:01,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:01,647 INFO L225 Difference]: With dead ends: 305 [2018-07-25 13:21:01,647 INFO L226 Difference]: Without dead ends: 301 [2018-07-25 13:21:01,650 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 13:21:01,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-07-25 13:21:01,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-07-25 13:21:01,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-07-25 13:21:01,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 302 transitions. [2018-07-25 13:21:01,655 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 302 transitions. Word has length 298 [2018-07-25 13:21:01,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:01,656 INFO L472 AbstractCegarLoop]: Abstraction has 301 states and 302 transitions. [2018-07-25 13:21:01,656 INFO L473 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-07-25 13:21:01,656 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 302 transitions. [2018-07-25 13:21:01,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-07-25 13:21:01,657 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:01,658 INFO L354 BasicCegarLoop]: trace histogram [148, 147, 1, 1, 1, 1, 1] [2018-07-25 13:21:01,658 INFO L415 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:01,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1122561169, now seen corresponding path program 147 times [2018-07-25 13:21:01,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:02,714 INFO L134 CoverageAnalysis]: Checked inductivity of 21756 backedges. 0 proven. 21756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:02,715 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:02,715 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-07-25 13:21:02,715 INFO L451 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-07-25 13:21:02,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-07-25 13:21:02,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 13:21:02,717 INFO L87 Difference]: Start difference. First operand 301 states and 302 transitions. Second operand 150 states. [2018-07-25 13:21:03,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:03,325 INFO L93 Difference]: Finished difference Result 307 states and 309 transitions. [2018-07-25 13:21:03,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-07-25 13:21:03,325 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 300 [2018-07-25 13:21:03,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:03,326 INFO L225 Difference]: With dead ends: 307 [2018-07-25 13:21:03,326 INFO L226 Difference]: Without dead ends: 303 [2018-07-25 13:21:03,327 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 13:21:03,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-07-25 13:21:03,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-07-25 13:21:03,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-07-25 13:21:03,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 304 transitions. [2018-07-25 13:21:03,330 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 304 transitions. Word has length 300 [2018-07-25 13:21:03,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:03,330 INFO L472 AbstractCegarLoop]: Abstraction has 303 states and 304 transitions. [2018-07-25 13:21:03,330 INFO L473 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-07-25 13:21:03,331 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 304 transitions. [2018-07-25 13:21:03,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-07-25 13:21:03,331 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:03,331 INFO L354 BasicCegarLoop]: trace histogram [149, 148, 1, 1, 1, 1, 1] [2018-07-25 13:21:03,332 INFO L415 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:03,332 INFO L82 PathProgramCache]: Analyzing trace with hash -828050325, now seen corresponding path program 148 times [2018-07-25 13:21:03,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:04,126 INFO L134 CoverageAnalysis]: Checked inductivity of 22052 backedges. 0 proven. 22052 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:04,126 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:04,126 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-07-25 13:21:04,127 INFO L451 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-07-25 13:21:04,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-07-25 13:21:04,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 13:21:04,130 INFO L87 Difference]: Start difference. First operand 303 states and 304 transitions. Second operand 151 states. [2018-07-25 13:21:04,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:04,347 INFO L93 Difference]: Finished difference Result 309 states and 311 transitions. [2018-07-25 13:21:04,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-07-25 13:21:04,348 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 302 [2018-07-25 13:21:04,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:04,348 INFO L225 Difference]: With dead ends: 309 [2018-07-25 13:21:04,348 INFO L226 Difference]: Without dead ends: 305 [2018-07-25 13:21:04,351 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 13:21:04,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-07-25 13:21:04,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2018-07-25 13:21:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-07-25 13:21:04,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 306 transitions. [2018-07-25 13:21:04,354 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 306 transitions. Word has length 302 [2018-07-25 13:21:04,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:04,354 INFO L472 AbstractCegarLoop]: Abstraction has 305 states and 306 transitions. [2018-07-25 13:21:04,354 INFO L473 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-07-25 13:21:04,354 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 306 transitions. [2018-07-25 13:21:04,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-07-25 13:21:04,355 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:04,355 INFO L354 BasicCegarLoop]: trace histogram [150, 149, 1, 1, 1, 1, 1] [2018-07-25 13:21:04,355 INFO L415 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:04,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1270970777, now seen corresponding path program 149 times [2018-07-25 13:21:04,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:05,201 INFO L134 CoverageAnalysis]: Checked inductivity of 22350 backedges. 0 proven. 22350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:05,201 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:05,201 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-07-25 13:21:05,201 INFO L451 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-07-25 13:21:05,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-07-25 13:21:05,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 13:21:05,205 INFO L87 Difference]: Start difference. First operand 305 states and 306 transitions. Second operand 152 states. [2018-07-25 13:21:05,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:05,997 INFO L93 Difference]: Finished difference Result 311 states and 313 transitions. [2018-07-25 13:21:05,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-07-25 13:21:05,997 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 304 [2018-07-25 13:21:05,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:05,998 INFO L225 Difference]: With dead ends: 311 [2018-07-25 13:21:05,998 INFO L226 Difference]: Without dead ends: 307 [2018-07-25 13:21:06,000 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 13:21:06,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-07-25 13:21:06,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-07-25 13:21:06,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-07-25 13:21:06,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 308 transitions. [2018-07-25 13:21:06,004 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 308 transitions. Word has length 304 [2018-07-25 13:21:06,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:06,004 INFO L472 AbstractCegarLoop]: Abstraction has 307 states and 308 transitions. [2018-07-25 13:21:06,004 INFO L473 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-07-25 13:21:06,004 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 308 transitions. [2018-07-25 13:21:06,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-07-25 13:21:06,005 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:06,005 INFO L354 BasicCegarLoop]: trace histogram [151, 150, 1, 1, 1, 1, 1] [2018-07-25 13:21:06,006 INFO L415 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:06,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1715762845, now seen corresponding path program 150 times [2018-07-25 13:21:06,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:06,872 INFO L134 CoverageAnalysis]: Checked inductivity of 22650 backedges. 0 proven. 22650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:06,873 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:06,873 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-07-25 13:21:06,873 INFO L451 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-07-25 13:21:06,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-07-25 13:21:06,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 13:21:06,875 INFO L87 Difference]: Start difference. First operand 307 states and 308 transitions. Second operand 153 states. [2018-07-25 13:21:07,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:07,417 INFO L93 Difference]: Finished difference Result 313 states and 315 transitions. [2018-07-25 13:21:07,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-07-25 13:21:07,417 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 306 [2018-07-25 13:21:07,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:07,418 INFO L225 Difference]: With dead ends: 313 [2018-07-25 13:21:07,418 INFO L226 Difference]: Without dead ends: 309 [2018-07-25 13:21:07,419 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 13:21:07,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-07-25 13:21:07,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2018-07-25 13:21:07,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-07-25 13:21:07,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 310 transitions. [2018-07-25 13:21:07,422 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 310 transitions. Word has length 306 [2018-07-25 13:21:07,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:07,422 INFO L472 AbstractCegarLoop]: Abstraction has 309 states and 310 transitions. [2018-07-25 13:21:07,422 INFO L473 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-07-25 13:21:07,422 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 310 transitions. [2018-07-25 13:21:07,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-07-25 13:21:07,423 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:07,423 INFO L354 BasicCegarLoop]: trace histogram [152, 151, 1, 1, 1, 1, 1] [2018-07-25 13:21:07,424 INFO L415 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:07,424 INFO L82 PathProgramCache]: Analyzing trace with hash 335789407, now seen corresponding path program 151 times [2018-07-25 13:21:07,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:08,293 INFO L134 CoverageAnalysis]: Checked inductivity of 22952 backedges. 0 proven. 22952 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:08,293 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:08,293 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-07-25 13:21:08,294 INFO L451 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-07-25 13:21:08,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-07-25 13:21:08,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 13:21:08,297 INFO L87 Difference]: Start difference. First operand 309 states and 310 transitions. Second operand 154 states. [2018-07-25 13:21:08,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:08,992 INFO L93 Difference]: Finished difference Result 315 states and 317 transitions. [2018-07-25 13:21:08,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-07-25 13:21:08,992 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 308 [2018-07-25 13:21:08,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:08,993 INFO L225 Difference]: With dead ends: 315 [2018-07-25 13:21:08,993 INFO L226 Difference]: Without dead ends: 311 [2018-07-25 13:21:08,997 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 13:21:08,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-07-25 13:21:09,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2018-07-25 13:21:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-07-25 13:21:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 312 transitions. [2018-07-25 13:21:09,002 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 312 transitions. Word has length 308 [2018-07-25 13:21:09,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:09,002 INFO L472 AbstractCegarLoop]: Abstraction has 311 states and 312 transitions. [2018-07-25 13:21:09,002 INFO L473 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-07-25 13:21:09,002 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 312 transitions. [2018-07-25 13:21:09,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-07-25 13:21:09,003 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:09,004 INFO L354 BasicCegarLoop]: trace histogram [153, 152, 1, 1, 1, 1, 1] [2018-07-25 13:21:09,004 INFO L415 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:09,004 INFO L82 PathProgramCache]: Analyzing trace with hash 487514715, now seen corresponding path program 152 times [2018-07-25 13:21:09,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:09,983 INFO L134 CoverageAnalysis]: Checked inductivity of 23256 backedges. 0 proven. 23256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:09,984 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:09,984 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2018-07-25 13:21:09,984 INFO L451 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-07-25 13:21:09,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-07-25 13:21:09,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 13:21:09,988 INFO L87 Difference]: Start difference. First operand 311 states and 312 transitions. Second operand 155 states. [2018-07-25 13:21:10,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:10,697 INFO L93 Difference]: Finished difference Result 317 states and 319 transitions. [2018-07-25 13:21:10,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-07-25 13:21:10,697 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 310 [2018-07-25 13:21:10,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:10,698 INFO L225 Difference]: With dead ends: 317 [2018-07-25 13:21:10,698 INFO L226 Difference]: Without dead ends: 313 [2018-07-25 13:21:10,701 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 13:21:10,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-07-25 13:21:10,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2018-07-25 13:21:10,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-07-25 13:21:10,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 314 transitions. [2018-07-25 13:21:10,704 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 314 transitions. Word has length 310 [2018-07-25 13:21:10,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:10,704 INFO L472 AbstractCegarLoop]: Abstraction has 313 states and 314 transitions. [2018-07-25 13:21:10,704 INFO L473 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-07-25 13:21:10,704 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 314 transitions. [2018-07-25 13:21:10,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-07-25 13:21:10,705 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:10,705 INFO L354 BasicCegarLoop]: trace histogram [154, 153, 1, 1, 1, 1, 1] [2018-07-25 13:21:10,705 INFO L415 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:10,706 INFO L82 PathProgramCache]: Analyzing trace with hash 266647639, now seen corresponding path program 153 times [2018-07-25 13:21:10,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:11,682 INFO L134 CoverageAnalysis]: Checked inductivity of 23562 backedges. 0 proven. 23562 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:11,682 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:11,683 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-07-25 13:21:11,683 INFO L451 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-07-25 13:21:11,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-07-25 13:21:11,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-07-25 13:21:11,685 INFO L87 Difference]: Start difference. First operand 313 states and 314 transitions. Second operand 156 states. [2018-07-25 13:21:12,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:12,419 INFO L93 Difference]: Finished difference Result 319 states and 321 transitions. [2018-07-25 13:21:12,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-07-25 13:21:12,420 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 312 [2018-07-25 13:21:12,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:12,420 INFO L225 Difference]: With dead ends: 319 [2018-07-25 13:21:12,420 INFO L226 Difference]: Without dead ends: 315 [2018-07-25 13:21:12,421 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-07-25 13:21:12,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-07-25 13:21:12,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2018-07-25 13:21:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-07-25 13:21:12,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 316 transitions. [2018-07-25 13:21:12,425 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 316 transitions. Word has length 312 [2018-07-25 13:21:12,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:12,425 INFO L472 AbstractCegarLoop]: Abstraction has 315 states and 316 transitions. [2018-07-25 13:21:12,425 INFO L473 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-07-25 13:21:12,425 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 316 transitions. [2018-07-25 13:21:12,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-07-25 13:21:12,426 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:12,426 INFO L354 BasicCegarLoop]: trace histogram [155, 154, 1, 1, 1, 1, 1] [2018-07-25 13:21:12,426 INFO L415 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:12,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1533214893, now seen corresponding path program 154 times [2018-07-25 13:21:12,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:13,312 INFO L134 CoverageAnalysis]: Checked inductivity of 23870 backedges. 0 proven. 23870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:13,312 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:13,312 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2018-07-25 13:21:13,313 INFO L451 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-07-25 13:21:13,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-07-25 13:21:13,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 13:21:13,316 INFO L87 Difference]: Start difference. First operand 315 states and 316 transitions. Second operand 157 states. [2018-07-25 13:21:13,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:13,792 INFO L93 Difference]: Finished difference Result 321 states and 323 transitions. [2018-07-25 13:21:13,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-07-25 13:21:13,793 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 314 [2018-07-25 13:21:13,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:13,793 INFO L225 Difference]: With dead ends: 321 [2018-07-25 13:21:13,793 INFO L226 Difference]: Without dead ends: 317 [2018-07-25 13:21:13,796 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 13:21:13,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-07-25 13:21:13,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2018-07-25 13:21:13,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-07-25 13:21:13,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 318 transitions. [2018-07-25 13:21:13,799 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 318 transitions. Word has length 314 [2018-07-25 13:21:13,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:13,799 INFO L472 AbstractCegarLoop]: Abstraction has 317 states and 318 transitions. [2018-07-25 13:21:13,799 INFO L473 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-07-25 13:21:13,799 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 318 transitions. [2018-07-25 13:21:13,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-07-25 13:21:13,800 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:13,800 INFO L354 BasicCegarLoop]: trace histogram [156, 155, 1, 1, 1, 1, 1] [2018-07-25 13:21:13,800 INFO L415 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:13,801 INFO L82 PathProgramCache]: Analyzing trace with hash -329287857, now seen corresponding path program 155 times [2018-07-25 13:21:13,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:14,685 INFO L134 CoverageAnalysis]: Checked inductivity of 24180 backedges. 0 proven. 24180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:14,685 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:14,685 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2018-07-25 13:21:14,685 INFO L451 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-07-25 13:21:14,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-07-25 13:21:14,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-07-25 13:21:14,691 INFO L87 Difference]: Start difference. First operand 317 states and 318 transitions. Second operand 158 states. [2018-07-25 13:21:15,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:15,590 INFO L93 Difference]: Finished difference Result 323 states and 325 transitions. [2018-07-25 13:21:15,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-07-25 13:21:15,591 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 316 [2018-07-25 13:21:15,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:15,591 INFO L225 Difference]: With dead ends: 323 [2018-07-25 13:21:15,591 INFO L226 Difference]: Without dead ends: 319 [2018-07-25 13:21:15,593 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-07-25 13:21:15,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-07-25 13:21:15,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2018-07-25 13:21:15,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-07-25 13:21:15,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 320 transitions. [2018-07-25 13:21:15,598 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 320 transitions. Word has length 316 [2018-07-25 13:21:15,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:15,599 INFO L472 AbstractCegarLoop]: Abstraction has 319 states and 320 transitions. [2018-07-25 13:21:15,599 INFO L473 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-07-25 13:21:15,599 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 320 transitions. [2018-07-25 13:21:15,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-07-25 13:21:15,600 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:15,600 INFO L354 BasicCegarLoop]: trace histogram [157, 156, 1, 1, 1, 1, 1] [2018-07-25 13:21:15,600 INFO L415 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:15,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1298391115, now seen corresponding path program 156 times [2018-07-25 13:21:15,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:16,730 INFO L134 CoverageAnalysis]: Checked inductivity of 24492 backedges. 0 proven. 24492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:16,730 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:16,730 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2018-07-25 13:21:16,731 INFO L451 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-07-25 13:21:16,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-07-25 13:21:16,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 13:21:16,734 INFO L87 Difference]: Start difference. First operand 319 states and 320 transitions. Second operand 159 states. [2018-07-25 13:21:17,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:17,097 INFO L93 Difference]: Finished difference Result 325 states and 327 transitions. [2018-07-25 13:21:17,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-07-25 13:21:17,097 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 318 [2018-07-25 13:21:17,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:17,097 INFO L225 Difference]: With dead ends: 325 [2018-07-25 13:21:17,097 INFO L226 Difference]: Without dead ends: 321 [2018-07-25 13:21:17,099 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 13:21:17,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-07-25 13:21:17,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2018-07-25 13:21:17,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-07-25 13:21:17,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 322 transitions. [2018-07-25 13:21:17,102 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 322 transitions. Word has length 318 [2018-07-25 13:21:17,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:17,103 INFO L472 AbstractCegarLoop]: Abstraction has 321 states and 322 transitions. [2018-07-25 13:21:17,103 INFO L473 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-07-25 13:21:17,103 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 322 transitions. [2018-07-25 13:21:17,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-07-25 13:21:17,104 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:17,104 INFO L354 BasicCegarLoop]: trace histogram [158, 157, 1, 1, 1, 1, 1] [2018-07-25 13:21:17,104 INFO L415 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:17,104 INFO L82 PathProgramCache]: Analyzing trace with hash 2129787463, now seen corresponding path program 157 times [2018-07-25 13:21:17,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:18,031 INFO L134 CoverageAnalysis]: Checked inductivity of 24806 backedges. 0 proven. 24806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:18,032 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:18,032 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-07-25 13:21:18,032 INFO L451 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-07-25 13:21:18,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-07-25 13:21:18,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-07-25 13:21:18,036 INFO L87 Difference]: Start difference. First operand 321 states and 322 transitions. Second operand 160 states. [2018-07-25 13:21:18,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:18,831 INFO L93 Difference]: Finished difference Result 327 states and 329 transitions. [2018-07-25 13:21:18,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-07-25 13:21:18,831 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 320 [2018-07-25 13:21:18,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:18,832 INFO L225 Difference]: With dead ends: 327 [2018-07-25 13:21:18,832 INFO L226 Difference]: Without dead ends: 323 [2018-07-25 13:21:18,835 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-07-25 13:21:18,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-07-25 13:21:18,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2018-07-25 13:21:18,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-07-25 13:21:18,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 324 transitions. [2018-07-25 13:21:18,838 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 324 transitions. Word has length 320 [2018-07-25 13:21:18,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:18,838 INFO L472 AbstractCegarLoop]: Abstraction has 323 states and 324 transitions. [2018-07-25 13:21:18,838 INFO L473 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-07-25 13:21:18,838 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 324 transitions. [2018-07-25 13:21:18,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-07-25 13:21:18,839 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:18,839 INFO L354 BasicCegarLoop]: trace histogram [159, 158, 1, 1, 1, 1, 1] [2018-07-25 13:21:18,840 INFO L415 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:18,840 INFO L82 PathProgramCache]: Analyzing trace with hash -2057206461, now seen corresponding path program 158 times [2018-07-25 13:21:18,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:19,758 INFO L134 CoverageAnalysis]: Checked inductivity of 25122 backedges. 0 proven. 25122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:19,758 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:19,758 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2018-07-25 13:21:19,758 INFO L451 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-07-25 13:21:19,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-07-25 13:21:19,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 13:21:19,762 INFO L87 Difference]: Start difference. First operand 323 states and 324 transitions. Second operand 161 states. [2018-07-25 13:21:20,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:20,762 INFO L93 Difference]: Finished difference Result 329 states and 331 transitions. [2018-07-25 13:21:20,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-07-25 13:21:20,762 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 322 [2018-07-25 13:21:20,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:20,763 INFO L225 Difference]: With dead ends: 329 [2018-07-25 13:21:20,763 INFO L226 Difference]: Without dead ends: 325 [2018-07-25 13:21:20,765 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 13:21:20,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-07-25 13:21:20,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2018-07-25 13:21:20,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-07-25 13:21:20,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 326 transitions. [2018-07-25 13:21:20,769 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 326 transitions. Word has length 322 [2018-07-25 13:21:20,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:20,769 INFO L472 AbstractCegarLoop]: Abstraction has 325 states and 326 transitions. [2018-07-25 13:21:20,769 INFO L473 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-07-25 13:21:20,769 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 326 transitions. [2018-07-25 13:21:20,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-07-25 13:21:20,770 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:20,770 INFO L354 BasicCegarLoop]: trace histogram [160, 159, 1, 1, 1, 1, 1] [2018-07-25 13:21:20,770 INFO L415 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:20,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1374011073, now seen corresponding path program 159 times [2018-07-25 13:21:20,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:21,786 INFO L134 CoverageAnalysis]: Checked inductivity of 25440 backedges. 0 proven. 25440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:21,786 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:21,787 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2018-07-25 13:21:21,787 INFO L451 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-07-25 13:21:21,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-07-25 13:21:21,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-07-25 13:21:21,791 INFO L87 Difference]: Start difference. First operand 325 states and 326 transitions. Second operand 162 states. [2018-07-25 13:21:22,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:22,428 INFO L93 Difference]: Finished difference Result 331 states and 333 transitions. [2018-07-25 13:21:22,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-07-25 13:21:22,428 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 324 [2018-07-25 13:21:22,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:22,429 INFO L225 Difference]: With dead ends: 331 [2018-07-25 13:21:22,429 INFO L226 Difference]: Without dead ends: 327 [2018-07-25 13:21:22,431 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-07-25 13:21:22,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-07-25 13:21:22,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2018-07-25 13:21:22,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-07-25 13:21:22,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 328 transitions. [2018-07-25 13:21:22,435 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 328 transitions. Word has length 324 [2018-07-25 13:21:22,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:22,435 INFO L472 AbstractCegarLoop]: Abstraction has 327 states and 328 transitions. [2018-07-25 13:21:22,435 INFO L473 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-07-25 13:21:22,435 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 328 transitions. [2018-07-25 13:21:22,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-07-25 13:21:22,436 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:22,436 INFO L354 BasicCegarLoop]: trace histogram [161, 160, 1, 1, 1, 1, 1] [2018-07-25 13:21:22,436 INFO L415 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:22,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1953239493, now seen corresponding path program 160 times [2018-07-25 13:21:22,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:23,400 INFO L134 CoverageAnalysis]: Checked inductivity of 25760 backedges. 0 proven. 25760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:23,401 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:23,401 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2018-07-25 13:21:23,401 INFO L451 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-07-25 13:21:23,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-07-25 13:21:23,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 13:21:23,405 INFO L87 Difference]: Start difference. First operand 327 states and 328 transitions. Second operand 163 states. [2018-07-25 13:21:23,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:23,696 INFO L93 Difference]: Finished difference Result 333 states and 335 transitions. [2018-07-25 13:21:23,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-07-25 13:21:23,696 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 326 [2018-07-25 13:21:23,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:23,696 INFO L225 Difference]: With dead ends: 333 [2018-07-25 13:21:23,696 INFO L226 Difference]: Without dead ends: 329 [2018-07-25 13:21:23,699 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 13:21:23,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-07-25 13:21:23,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2018-07-25 13:21:23,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-07-25 13:21:23,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 330 transitions. [2018-07-25 13:21:23,702 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 330 transitions. Word has length 326 [2018-07-25 13:21:23,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:23,702 INFO L472 AbstractCegarLoop]: Abstraction has 329 states and 330 transitions. [2018-07-25 13:21:23,702 INFO L473 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-07-25 13:21:23,703 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 330 transitions. [2018-07-25 13:21:23,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-07-25 13:21:23,704 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:23,704 INFO L354 BasicCegarLoop]: trace histogram [162, 161, 1, 1, 1, 1, 1] [2018-07-25 13:21:23,704 INFO L415 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:23,704 INFO L82 PathProgramCache]: Analyzing trace with hash -246002633, now seen corresponding path program 161 times [2018-07-25 13:21:23,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:24,737 INFO L134 CoverageAnalysis]: Checked inductivity of 26082 backedges. 0 proven. 26082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:24,737 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:24,737 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-07-25 13:21:24,738 INFO L451 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-07-25 13:21:24,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-07-25 13:21:24,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-07-25 13:21:24,742 INFO L87 Difference]: Start difference. First operand 329 states and 330 transitions. Second operand 164 states. [2018-07-25 13:21:25,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:25,474 INFO L93 Difference]: Finished difference Result 335 states and 337 transitions. [2018-07-25 13:21:25,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-07-25 13:21:25,474 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 328 [2018-07-25 13:21:25,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:25,475 INFO L225 Difference]: With dead ends: 335 [2018-07-25 13:21:25,475 INFO L226 Difference]: Without dead ends: 331 [2018-07-25 13:21:25,476 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-07-25 13:21:25,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-07-25 13:21:25,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2018-07-25 13:21:25,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-07-25 13:21:25,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 332 transitions. [2018-07-25 13:21:25,479 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 332 transitions. Word has length 328 [2018-07-25 13:21:25,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:25,480 INFO L472 AbstractCegarLoop]: Abstraction has 331 states and 332 transitions. [2018-07-25 13:21:25,480 INFO L473 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-07-25 13:21:25,480 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 332 transitions. [2018-07-25 13:21:25,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-07-25 13:21:25,481 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:25,481 INFO L354 BasicCegarLoop]: trace histogram [163, 162, 1, 1, 1, 1, 1] [2018-07-25 13:21:25,481 INFO L415 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:25,481 INFO L82 PathProgramCache]: Analyzing trace with hash -268887245, now seen corresponding path program 162 times [2018-07-25 13:21:25,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:26,462 INFO L134 CoverageAnalysis]: Checked inductivity of 26406 backedges. 0 proven. 26406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:26,462 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:26,462 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2018-07-25 13:21:26,463 INFO L451 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-07-25 13:21:26,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-07-25 13:21:26,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 13:21:26,466 INFO L87 Difference]: Start difference. First operand 331 states and 332 transitions. Second operand 165 states. [2018-07-25 13:21:27,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:27,403 INFO L93 Difference]: Finished difference Result 337 states and 339 transitions. [2018-07-25 13:21:27,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-07-25 13:21:27,403 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 330 [2018-07-25 13:21:27,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:27,404 INFO L225 Difference]: With dead ends: 337 [2018-07-25 13:21:27,404 INFO L226 Difference]: Without dead ends: 333 [2018-07-25 13:21:27,406 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 13:21:27,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-07-25 13:21:27,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2018-07-25 13:21:27,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-07-25 13:21:27,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 334 transitions. [2018-07-25 13:21:27,410 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 334 transitions. Word has length 330 [2018-07-25 13:21:27,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:27,410 INFO L472 AbstractCegarLoop]: Abstraction has 333 states and 334 transitions. [2018-07-25 13:21:27,410 INFO L473 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-07-25 13:21:27,410 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 334 transitions. [2018-07-25 13:21:27,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-07-25 13:21:27,411 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:27,411 INFO L354 BasicCegarLoop]: trace histogram [164, 163, 1, 1, 1, 1, 1] [2018-07-25 13:21:27,411 INFO L415 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:27,411 INFO L82 PathProgramCache]: Analyzing trace with hash -786162897, now seen corresponding path program 163 times [2018-07-25 13:21:27,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:28,440 INFO L134 CoverageAnalysis]: Checked inductivity of 26732 backedges. 0 proven. 26732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:28,440 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:28,440 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2018-07-25 13:21:28,441 INFO L451 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-07-25 13:21:28,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-07-25 13:21:28,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-07-25 13:21:28,445 INFO L87 Difference]: Start difference. First operand 333 states and 334 transitions. Second operand 166 states. [2018-07-25 13:21:29,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:29,509 INFO L93 Difference]: Finished difference Result 339 states and 341 transitions. [2018-07-25 13:21:29,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-07-25 13:21:29,510 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 332 [2018-07-25 13:21:29,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:29,510 INFO L225 Difference]: With dead ends: 339 [2018-07-25 13:21:29,510 INFO L226 Difference]: Without dead ends: 335 [2018-07-25 13:21:29,513 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-07-25 13:21:29,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-07-25 13:21:29,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2018-07-25 13:21:29,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-07-25 13:21:29,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 336 transitions. [2018-07-25 13:21:29,518 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 336 transitions. Word has length 332 [2018-07-25 13:21:29,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:29,518 INFO L472 AbstractCegarLoop]: Abstraction has 335 states and 336 transitions. [2018-07-25 13:21:29,518 INFO L473 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-07-25 13:21:29,518 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 336 transitions. [2018-07-25 13:21:29,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-07-25 13:21:29,520 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:29,520 INFO L354 BasicCegarLoop]: trace histogram [165, 164, 1, 1, 1, 1, 1] [2018-07-25 13:21:29,520 INFO L415 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:29,520 INFO L82 PathProgramCache]: Analyzing trace with hash 328141867, now seen corresponding path program 164 times [2018-07-25 13:21:29,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:30,874 INFO L134 CoverageAnalysis]: Checked inductivity of 27060 backedges. 0 proven. 27060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:30,874 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:30,874 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166] total 166 [2018-07-25 13:21:30,875 INFO L451 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-07-25 13:21:30,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-07-25 13:21:30,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 13:21:30,878 INFO L87 Difference]: Start difference. First operand 335 states and 336 transitions. Second operand 167 states. [2018-07-25 13:21:32,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:32,006 INFO L93 Difference]: Finished difference Result 341 states and 343 transitions. [2018-07-25 13:21:32,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-07-25 13:21:32,006 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 334 [2018-07-25 13:21:32,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:32,007 INFO L225 Difference]: With dead ends: 341 [2018-07-25 13:21:32,007 INFO L226 Difference]: Without dead ends: 337 [2018-07-25 13:21:32,008 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 13:21:32,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-07-25 13:21:32,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2018-07-25 13:21:32,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-07-25 13:21:32,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 338 transitions. [2018-07-25 13:21:32,012 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 338 transitions. Word has length 334 [2018-07-25 13:21:32,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:32,012 INFO L472 AbstractCegarLoop]: Abstraction has 337 states and 338 transitions. [2018-07-25 13:21:32,012 INFO L473 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-07-25 13:21:32,012 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 338 transitions. [2018-07-25 13:21:32,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-07-25 13:21:32,013 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:32,013 INFO L354 BasicCegarLoop]: trace histogram [166, 165, 1, 1, 1, 1, 1] [2018-07-25 13:21:32,013 INFO L415 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:32,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1728163367, now seen corresponding path program 165 times [2018-07-25 13:21:32,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:33,053 INFO L134 CoverageAnalysis]: Checked inductivity of 27390 backedges. 0 proven. 27390 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:33,053 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:33,053 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2018-07-25 13:21:33,054 INFO L451 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-07-25 13:21:33,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-07-25 13:21:33,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-07-25 13:21:33,058 INFO L87 Difference]: Start difference. First operand 337 states and 338 transitions. Second operand 168 states. [2018-07-25 13:21:34,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:34,231 INFO L93 Difference]: Finished difference Result 343 states and 345 transitions. [2018-07-25 13:21:34,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-07-25 13:21:34,231 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 336 [2018-07-25 13:21:34,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:34,232 INFO L225 Difference]: With dead ends: 343 [2018-07-25 13:21:34,232 INFO L226 Difference]: Without dead ends: 339 [2018-07-25 13:21:34,234 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-07-25 13:21:34,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-07-25 13:21:34,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2018-07-25 13:21:34,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-07-25 13:21:34,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 340 transitions. [2018-07-25 13:21:34,237 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 340 transitions. Word has length 336 [2018-07-25 13:21:34,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:34,238 INFO L472 AbstractCegarLoop]: Abstraction has 339 states and 340 transitions. [2018-07-25 13:21:34,238 INFO L473 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-07-25 13:21:34,238 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 340 transitions. [2018-07-25 13:21:34,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-07-25 13:21:34,239 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:34,239 INFO L354 BasicCegarLoop]: trace histogram [167, 166, 1, 1, 1, 1, 1] [2018-07-25 13:21:34,239 INFO L415 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:34,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1470906077, now seen corresponding path program 166 times [2018-07-25 13:21:34,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:35,363 INFO L134 CoverageAnalysis]: Checked inductivity of 27722 backedges. 0 proven. 27722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:35,364 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:35,364 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168] total 168 [2018-07-25 13:21:35,364 INFO L451 AbstractCegarLoop]: Interpolant automaton has 169 states [2018-07-25 13:21:35,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2018-07-25 13:21:35,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 13:21:35,366 INFO L87 Difference]: Start difference. First operand 339 states and 340 transitions. Second operand 169 states. [2018-07-25 13:21:36,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:36,474 INFO L93 Difference]: Finished difference Result 345 states and 347 transitions. [2018-07-25 13:21:36,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-07-25 13:21:36,475 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 338 [2018-07-25 13:21:36,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:36,475 INFO L225 Difference]: With dead ends: 345 [2018-07-25 13:21:36,475 INFO L226 Difference]: Without dead ends: 341 [2018-07-25 13:21:36,477 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 13:21:36,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-07-25 13:21:36,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2018-07-25 13:21:36,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-07-25 13:21:36,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 342 transitions. [2018-07-25 13:21:36,480 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 342 transitions. Word has length 338 [2018-07-25 13:21:36,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:36,480 INFO L472 AbstractCegarLoop]: Abstraction has 341 states and 342 transitions. [2018-07-25 13:21:36,480 INFO L473 AbstractCegarLoop]: Interpolant automaton has 169 states. [2018-07-25 13:21:36,481 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 342 transitions. [2018-07-25 13:21:36,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-07-25 13:21:36,482 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:36,482 INFO L354 BasicCegarLoop]: trace histogram [168, 167, 1, 1, 1, 1, 1] [2018-07-25 13:21:36,482 INFO L415 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:36,482 INFO L82 PathProgramCache]: Analyzing trace with hash -580057825, now seen corresponding path program 167 times [2018-07-25 13:21:36,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:37,551 INFO L134 CoverageAnalysis]: Checked inductivity of 28056 backedges. 0 proven. 28056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:37,551 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:37,551 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2018-07-25 13:21:37,551 INFO L451 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-07-25 13:21:37,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-07-25 13:21:37,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-07-25 13:21:37,556 INFO L87 Difference]: Start difference. First operand 341 states and 342 transitions. Second operand 170 states. [2018-07-25 13:21:38,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:38,761 INFO L93 Difference]: Finished difference Result 347 states and 349 transitions. [2018-07-25 13:21:38,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-07-25 13:21:38,761 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 340 [2018-07-25 13:21:38,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:38,762 INFO L225 Difference]: With dead ends: 347 [2018-07-25 13:21:38,762 INFO L226 Difference]: Without dead ends: 343 [2018-07-25 13:21:38,764 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-07-25 13:21:38,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-07-25 13:21:38,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-07-25 13:21:38,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-07-25 13:21:38,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 344 transitions. [2018-07-25 13:21:38,768 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 344 transitions. Word has length 340 [2018-07-25 13:21:38,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:38,768 INFO L472 AbstractCegarLoop]: Abstraction has 343 states and 344 transitions. [2018-07-25 13:21:38,768 INFO L473 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-07-25 13:21:38,768 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 344 transitions. [2018-07-25 13:21:38,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-07-25 13:21:38,769 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:38,769 INFO L354 BasicCegarLoop]: trace histogram [169, 168, 1, 1, 1, 1, 1] [2018-07-25 13:21:38,769 INFO L415 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:38,769 INFO L82 PathProgramCache]: Analyzing trace with hash 826620443, now seen corresponding path program 168 times [2018-07-25 13:21:38,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:39,867 INFO L134 CoverageAnalysis]: Checked inductivity of 28392 backedges. 0 proven. 28392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:39,867 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:39,867 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170] total 170 [2018-07-25 13:21:39,867 INFO L451 AbstractCegarLoop]: Interpolant automaton has 171 states [2018-07-25 13:21:39,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2018-07-25 13:21:39,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 13:21:39,873 INFO L87 Difference]: Start difference. First operand 343 states and 344 transitions. Second operand 171 states. [2018-07-25 13:21:41,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:41,102 INFO L93 Difference]: Finished difference Result 349 states and 351 transitions. [2018-07-25 13:21:41,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-07-25 13:21:41,103 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 342 [2018-07-25 13:21:41,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:41,103 INFO L225 Difference]: With dead ends: 349 [2018-07-25 13:21:41,103 INFO L226 Difference]: Without dead ends: 345 [2018-07-25 13:21:41,106 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 13:21:41,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-07-25 13:21:41,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2018-07-25 13:21:41,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-07-25 13:21:41,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 346 transitions. [2018-07-25 13:21:41,110 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 346 transitions. Word has length 342 [2018-07-25 13:21:41,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:41,110 INFO L472 AbstractCegarLoop]: Abstraction has 345 states and 346 transitions. [2018-07-25 13:21:41,110 INFO L473 AbstractCegarLoop]: Interpolant automaton has 171 states. [2018-07-25 13:21:41,110 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 346 transitions. [2018-07-25 13:21:41,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-07-25 13:21:41,111 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:41,111 INFO L354 BasicCegarLoop]: trace histogram [170, 169, 1, 1, 1, 1, 1] [2018-07-25 13:21:41,111 INFO L415 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:41,111 INFO L82 PathProgramCache]: Analyzing trace with hash -270262249, now seen corresponding path program 169 times [2018-07-25 13:21:41,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:42,171 INFO L134 CoverageAnalysis]: Checked inductivity of 28730 backedges. 0 proven. 28730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:42,171 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:42,171 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2018-07-25 13:21:42,172 INFO L451 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-07-25 13:21:42,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-07-25 13:21:42,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-07-25 13:21:42,178 INFO L87 Difference]: Start difference. First operand 345 states and 346 transitions. Second operand 172 states. [2018-07-25 13:21:43,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:43,393 INFO L93 Difference]: Finished difference Result 351 states and 353 transitions. [2018-07-25 13:21:43,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-07-25 13:21:43,393 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 344 [2018-07-25 13:21:43,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:43,394 INFO L225 Difference]: With dead ends: 351 [2018-07-25 13:21:43,394 INFO L226 Difference]: Without dead ends: 347 [2018-07-25 13:21:43,397 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-07-25 13:21:43,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-07-25 13:21:43,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2018-07-25 13:21:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-07-25 13:21:43,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 348 transitions. [2018-07-25 13:21:43,400 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 348 transitions. Word has length 344 [2018-07-25 13:21:43,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:43,400 INFO L472 AbstractCegarLoop]: Abstraction has 347 states and 348 transitions. [2018-07-25 13:21:43,400 INFO L473 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-07-25 13:21:43,400 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 348 transitions. [2018-07-25 13:21:43,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-07-25 13:21:43,401 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:43,402 INFO L354 BasicCegarLoop]: trace histogram [171, 170, 1, 1, 1, 1, 1] [2018-07-25 13:21:43,402 INFO L415 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:43,402 INFO L82 PathProgramCache]: Analyzing trace with hash -2107541741, now seen corresponding path program 170 times [2018-07-25 13:21:43,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:44,575 INFO L134 CoverageAnalysis]: Checked inductivity of 29070 backedges. 0 proven. 29070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:44,576 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:44,576 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172] total 172 [2018-07-25 13:21:44,576 INFO L451 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-07-25 13:21:44,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-07-25 13:21:44,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 13:21:44,582 INFO L87 Difference]: Start difference. First operand 347 states and 348 transitions. Second operand 173 states. [2018-07-25 13:21:45,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:45,693 INFO L93 Difference]: Finished difference Result 353 states and 355 transitions. [2018-07-25 13:21:45,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-07-25 13:21:45,693 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 346 [2018-07-25 13:21:45,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:45,694 INFO L225 Difference]: With dead ends: 353 [2018-07-25 13:21:45,694 INFO L226 Difference]: Without dead ends: 349 [2018-07-25 13:21:45,696 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 13:21:45,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-07-25 13:21:45,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2018-07-25 13:21:45,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-07-25 13:21:45,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 350 transitions. [2018-07-25 13:21:45,700 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 350 transitions. Word has length 346 [2018-07-25 13:21:45,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:45,700 INFO L472 AbstractCegarLoop]: Abstraction has 349 states and 350 transitions. [2018-07-25 13:21:45,700 INFO L473 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-07-25 13:21:45,701 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 350 transitions. [2018-07-25 13:21:45,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-07-25 13:21:45,701 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:45,702 INFO L354 BasicCegarLoop]: trace histogram [172, 171, 1, 1, 1, 1, 1] [2018-07-25 13:21:45,702 INFO L415 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:45,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1793392399, now seen corresponding path program 171 times [2018-07-25 13:21:45,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:46,847 INFO L134 CoverageAnalysis]: Checked inductivity of 29412 backedges. 0 proven. 29412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:46,848 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:46,848 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2018-07-25 13:21:46,848 INFO L451 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-07-25 13:21:46,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-07-25 13:21:46,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-07-25 13:21:46,852 INFO L87 Difference]: Start difference. First operand 349 states and 350 transitions. Second operand 174 states. [2018-07-25 13:21:47,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:47,515 INFO L93 Difference]: Finished difference Result 355 states and 357 transitions. [2018-07-25 13:21:47,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-07-25 13:21:47,516 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 348 [2018-07-25 13:21:47,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:47,516 INFO L225 Difference]: With dead ends: 355 [2018-07-25 13:21:47,516 INFO L226 Difference]: Without dead ends: 351 [2018-07-25 13:21:47,519 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-07-25 13:21:47,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-07-25 13:21:47,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2018-07-25 13:21:47,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-07-25 13:21:47,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 352 transitions. [2018-07-25 13:21:47,524 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 352 transitions. Word has length 348 [2018-07-25 13:21:47,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:47,524 INFO L472 AbstractCegarLoop]: Abstraction has 351 states and 352 transitions. [2018-07-25 13:21:47,524 INFO L473 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-07-25 13:21:47,524 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 352 transitions. [2018-07-25 13:21:47,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-07-25 13:21:47,526 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:47,526 INFO L354 BasicCegarLoop]: trace histogram [173, 172, 1, 1, 1, 1, 1] [2018-07-25 13:21:47,526 INFO L415 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:47,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1084651531, now seen corresponding path program 172 times [2018-07-25 13:21:47,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:48,842 INFO L134 CoverageAnalysis]: Checked inductivity of 29756 backedges. 0 proven. 29756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:48,842 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:48,842 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [174] total 174 [2018-07-25 13:21:48,843 INFO L451 AbstractCegarLoop]: Interpolant automaton has 175 states [2018-07-25 13:21:48,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2018-07-25 13:21:48,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2018-07-25 13:21:48,848 INFO L87 Difference]: Start difference. First operand 351 states and 352 transitions. Second operand 175 states. [2018-07-25 13:21:49,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:49,223 INFO L93 Difference]: Finished difference Result 357 states and 359 transitions. [2018-07-25 13:21:49,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-07-25 13:21:49,223 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 350 [2018-07-25 13:21:49,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:49,224 INFO L225 Difference]: With dead ends: 357 [2018-07-25 13:21:49,224 INFO L226 Difference]: Without dead ends: 353 [2018-07-25 13:21:49,227 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2018-07-25 13:21:49,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-07-25 13:21:49,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2018-07-25 13:21:49,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-07-25 13:21:49,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 354 transitions. [2018-07-25 13:21:49,231 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 354 transitions. Word has length 350 [2018-07-25 13:21:49,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:49,231 INFO L472 AbstractCegarLoop]: Abstraction has 353 states and 354 transitions. [2018-07-25 13:21:49,231 INFO L473 AbstractCegarLoop]: Interpolant automaton has 175 states. [2018-07-25 13:21:49,232 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 354 transitions. [2018-07-25 13:21:49,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-07-25 13:21:49,233 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:49,233 INFO L354 BasicCegarLoop]: trace histogram [174, 173, 1, 1, 1, 1, 1] [2018-07-25 13:21:49,233 INFO L415 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:49,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1410489849, now seen corresponding path program 173 times [2018-07-25 13:21:49,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:50,456 INFO L134 CoverageAnalysis]: Checked inductivity of 30102 backedges. 0 proven. 30102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:50,456 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:50,457 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2018-07-25 13:21:50,457 INFO L451 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-07-25 13:21:50,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-07-25 13:21:50,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-07-25 13:21:50,459 INFO L87 Difference]: Start difference. First operand 353 states and 354 transitions. Second operand 176 states. [2018-07-25 13:21:51,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:51,424 INFO L93 Difference]: Finished difference Result 359 states and 361 transitions. [2018-07-25 13:21:51,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-07-25 13:21:51,424 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 352 [2018-07-25 13:21:51,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:51,425 INFO L225 Difference]: With dead ends: 359 [2018-07-25 13:21:51,425 INFO L226 Difference]: Without dead ends: 355 [2018-07-25 13:21:51,426 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-07-25 13:21:51,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-07-25 13:21:51,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2018-07-25 13:21:51,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-07-25 13:21:51,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 356 transitions. [2018-07-25 13:21:51,430 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 356 transitions. Word has length 352 [2018-07-25 13:21:51,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:51,430 INFO L472 AbstractCegarLoop]: Abstraction has 355 states and 356 transitions. [2018-07-25 13:21:51,430 INFO L473 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-07-25 13:21:51,430 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 356 transitions. [2018-07-25 13:21:51,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-07-25 13:21:51,431 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:51,431 INFO L354 BasicCegarLoop]: trace histogram [175, 174, 1, 1, 1, 1, 1] [2018-07-25 13:21:51,431 INFO L415 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:51,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1645362435, now seen corresponding path program 174 times [2018-07-25 13:21:51,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:52,622 INFO L134 CoverageAnalysis]: Checked inductivity of 30450 backedges. 0 proven. 30450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:52,623 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:52,623 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [176] total 176 [2018-07-25 13:21:52,623 INFO L451 AbstractCegarLoop]: Interpolant automaton has 177 states [2018-07-25 13:21:52,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2018-07-25 13:21:52,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2018-07-25 13:21:52,628 INFO L87 Difference]: Start difference. First operand 355 states and 356 transitions. Second operand 177 states. [2018-07-25 13:21:54,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:54,006 INFO L93 Difference]: Finished difference Result 361 states and 363 transitions. [2018-07-25 13:21:54,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-07-25 13:21:54,006 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 354 [2018-07-25 13:21:54,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:54,007 INFO L225 Difference]: With dead ends: 361 [2018-07-25 13:21:54,007 INFO L226 Difference]: Without dead ends: 357 [2018-07-25 13:21:54,010 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2018-07-25 13:21:54,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-07-25 13:21:54,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2018-07-25 13:21:54,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-07-25 13:21:54,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 358 transitions. [2018-07-25 13:21:54,013 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 358 transitions. Word has length 354 [2018-07-25 13:21:54,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:54,013 INFO L472 AbstractCegarLoop]: Abstraction has 357 states and 358 transitions. [2018-07-25 13:21:54,013 INFO L473 AbstractCegarLoop]: Interpolant automaton has 177 states. [2018-07-25 13:21:54,013 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 358 transitions. [2018-07-25 13:21:54,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-07-25 13:21:54,014 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:54,014 INFO L354 BasicCegarLoop]: trace histogram [176, 175, 1, 1, 1, 1, 1] [2018-07-25 13:21:54,014 INFO L415 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:54,015 INFO L82 PathProgramCache]: Analyzing trace with hash 561776895, now seen corresponding path program 175 times [2018-07-25 13:21:54,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 30800 backedges. 0 proven. 30800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:55,234 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:55,234 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [177] total 177 [2018-07-25 13:21:55,234 INFO L451 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-07-25 13:21:55,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-07-25 13:21:55,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-07-25 13:21:55,277 INFO L87 Difference]: Start difference. First operand 357 states and 358 transitions. Second operand 178 states. [2018-07-25 13:21:55,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:55,947 INFO L93 Difference]: Finished difference Result 363 states and 365 transitions. [2018-07-25 13:21:55,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-07-25 13:21:55,947 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 356 [2018-07-25 13:21:55,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:55,947 INFO L225 Difference]: With dead ends: 363 [2018-07-25 13:21:55,947 INFO L226 Difference]: Without dead ends: 359 [2018-07-25 13:21:55,949 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-07-25 13:21:55,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-07-25 13:21:55,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2018-07-25 13:21:55,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-07-25 13:21:55,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 360 transitions. [2018-07-25 13:21:55,952 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 360 transitions. Word has length 356 [2018-07-25 13:21:55,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:55,952 INFO L472 AbstractCegarLoop]: Abstraction has 359 states and 360 transitions. [2018-07-25 13:21:55,952 INFO L473 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-07-25 13:21:55,952 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 360 transitions. [2018-07-25 13:21:55,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-07-25 13:21:55,953 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:55,954 INFO L354 BasicCegarLoop]: trace histogram [177, 176, 1, 1, 1, 1, 1] [2018-07-25 13:21:55,954 INFO L415 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:55,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1381841413, now seen corresponding path program 176 times [2018-07-25 13:21:55,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:57,170 INFO L134 CoverageAnalysis]: Checked inductivity of 31152 backedges. 0 proven. 31152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:57,170 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:57,170 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [178] total 178 [2018-07-25 13:21:57,171 INFO L451 AbstractCegarLoop]: Interpolant automaton has 179 states [2018-07-25 13:21:57,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2018-07-25 13:21:57,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15931, Invalid=15931, Unknown=0, NotChecked=0, Total=31862 [2018-07-25 13:21:57,175 INFO L87 Difference]: Start difference. First operand 359 states and 360 transitions. Second operand 179 states. [2018-07-25 13:21:57,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:57,923 INFO L93 Difference]: Finished difference Result 365 states and 367 transitions. [2018-07-25 13:21:57,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-07-25 13:21:57,924 INFO L78 Accepts]: Start accepts. Automaton has 179 states. Word has length 358 [2018-07-25 13:21:57,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:57,924 INFO L225 Difference]: With dead ends: 365 [2018-07-25 13:21:57,924 INFO L226 Difference]: Without dead ends: 361 [2018-07-25 13:21:57,927 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15931, Invalid=15931, Unknown=0, NotChecked=0, Total=31862 [2018-07-25 13:21:57,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-07-25 13:21:57,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2018-07-25 13:21:57,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-07-25 13:21:57,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 362 transitions. [2018-07-25 13:21:57,931 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 362 transitions. Word has length 358 [2018-07-25 13:21:57,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:57,931 INFO L472 AbstractCegarLoop]: Abstraction has 361 states and 362 transitions. [2018-07-25 13:21:57,931 INFO L473 AbstractCegarLoop]: Interpolant automaton has 179 states. [2018-07-25 13:21:57,931 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 362 transitions. [2018-07-25 13:21:57,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-07-25 13:21:57,932 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:57,932 INFO L354 BasicCegarLoop]: trace histogram [178, 177, 1, 1, 1, 1, 1] [2018-07-25 13:21:57,932 INFO L415 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:57,932 INFO L82 PathProgramCache]: Analyzing trace with hash -888261641, now seen corresponding path program 177 times [2018-07-25 13:21:57,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:59,181 INFO L134 CoverageAnalysis]: Checked inductivity of 31506 backedges. 0 proven. 31506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:59,182 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:59,182 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [179] total 179 [2018-07-25 13:21:59,182 INFO L451 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-07-25 13:21:59,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-07-25 13:21:59,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-07-25 13:21:59,187 INFO L87 Difference]: Start difference. First operand 361 states and 362 transitions. Second operand 180 states. [2018-07-25 13:22:00,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:00,647 INFO L93 Difference]: Finished difference Result 367 states and 369 transitions. [2018-07-25 13:22:00,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-07-25 13:22:00,647 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 360 [2018-07-25 13:22:00,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:00,648 INFO L225 Difference]: With dead ends: 367 [2018-07-25 13:22:00,648 INFO L226 Difference]: Without dead ends: 363 [2018-07-25 13:22:00,651 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-07-25 13:22:00,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-07-25 13:22:00,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2018-07-25 13:22:00,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-07-25 13:22:00,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 364 transitions. [2018-07-25 13:22:00,655 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 364 transitions. Word has length 360 [2018-07-25 13:22:00,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:00,656 INFO L472 AbstractCegarLoop]: Abstraction has 363 states and 364 transitions. [2018-07-25 13:22:00,656 INFO L473 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-07-25 13:22:00,656 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 364 transitions. [2018-07-25 13:22:00,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-07-25 13:22:00,657 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:00,657 INFO L354 BasicCegarLoop]: trace histogram [179, 178, 1, 1, 1, 1, 1] [2018-07-25 13:22:00,657 INFO L415 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:00,657 INFO L82 PathProgramCache]: Analyzing trace with hash 995496691, now seen corresponding path program 178 times [2018-07-25 13:22:00,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 31862 backedges. 0 proven. 31862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:01,896 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:01,896 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [180] total 180 [2018-07-25 13:22:01,896 INFO L451 AbstractCegarLoop]: Interpolant automaton has 181 states [2018-07-25 13:22:01,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 181 interpolants. [2018-07-25 13:22:01,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16290, Invalid=16290, Unknown=0, NotChecked=0, Total=32580 [2018-07-25 13:22:01,901 INFO L87 Difference]: Start difference. First operand 363 states and 364 transitions. Second operand 181 states. [2018-07-25 13:22:02,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:02,335 INFO L93 Difference]: Finished difference Result 369 states and 371 transitions. [2018-07-25 13:22:02,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-07-25 13:22:02,335 INFO L78 Accepts]: Start accepts. Automaton has 181 states. Word has length 362 [2018-07-25 13:22:02,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:02,336 INFO L225 Difference]: With dead ends: 369 [2018-07-25 13:22:02,336 INFO L226 Difference]: Without dead ends: 365 [2018-07-25 13:22:02,340 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16290, Invalid=16290, Unknown=0, NotChecked=0, Total=32580 [2018-07-25 13:22:02,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-07-25 13:22:02,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2018-07-25 13:22:02,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-07-25 13:22:02,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 366 transitions. [2018-07-25 13:22:02,343 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 366 transitions. Word has length 362 [2018-07-25 13:22:02,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:02,343 INFO L472 AbstractCegarLoop]: Abstraction has 365 states and 366 transitions. [2018-07-25 13:22:02,343 INFO L473 AbstractCegarLoop]: Interpolant automaton has 181 states. [2018-07-25 13:22:02,344 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 366 transitions. [2018-07-25 13:22:02,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-07-25 13:22:02,345 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:02,345 INFO L354 BasicCegarLoop]: trace histogram [180, 179, 1, 1, 1, 1, 1] [2018-07-25 13:22:02,345 INFO L415 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:02,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1188945169, now seen corresponding path program 179 times [2018-07-25 13:22:02,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:02,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:03,643 INFO L134 CoverageAnalysis]: Checked inductivity of 32220 backedges. 0 proven. 32220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:03,643 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:03,644 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [181] total 181 [2018-07-25 13:22:03,644 INFO L451 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-07-25 13:22:03,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-07-25 13:22:03,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-07-25 13:22:03,648 INFO L87 Difference]: Start difference. First operand 365 states and 366 transitions. Second operand 182 states. [2018-07-25 13:22:05,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:05,231 INFO L93 Difference]: Finished difference Result 371 states and 373 transitions. [2018-07-25 13:22:05,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-07-25 13:22:05,231 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 364 [2018-07-25 13:22:05,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:05,232 INFO L225 Difference]: With dead ends: 371 [2018-07-25 13:22:05,232 INFO L226 Difference]: Without dead ends: 367 [2018-07-25 13:22:05,235 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-07-25 13:22:05,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-07-25 13:22:05,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2018-07-25 13:22:05,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-07-25 13:22:05,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 368 transitions. [2018-07-25 13:22:05,239 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 368 transitions. Word has length 364 [2018-07-25 13:22:05,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:05,239 INFO L472 AbstractCegarLoop]: Abstraction has 367 states and 368 transitions. [2018-07-25 13:22:05,239 INFO L473 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-07-25 13:22:05,239 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 368 transitions. [2018-07-25 13:22:05,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-07-25 13:22:05,240 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:05,240 INFO L354 BasicCegarLoop]: trace histogram [181, 180, 1, 1, 1, 1, 1] [2018-07-25 13:22:05,240 INFO L415 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:05,241 INFO L82 PathProgramCache]: Analyzing trace with hash -198564885, now seen corresponding path program 180 times [2018-07-25 13:22:05,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:06,417 INFO L134 CoverageAnalysis]: Checked inductivity of 32580 backedges. 0 proven. 32580 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:06,418 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:06,418 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [182] total 182 [2018-07-25 13:22:06,418 INFO L451 AbstractCegarLoop]: Interpolant automaton has 183 states [2018-07-25 13:22:06,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2018-07-25 13:22:06,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2018-07-25 13:22:06,423 INFO L87 Difference]: Start difference. First operand 367 states and 368 transitions. Second operand 183 states. [2018-07-25 13:22:07,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:07,061 INFO L93 Difference]: Finished difference Result 373 states and 375 transitions. [2018-07-25 13:22:07,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-07-25 13:22:07,062 INFO L78 Accepts]: Start accepts. Automaton has 183 states. Word has length 366 [2018-07-25 13:22:07,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:07,062 INFO L225 Difference]: With dead ends: 373 [2018-07-25 13:22:07,062 INFO L226 Difference]: Without dead ends: 369 [2018-07-25 13:22:07,065 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2018-07-25 13:22:07,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-07-25 13:22:07,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2018-07-25 13:22:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-07-25 13:22:07,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 370 transitions. [2018-07-25 13:22:07,069 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 370 transitions. Word has length 366 [2018-07-25 13:22:07,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:07,069 INFO L472 AbstractCegarLoop]: Abstraction has 369 states and 370 transitions. [2018-07-25 13:22:07,069 INFO L473 AbstractCegarLoop]: Interpolant automaton has 183 states. [2018-07-25 13:22:07,069 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 370 transitions. [2018-07-25 13:22:07,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-07-25 13:22:07,070 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:07,070 INFO L354 BasicCegarLoop]: trace histogram [182, 181, 1, 1, 1, 1, 1] [2018-07-25 13:22:07,071 INFO L415 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:07,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1925851673, now seen corresponding path program 181 times [2018-07-25 13:22:07,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:08,395 INFO L134 CoverageAnalysis]: Checked inductivity of 32942 backedges. 0 proven. 32942 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:08,395 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:08,395 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [183] total 183 [2018-07-25 13:22:08,395 INFO L451 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-07-25 13:22:08,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-07-25 13:22:08,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-07-25 13:22:08,400 INFO L87 Difference]: Start difference. First operand 369 states and 370 transitions. Second operand 184 states. [2018-07-25 13:22:10,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:10,096 INFO L93 Difference]: Finished difference Result 375 states and 377 transitions. [2018-07-25 13:22:10,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2018-07-25 13:22:10,096 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 368 [2018-07-25 13:22:10,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:10,097 INFO L225 Difference]: With dead ends: 375 [2018-07-25 13:22:10,097 INFO L226 Difference]: Without dead ends: 371 [2018-07-25 13:22:10,099 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-07-25 13:22:10,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-07-25 13:22:10,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2018-07-25 13:22:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-07-25 13:22:10,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 372 transitions. [2018-07-25 13:22:10,103 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 372 transitions. Word has length 368 [2018-07-25 13:22:10,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:10,103 INFO L472 AbstractCegarLoop]: Abstraction has 371 states and 372 transitions. [2018-07-25 13:22:10,103 INFO L473 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-07-25 13:22:10,103 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 372 transitions. [2018-07-25 13:22:10,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-07-25 13:22:10,104 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:10,104 INFO L354 BasicCegarLoop]: trace histogram [183, 182, 1, 1, 1, 1, 1] [2018-07-25 13:22:10,105 INFO L415 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:10,105 INFO L82 PathProgramCache]: Analyzing trace with hash 303888611, now seen corresponding path program 182 times [2018-07-25 13:22:10,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:11,352 INFO L134 CoverageAnalysis]: Checked inductivity of 33306 backedges. 0 proven. 33306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:11,352 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:11,352 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [184] total 184 [2018-07-25 13:22:11,352 INFO L451 AbstractCegarLoop]: Interpolant automaton has 185 states [2018-07-25 13:22:11,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 185 interpolants. [2018-07-25 13:22:11,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2018-07-25 13:22:11,357 INFO L87 Difference]: Start difference. First operand 371 states and 372 transitions. Second operand 185 states. [2018-07-25 13:22:11,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:11,845 INFO L93 Difference]: Finished difference Result 377 states and 379 transitions. [2018-07-25 13:22:11,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-07-25 13:22:11,846 INFO L78 Accepts]: Start accepts. Automaton has 185 states. Word has length 370 [2018-07-25 13:22:11,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:11,846 INFO L225 Difference]: With dead ends: 377 [2018-07-25 13:22:11,846 INFO L226 Difference]: Without dead ends: 373 [2018-07-25 13:22:11,849 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2018-07-25 13:22:11,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-07-25 13:22:11,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2018-07-25 13:22:11,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-07-25 13:22:11,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 374 transitions. [2018-07-25 13:22:11,853 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 374 transitions. Word has length 370 [2018-07-25 13:22:11,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:11,853 INFO L472 AbstractCegarLoop]: Abstraction has 373 states and 374 transitions. [2018-07-25 13:22:11,853 INFO L473 AbstractCegarLoop]: Interpolant automaton has 185 states. [2018-07-25 13:22:11,853 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 374 transitions. [2018-07-25 13:22:11,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-07-25 13:22:11,854 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:11,854 INFO L354 BasicCegarLoop]: trace histogram [184, 183, 1, 1, 1, 1, 1] [2018-07-25 13:22:11,855 INFO L415 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:11,855 INFO L82 PathProgramCache]: Analyzing trace with hash -104379169, now seen corresponding path program 183 times [2018-07-25 13:22:11,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:13,218 INFO L134 CoverageAnalysis]: Checked inductivity of 33672 backedges. 0 proven. 33672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:13,218 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:13,218 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [185] total 185 [2018-07-25 13:22:13,218 INFO L451 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-07-25 13:22:13,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-07-25 13:22:13,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-07-25 13:22:13,224 INFO L87 Difference]: Start difference. First operand 373 states and 374 transitions. Second operand 186 states. [2018-07-25 13:22:15,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:15,016 INFO L93 Difference]: Finished difference Result 379 states and 381 transitions. [2018-07-25 13:22:15,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-07-25 13:22:15,016 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 372 [2018-07-25 13:22:15,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:15,016 INFO L225 Difference]: With dead ends: 379 [2018-07-25 13:22:15,017 INFO L226 Difference]: Without dead ends: 375 [2018-07-25 13:22:15,020 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-07-25 13:22:15,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-07-25 13:22:15,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2018-07-25 13:22:15,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-07-25 13:22:15,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 376 transitions. [2018-07-25 13:22:15,024 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 376 transitions. Word has length 372 [2018-07-25 13:22:15,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:15,024 INFO L472 AbstractCegarLoop]: Abstraction has 375 states and 376 transitions. [2018-07-25 13:22:15,024 INFO L473 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-07-25 13:22:15,024 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 376 transitions. [2018-07-25 13:22:15,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-07-25 13:22:15,025 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:15,026 INFO L354 BasicCegarLoop]: trace histogram [185, 184, 1, 1, 1, 1, 1] [2018-07-25 13:22:15,026 INFO L415 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:15,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1607691813, now seen corresponding path program 184 times [2018-07-25 13:22:15,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:16,434 INFO L134 CoverageAnalysis]: Checked inductivity of 34040 backedges. 0 proven. 34040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:16,434 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:16,435 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [186] total 186 [2018-07-25 13:22:16,435 INFO L451 AbstractCegarLoop]: Interpolant automaton has 187 states [2018-07-25 13:22:16,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 187 interpolants. [2018-07-25 13:22:16,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17391, Invalid=17391, Unknown=0, NotChecked=0, Total=34782 [2018-07-25 13:22:16,440 INFO L87 Difference]: Start difference. First operand 375 states and 376 transitions. Second operand 187 states. [2018-07-25 13:22:17,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:17,212 INFO L93 Difference]: Finished difference Result 381 states and 383 transitions. [2018-07-25 13:22:17,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-07-25 13:22:17,212 INFO L78 Accepts]: Start accepts. Automaton has 187 states. Word has length 374 [2018-07-25 13:22:17,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:17,212 INFO L225 Difference]: With dead ends: 381 [2018-07-25 13:22:17,212 INFO L226 Difference]: Without dead ends: 377 [2018-07-25 13:22:17,216 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17391, Invalid=17391, Unknown=0, NotChecked=0, Total=34782 [2018-07-25 13:22:17,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-07-25 13:22:17,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2018-07-25 13:22:17,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-07-25 13:22:17,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 378 transitions. [2018-07-25 13:22:17,219 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 378 transitions. Word has length 374 [2018-07-25 13:22:17,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:17,219 INFO L472 AbstractCegarLoop]: Abstraction has 377 states and 378 transitions. [2018-07-25 13:22:17,219 INFO L473 AbstractCegarLoop]: Interpolant automaton has 187 states. [2018-07-25 13:22:17,220 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 378 transitions. [2018-07-25 13:22:17,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-07-25 13:22:17,221 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:17,221 INFO L354 BasicCegarLoop]: trace histogram [186, 185, 1, 1, 1, 1, 1] [2018-07-25 13:22:17,221 INFO L415 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:17,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1112836055, now seen corresponding path program 185 times [2018-07-25 13:22:17,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:18,618 INFO L134 CoverageAnalysis]: Checked inductivity of 34410 backedges. 0 proven. 34410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:18,619 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:18,619 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [187] total 187 [2018-07-25 13:22:18,619 INFO L451 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-07-25 13:22:18,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-07-25 13:22:18,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-07-25 13:22:18,624 INFO L87 Difference]: Start difference. First operand 377 states and 378 transitions. Second operand 188 states. [2018-07-25 13:22:19,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:19,594 INFO L93 Difference]: Finished difference Result 383 states and 385 transitions. [2018-07-25 13:22:19,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-07-25 13:22:19,594 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 376 [2018-07-25 13:22:19,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:19,595 INFO L225 Difference]: With dead ends: 383 [2018-07-25 13:22:19,595 INFO L226 Difference]: Without dead ends: 379 [2018-07-25 13:22:19,598 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-07-25 13:22:19,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-07-25 13:22:19,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-07-25 13:22:19,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-07-25 13:22:19,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 380 transitions. [2018-07-25 13:22:19,602 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 380 transitions. Word has length 376 [2018-07-25 13:22:19,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:19,603 INFO L472 AbstractCegarLoop]: Abstraction has 379 states and 380 transitions. [2018-07-25 13:22:19,603 INFO L473 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-07-25 13:22:19,603 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 380 transitions. [2018-07-25 13:22:19,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-07-25 13:22:19,605 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:19,605 INFO L354 BasicCegarLoop]: trace histogram [187, 186, 1, 1, 1, 1, 1] [2018-07-25 13:22:19,605 INFO L415 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:19,605 INFO L82 PathProgramCache]: Analyzing trace with hash -94966061, now seen corresponding path program 186 times [2018-07-25 13:22:19,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:20,897 INFO L134 CoverageAnalysis]: Checked inductivity of 34782 backedges. 0 proven. 34782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:20,897 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:20,897 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [188] total 188 [2018-07-25 13:22:20,898 INFO L451 AbstractCegarLoop]: Interpolant automaton has 189 states [2018-07-25 13:22:20,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 189 interpolants. [2018-07-25 13:22:20,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17766, Invalid=17766, Unknown=0, NotChecked=0, Total=35532 [2018-07-25 13:22:20,903 INFO L87 Difference]: Start difference. First operand 379 states and 380 transitions. Second operand 189 states. [2018-07-25 13:22:22,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:22,746 INFO L93 Difference]: Finished difference Result 385 states and 387 transitions. [2018-07-25 13:22:22,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-07-25 13:22:22,746 INFO L78 Accepts]: Start accepts. Automaton has 189 states. Word has length 378 [2018-07-25 13:22:22,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:22,747 INFO L225 Difference]: With dead ends: 385 [2018-07-25 13:22:22,747 INFO L226 Difference]: Without dead ends: 381 [2018-07-25 13:22:22,750 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17766, Invalid=17766, Unknown=0, NotChecked=0, Total=35532 [2018-07-25 13:22:22,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-07-25 13:22:22,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-07-25 13:22:22,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-07-25 13:22:22,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 382 transitions. [2018-07-25 13:22:22,754 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 382 transitions. Word has length 378 [2018-07-25 13:22:22,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:22,754 INFO L472 AbstractCegarLoop]: Abstraction has 381 states and 382 transitions. [2018-07-25 13:22:22,754 INFO L473 AbstractCegarLoop]: Interpolant automaton has 189 states. [2018-07-25 13:22:22,754 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 382 transitions. [2018-07-25 13:22:22,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-07-25 13:22:22,755 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:22,755 INFO L354 BasicCegarLoop]: trace histogram [188, 187, 1, 1, 1, 1, 1] [2018-07-25 13:22:22,755 INFO L415 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:22,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1151629617, now seen corresponding path program 187 times [2018-07-25 13:22:22,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:24,229 INFO L134 CoverageAnalysis]: Checked inductivity of 35156 backedges. 0 proven. 35156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:24,230 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:24,230 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [189] total 189 [2018-07-25 13:22:24,230 INFO L451 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-07-25 13:22:24,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-07-25 13:22:24,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-07-25 13:22:24,235 INFO L87 Difference]: Start difference. First operand 381 states and 382 transitions. Second operand 190 states. [2018-07-25 13:22:25,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:25,321 INFO L93 Difference]: Finished difference Result 387 states and 389 transitions. [2018-07-25 13:22:25,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2018-07-25 13:22:25,321 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 380 [2018-07-25 13:22:25,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:25,321 INFO L225 Difference]: With dead ends: 387 [2018-07-25 13:22:25,321 INFO L226 Difference]: Without dead ends: 383 [2018-07-25 13:22:25,323 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-07-25 13:22:25,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-07-25 13:22:25,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2018-07-25 13:22:25,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-07-25 13:22:25,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 384 transitions. [2018-07-25 13:22:25,326 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 384 transitions. Word has length 380 [2018-07-25 13:22:25,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:25,326 INFO L472 AbstractCegarLoop]: Abstraction has 383 states and 384 transitions. [2018-07-25 13:22:25,326 INFO L473 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-07-25 13:22:25,327 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 384 transitions. [2018-07-25 13:22:25,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-07-25 13:22:25,328 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:25,328 INFO L354 BasicCegarLoop]: trace histogram [189, 188, 1, 1, 1, 1, 1] [2018-07-25 13:22:25,328 INFO L415 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:25,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1301942219, now seen corresponding path program 188 times [2018-07-25 13:22:25,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:26,801 INFO L134 CoverageAnalysis]: Checked inductivity of 35532 backedges. 0 proven. 35532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:26,801 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:26,802 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [190] total 190 [2018-07-25 13:22:26,802 INFO L451 AbstractCegarLoop]: Interpolant automaton has 191 states [2018-07-25 13:22:26,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 191 interpolants. [2018-07-25 13:22:26,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18145, Invalid=18145, Unknown=0, NotChecked=0, Total=36290 [2018-07-25 13:22:26,807 INFO L87 Difference]: Start difference. First operand 383 states and 384 transitions. Second operand 191 states. [2018-07-25 13:22:27,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:27,313 INFO L93 Difference]: Finished difference Result 389 states and 391 transitions. [2018-07-25 13:22:27,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-07-25 13:22:27,313 INFO L78 Accepts]: Start accepts. Automaton has 191 states. Word has length 382 [2018-07-25 13:22:27,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:27,314 INFO L225 Difference]: With dead ends: 389 [2018-07-25 13:22:27,314 INFO L226 Difference]: Without dead ends: 385 [2018-07-25 13:22:27,317 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18145, Invalid=18145, Unknown=0, NotChecked=0, Total=36290 [2018-07-25 13:22:27,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-07-25 13:22:27,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2018-07-25 13:22:27,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-07-25 13:22:27,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 386 transitions. [2018-07-25 13:22:27,321 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 386 transitions. Word has length 382 [2018-07-25 13:22:27,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:27,321 INFO L472 AbstractCegarLoop]: Abstraction has 385 states and 386 transitions. [2018-07-25 13:22:27,321 INFO L473 AbstractCegarLoop]: Interpolant automaton has 191 states. [2018-07-25 13:22:27,321 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 386 transitions. [2018-07-25 13:22:27,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-07-25 13:22:27,322 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:27,322 INFO L354 BasicCegarLoop]: trace histogram [190, 189, 1, 1, 1, 1, 1] [2018-07-25 13:22:27,323 INFO L415 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:27,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1247431111, now seen corresponding path program 189 times [2018-07-25 13:22:27,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:28,842 INFO L134 CoverageAnalysis]: Checked inductivity of 35910 backedges. 0 proven. 35910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:28,842 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:28,842 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [191] total 191 [2018-07-25 13:22:28,843 INFO L451 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-07-25 13:22:28,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-07-25 13:22:28,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-07-25 13:22:28,845 INFO L87 Difference]: Start difference. First operand 385 states and 386 transitions. Second operand 192 states. [2018-07-25 13:22:29,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:29,920 INFO L93 Difference]: Finished difference Result 391 states and 393 transitions. [2018-07-25 13:22:29,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-07-25 13:22:29,920 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 384 [2018-07-25 13:22:29,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:29,921 INFO L225 Difference]: With dead ends: 391 [2018-07-25 13:22:29,921 INFO L226 Difference]: Without dead ends: 387 [2018-07-25 13:22:29,922 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-07-25 13:22:29,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-07-25 13:22:29,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2018-07-25 13:22:29,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-07-25 13:22:29,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 388 transitions. [2018-07-25 13:22:29,928 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 388 transitions. Word has length 384 [2018-07-25 13:22:29,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:29,928 INFO L472 AbstractCegarLoop]: Abstraction has 387 states and 388 transitions. [2018-07-25 13:22:29,928 INFO L473 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-07-25 13:22:29,928 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 388 transitions. [2018-07-25 13:22:29,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-07-25 13:22:29,930 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:29,930 INFO L354 BasicCegarLoop]: trace histogram [191, 190, 1, 1, 1, 1, 1] [2018-07-25 13:22:29,931 INFO L415 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:29,931 INFO L82 PathProgramCache]: Analyzing trace with hash 401863875, now seen corresponding path program 190 times [2018-07-25 13:22:29,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:31,436 INFO L134 CoverageAnalysis]: Checked inductivity of 36290 backedges. 0 proven. 36290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:31,436 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:31,436 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [192] total 192 [2018-07-25 13:22:31,437 INFO L451 AbstractCegarLoop]: Interpolant automaton has 193 states [2018-07-25 13:22:31,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2018-07-25 13:22:31,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2018-07-25 13:22:31,441 INFO L87 Difference]: Start difference. First operand 387 states and 388 transitions. Second operand 193 states. [2018-07-25 13:22:33,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:33,321 INFO L93 Difference]: Finished difference Result 393 states and 395 transitions. [2018-07-25 13:22:33,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-07-25 13:22:33,321 INFO L78 Accepts]: Start accepts. Automaton has 193 states. Word has length 386 [2018-07-25 13:22:33,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:33,322 INFO L225 Difference]: With dead ends: 393 [2018-07-25 13:22:33,322 INFO L226 Difference]: Without dead ends: 389 [2018-07-25 13:22:33,327 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2018-07-25 13:22:33,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-07-25 13:22:33,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2018-07-25 13:22:33,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-07-25 13:22:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 390 transitions. [2018-07-25 13:22:33,330 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 390 transitions. Word has length 386 [2018-07-25 13:22:33,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:33,331 INFO L472 AbstractCegarLoop]: Abstraction has 389 states and 390 transitions. [2018-07-25 13:22:33,331 INFO L473 AbstractCegarLoop]: Interpolant automaton has 193 states. [2018-07-25 13:22:33,331 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 390 transitions. [2018-07-25 13:22:33,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-07-25 13:22:33,332 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:33,332 INFO L354 BasicCegarLoop]: trace histogram [192, 191, 1, 1, 1, 1, 1] [2018-07-25 13:22:33,332 INFO L415 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:33,332 INFO L82 PathProgramCache]: Analyzing trace with hash -439430977, now seen corresponding path program 191 times [2018-07-25 13:22:33,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:34,897 INFO L134 CoverageAnalysis]: Checked inductivity of 36672 backedges. 0 proven. 36672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:34,898 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:34,898 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [193] total 193 [2018-07-25 13:22:34,898 INFO L451 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-07-25 13:22:34,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-07-25 13:22:34,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-07-25 13:22:34,904 INFO L87 Difference]: Start difference. First operand 389 states and 390 transitions. Second operand 194 states. [2018-07-25 13:22:36,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:36,892 INFO L93 Difference]: Finished difference Result 395 states and 397 transitions. [2018-07-25 13:22:36,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2018-07-25 13:22:36,893 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 388 [2018-07-25 13:22:36,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:36,893 INFO L225 Difference]: With dead ends: 395 [2018-07-25 13:22:36,893 INFO L226 Difference]: Without dead ends: 391 [2018-07-25 13:22:36,897 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-07-25 13:22:36,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-07-25 13:22:36,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2018-07-25 13:22:36,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-07-25 13:22:36,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 392 transitions. [2018-07-25 13:22:36,901 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 392 transitions. Word has length 388 [2018-07-25 13:22:36,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:36,901 INFO L472 AbstractCegarLoop]: Abstraction has 391 states and 392 transitions. [2018-07-25 13:22:36,901 INFO L473 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-07-25 13:22:36,901 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 392 transitions. [2018-07-25 13:22:36,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-07-25 13:22:36,903 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:36,903 INFO L354 BasicCegarLoop]: trace histogram [193, 192, 1, 1, 1, 1, 1] [2018-07-25 13:22:36,904 INFO L415 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:36,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1469932101, now seen corresponding path program 192 times [2018-07-25 13:22:36,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:38,457 INFO L134 CoverageAnalysis]: Checked inductivity of 37056 backedges. 0 proven. 37056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:38,457 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:38,457 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [194] total 194 [2018-07-25 13:22:38,458 INFO L451 AbstractCegarLoop]: Interpolant automaton has 195 states [2018-07-25 13:22:38,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 195 interpolants. [2018-07-25 13:22:38,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18915, Invalid=18915, Unknown=0, NotChecked=0, Total=37830 [2018-07-25 13:22:38,463 INFO L87 Difference]: Start difference. First operand 391 states and 392 transitions. Second operand 195 states. [2018-07-25 13:22:40,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:40,332 INFO L93 Difference]: Finished difference Result 397 states and 399 transitions. [2018-07-25 13:22:40,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-07-25 13:22:40,332 INFO L78 Accepts]: Start accepts. Automaton has 195 states. Word has length 390 [2018-07-25 13:22:40,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:40,333 INFO L225 Difference]: With dead ends: 397 [2018-07-25 13:22:40,333 INFO L226 Difference]: Without dead ends: 393 [2018-07-25 13:22:40,337 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18915, Invalid=18915, Unknown=0, NotChecked=0, Total=37830 [2018-07-25 13:22:40,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-07-25 13:22:40,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2018-07-25 13:22:40,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-07-25 13:22:40,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 394 transitions. [2018-07-25 13:22:40,341 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 394 transitions. Word has length 390 [2018-07-25 13:22:40,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:40,341 INFO L472 AbstractCegarLoop]: Abstraction has 393 states and 394 transitions. [2018-07-25 13:22:40,341 INFO L473 AbstractCegarLoop]: Interpolant automaton has 195 states. [2018-07-25 13:22:40,341 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 394 transitions. [2018-07-25 13:22:40,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-07-25 13:22:40,342 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:40,342 INFO L354 BasicCegarLoop]: trace histogram [194, 193, 1, 1, 1, 1, 1] [2018-07-25 13:22:40,342 INFO L415 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:40,343 INFO L82 PathProgramCache]: Analyzing trace with hash 355933111, now seen corresponding path program 193 times [2018-07-25 13:22:40,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 37442 backedges. 0 proven. 37442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:41,962 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:41,962 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [195] total 195 [2018-07-25 13:22:41,963 INFO L451 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-07-25 13:22:41,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-07-25 13:22:41,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-07-25 13:22:41,968 INFO L87 Difference]: Start difference. First operand 393 states and 394 transitions. Second operand 196 states. [2018-07-25 13:22:43,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:43,554 INFO L93 Difference]: Finished difference Result 399 states and 401 transitions. [2018-07-25 13:22:43,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2018-07-25 13:22:43,554 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 392 [2018-07-25 13:22:43,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:43,555 INFO L225 Difference]: With dead ends: 399 [2018-07-25 13:22:43,555 INFO L226 Difference]: Without dead ends: 395 [2018-07-25 13:22:43,558 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-07-25 13:22:43,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-07-25 13:22:43,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-07-25 13:22:43,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-07-25 13:22:43,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 396 transitions. [2018-07-25 13:22:43,562 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 396 transitions. Word has length 392 [2018-07-25 13:22:43,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:43,562 INFO L472 AbstractCegarLoop]: Abstraction has 395 states and 396 transitions. [2018-07-25 13:22:43,562 INFO L473 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-07-25 13:22:43,562 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 396 transitions. [2018-07-25 13:22:43,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-07-25 13:22:43,563 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:43,563 INFO L354 BasicCegarLoop]: trace histogram [195, 194, 1, 1, 1, 1, 1] [2018-07-25 13:22:43,563 INFO L415 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:43,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1629222221, now seen corresponding path program 194 times [2018-07-25 13:22:43,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 37830 backedges. 0 proven. 37830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:45,128 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:45,128 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [196] total 196 [2018-07-25 13:22:45,128 INFO L451 AbstractCegarLoop]: Interpolant automaton has 197 states [2018-07-25 13:22:45,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 197 interpolants. [2018-07-25 13:22:45,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19306, Invalid=19306, Unknown=0, NotChecked=0, Total=38612 [2018-07-25 13:22:45,134 INFO L87 Difference]: Start difference. First operand 395 states and 396 transitions. Second operand 197 states. [2018-07-25 13:22:46,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:46,595 INFO L93 Difference]: Finished difference Result 401 states and 403 transitions. [2018-07-25 13:22:46,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-07-25 13:22:46,595 INFO L78 Accepts]: Start accepts. Automaton has 197 states. Word has length 394 [2018-07-25 13:22:46,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:46,596 INFO L225 Difference]: With dead ends: 401 [2018-07-25 13:22:46,596 INFO L226 Difference]: Without dead ends: 397 [2018-07-25 13:22:46,600 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19306, Invalid=19306, Unknown=0, NotChecked=0, Total=38612 [2018-07-25 13:22:46,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-07-25 13:22:46,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2018-07-25 13:22:46,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-07-25 13:22:46,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 398 transitions. [2018-07-25 13:22:46,604 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 398 transitions. Word has length 394 [2018-07-25 13:22:46,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:46,604 INFO L472 AbstractCegarLoop]: Abstraction has 397 states and 398 transitions. [2018-07-25 13:22:46,604 INFO L473 AbstractCegarLoop]: Interpolant automaton has 197 states. [2018-07-25 13:22:46,604 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 398 transitions. [2018-07-25 13:22:46,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-07-25 13:22:46,606 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:46,606 INFO L354 BasicCegarLoop]: trace histogram [196, 195, 1, 1, 1, 1, 1] [2018-07-25 13:22:46,606 INFO L415 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:46,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1896950447, now seen corresponding path program 195 times [2018-07-25 13:22:46,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:48,117 INFO L134 CoverageAnalysis]: Checked inductivity of 38220 backedges. 0 proven. 38220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:48,117 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:48,117 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [197] total 197 [2018-07-25 13:22:48,118 INFO L451 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-07-25 13:22:48,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-07-25 13:22:48,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-07-25 13:22:48,125 INFO L87 Difference]: Start difference. First operand 397 states and 398 transitions. Second operand 198 states. [2018-07-25 13:22:49,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:49,926 INFO L93 Difference]: Finished difference Result 403 states and 405 transitions. [2018-07-25 13:22:49,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-07-25 13:22:49,927 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 396 [2018-07-25 13:22:49,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:49,927 INFO L225 Difference]: With dead ends: 403 [2018-07-25 13:22:49,927 INFO L226 Difference]: Without dead ends: 399 [2018-07-25 13:22:49,931 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-07-25 13:22:49,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-07-25 13:22:49,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-07-25 13:22:49,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-07-25 13:22:49,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 400 transitions. [2018-07-25 13:22:49,934 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 400 transitions. Word has length 396 [2018-07-25 13:22:49,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:49,935 INFO L472 AbstractCegarLoop]: Abstraction has 399 states and 400 transitions. [2018-07-25 13:22:49,935 INFO L473 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-07-25 13:22:49,935 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 400 transitions. [2018-07-25 13:22:49,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-07-25 13:22:49,936 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:49,936 INFO L354 BasicCegarLoop]: trace histogram [197, 196, 1, 1, 1, 1, 1] [2018-07-25 13:22:49,936 INFO L415 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:49,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1819687851, now seen corresponding path program 196 times [2018-07-25 13:22:49,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:51,601 INFO L134 CoverageAnalysis]: Checked inductivity of 38612 backedges. 0 proven. 38612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:51,601 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:51,601 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [198] total 198 [2018-07-25 13:22:51,602 INFO L451 AbstractCegarLoop]: Interpolant automaton has 199 states [2018-07-25 13:22:51,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 199 interpolants. [2018-07-25 13:22:51,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19701, Invalid=19701, Unknown=0, NotChecked=0, Total=39402 [2018-07-25 13:22:51,605 INFO L87 Difference]: Start difference. First operand 399 states and 400 transitions. Second operand 199 states. [2018-07-25 13:22:53,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:53,225 INFO L93 Difference]: Finished difference Result 405 states and 407 transitions. [2018-07-25 13:22:53,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-07-25 13:22:53,225 INFO L78 Accepts]: Start accepts. Automaton has 199 states. Word has length 398 [2018-07-25 13:22:53,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:53,226 INFO L225 Difference]: With dead ends: 405 [2018-07-25 13:22:53,226 INFO L226 Difference]: Without dead ends: 401 [2018-07-25 13:22:53,228 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19701, Invalid=19701, Unknown=0, NotChecked=0, Total=39402 [2018-07-25 13:22:53,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-07-25 13:22:53,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2018-07-25 13:22:53,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-07-25 13:22:53,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 402 transitions. [2018-07-25 13:22:53,231 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 402 transitions. Word has length 398 [2018-07-25 13:22:53,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:53,232 INFO L472 AbstractCegarLoop]: Abstraction has 401 states and 402 transitions. [2018-07-25 13:22:53,232 INFO L473 AbstractCegarLoop]: Interpolant automaton has 199 states. [2018-07-25 13:22:53,232 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 402 transitions. [2018-07-25 13:22:53,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-07-25 13:22:53,233 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:53,233 INFO L354 BasicCegarLoop]: trace histogram [198, 197, 1, 1, 1, 1, 1] [2018-07-25 13:22:53,233 INFO L415 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:53,233 INFO L82 PathProgramCache]: Analyzing trace with hash 584777127, now seen corresponding path program 197 times [2018-07-25 13:22:53,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:54,886 INFO L134 CoverageAnalysis]: Checked inductivity of 39006 backedges. 0 proven. 39006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:54,886 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:54,886 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [199] total 199 [2018-07-25 13:22:54,887 INFO L451 AbstractCegarLoop]: Interpolant automaton has 200 states [2018-07-25 13:22:54,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2018-07-25 13:22:54,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-07-25 13:22:54,892 INFO L87 Difference]: Start difference. First operand 401 states and 402 transitions. Second operand 200 states. [2018-07-25 13:22:57,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:57,065 INFO L93 Difference]: Finished difference Result 407 states and 409 transitions. [2018-07-25 13:22:57,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-07-25 13:22:57,065 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 400 [2018-07-25 13:22:57,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:57,066 INFO L225 Difference]: With dead ends: 407 [2018-07-25 13:22:57,066 INFO L226 Difference]: Without dead ends: 403 [2018-07-25 13:22:57,069 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-07-25 13:22:57,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-07-25 13:22:57,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-07-25 13:22:57,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-07-25 13:22:57,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 404 transitions. [2018-07-25 13:22:57,073 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 404 transitions. Word has length 400 [2018-07-25 13:22:57,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:57,073 INFO L472 AbstractCegarLoop]: Abstraction has 403 states and 404 transitions. [2018-07-25 13:22:57,074 INFO L473 AbstractCegarLoop]: Interpolant automaton has 200 states. [2018-07-25 13:22:57,074 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 404 transitions. [2018-07-25 13:22:57,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-07-25 13:22:57,075 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:57,075 INFO L354 BasicCegarLoop]: trace histogram [199, 198, 1, 1, 1, 1, 1] [2018-07-25 13:22:57,075 INFO L415 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:57,075 INFO L82 PathProgramCache]: Analyzing trace with hash -753454941, now seen corresponding path program 198 times [2018-07-25 13:22:57,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:58,785 INFO L134 CoverageAnalysis]: Checked inductivity of 39402 backedges. 0 proven. 39402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:58,786 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:58,786 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [200] total 200 [2018-07-25 13:22:58,786 INFO L451 AbstractCegarLoop]: Interpolant automaton has 201 states [2018-07-25 13:22:58,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 201 interpolants. [2018-07-25 13:22:58,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20100, Invalid=20100, Unknown=0, NotChecked=0, Total=40200 [2018-07-25 13:22:58,791 INFO L87 Difference]: Start difference. First operand 403 states and 404 transitions. Second operand 201 states. [2018-07-25 13:23:01,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:01,111 INFO L93 Difference]: Finished difference Result 409 states and 411 transitions. [2018-07-25 13:23:01,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-07-25 13:23:01,112 INFO L78 Accepts]: Start accepts. Automaton has 201 states. Word has length 402 [2018-07-25 13:23:01,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:01,112 INFO L225 Difference]: With dead ends: 409 [2018-07-25 13:23:01,112 INFO L226 Difference]: Without dead ends: 405 [2018-07-25 13:23:01,116 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20100, Invalid=20100, Unknown=0, NotChecked=0, Total=40200 [2018-07-25 13:23:01,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-07-25 13:23:01,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2018-07-25 13:23:01,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-07-25 13:23:01,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 406 transitions. [2018-07-25 13:23:01,119 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 406 transitions. Word has length 402 [2018-07-25 13:23:01,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:01,120 INFO L472 AbstractCegarLoop]: Abstraction has 405 states and 406 transitions. [2018-07-25 13:23:01,120 INFO L473 AbstractCegarLoop]: Interpolant automaton has 201 states. [2018-07-25 13:23:01,120 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 406 transitions. [2018-07-25 13:23:01,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-07-25 13:23:01,121 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:01,121 INFO L354 BasicCegarLoop]: trace histogram [200, 199, 1, 1, 1, 1, 1] [2018-07-25 13:23:01,121 INFO L415 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:01,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1695716511, now seen corresponding path program 199 times [2018-07-25 13:23:01,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:02,827 INFO L134 CoverageAnalysis]: Checked inductivity of 39800 backedges. 0 proven. 39800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:02,827 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:02,828 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [201] total 201 [2018-07-25 13:23:02,828 INFO L451 AbstractCegarLoop]: Interpolant automaton has 202 states [2018-07-25 13:23:02,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2018-07-25 13:23:02,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-07-25 13:23:02,835 INFO L87 Difference]: Start difference. First operand 405 states and 406 transitions. Second operand 202 states. [2018-07-25 13:23:04,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:04,948 INFO L93 Difference]: Finished difference Result 411 states and 413 transitions. [2018-07-25 13:23:04,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2018-07-25 13:23:04,948 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 404 [2018-07-25 13:23:04,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:04,948 INFO L225 Difference]: With dead ends: 411 [2018-07-25 13:23:04,948 INFO L226 Difference]: Without dead ends: 407 [2018-07-25 13:23:04,950 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-07-25 13:23:04,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-07-25 13:23:04,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2018-07-25 13:23:04,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-07-25 13:23:04,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 408 transitions. [2018-07-25 13:23:04,954 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 408 transitions. Word has length 404 [2018-07-25 13:23:04,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:04,954 INFO L472 AbstractCegarLoop]: Abstraction has 407 states and 408 transitions. [2018-07-25 13:23:04,954 INFO L473 AbstractCegarLoop]: Interpolant automaton has 202 states. [2018-07-25 13:23:04,954 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 408 transitions. [2018-07-25 13:23:04,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-07-25 13:23:04,956 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:04,956 INFO L354 BasicCegarLoop]: trace histogram [201, 200, 1, 1, 1, 1, 1] [2018-07-25 13:23:04,956 INFO L415 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:04,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1707403675, now seen corresponding path program 200 times [2018-07-25 13:23:04,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:06,733 INFO L134 CoverageAnalysis]: Checked inductivity of 40200 backedges. 0 proven. 40200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:06,733 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:06,733 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [202] total 202 [2018-07-25 13:23:06,734 INFO L451 AbstractCegarLoop]: Interpolant automaton has 203 states [2018-07-25 13:23:06,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2018-07-25 13:23:06,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20503, Invalid=20503, Unknown=0, NotChecked=0, Total=41006 [2018-07-25 13:23:06,740 INFO L87 Difference]: Start difference. First operand 407 states and 408 transitions. Second operand 203 states. [2018-07-25 13:23:08,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:08,042 INFO L93 Difference]: Finished difference Result 413 states and 415 transitions. [2018-07-25 13:23:08,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-07-25 13:23:08,042 INFO L78 Accepts]: Start accepts. Automaton has 203 states. Word has length 406 [2018-07-25 13:23:08,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:08,043 INFO L225 Difference]: With dead ends: 413 [2018-07-25 13:23:08,043 INFO L226 Difference]: Without dead ends: 409 [2018-07-25 13:23:08,049 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20503, Invalid=20503, Unknown=0, NotChecked=0, Total=41006 [2018-07-25 13:23:08,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-07-25 13:23:08,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2018-07-25 13:23:08,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-07-25 13:23:08,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 410 transitions. [2018-07-25 13:23:08,055 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 410 transitions. Word has length 406 [2018-07-25 13:23:08,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:08,056 INFO L472 AbstractCegarLoop]: Abstraction has 409 states and 410 transitions. [2018-07-25 13:23:08,056 INFO L473 AbstractCegarLoop]: Interpolant automaton has 203 states. [2018-07-25 13:23:08,056 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 410 transitions. [2018-07-25 13:23:08,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-07-25 13:23:08,058 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:08,058 INFO L354 BasicCegarLoop]: trace histogram [202, 201, 1, 1, 1, 1, 1] [2018-07-25 13:23:08,058 INFO L415 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:08,058 INFO L82 PathProgramCache]: Analyzing trace with hash 53866391, now seen corresponding path program 201 times [2018-07-25 13:23:08,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:09,809 INFO L134 CoverageAnalysis]: Checked inductivity of 40602 backedges. 0 proven. 40602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:09,809 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:09,809 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [203] total 203 [2018-07-25 13:23:09,810 INFO L451 AbstractCegarLoop]: Interpolant automaton has 204 states [2018-07-25 13:23:09,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2018-07-25 13:23:09,814 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-07-25 13:23:09,815 INFO L87 Difference]: Start difference. First operand 409 states and 410 transitions. Second operand 204 states. [2018-07-25 13:23:10,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:10,451 INFO L93 Difference]: Finished difference Result 415 states and 417 transitions. [2018-07-25 13:23:10,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-07-25 13:23:10,452 INFO L78 Accepts]: Start accepts. Automaton has 204 states. Word has length 408 [2018-07-25 13:23:10,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:10,452 INFO L225 Difference]: With dead ends: 415 [2018-07-25 13:23:10,452 INFO L226 Difference]: Without dead ends: 411 [2018-07-25 13:23:10,455 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-07-25 13:23:10,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-07-25 13:23:10,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2018-07-25 13:23:10,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-07-25 13:23:10,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 412 transitions. [2018-07-25 13:23:10,458 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 412 transitions. Word has length 408 [2018-07-25 13:23:10,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:10,458 INFO L472 AbstractCegarLoop]: Abstraction has 411 states and 412 transitions. [2018-07-25 13:23:10,459 INFO L473 AbstractCegarLoop]: Interpolant automaton has 204 states. [2018-07-25 13:23:10,459 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 412 transitions. [2018-07-25 13:23:10,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-07-25 13:23:10,460 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:10,460 INFO L354 BasicCegarLoop]: trace histogram [203, 202, 1, 1, 1, 1, 1] [2018-07-25 13:23:10,460 INFO L415 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:10,460 INFO L82 PathProgramCache]: Analyzing trace with hash 142435987, now seen corresponding path program 202 times [2018-07-25 13:23:10,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:12,250 INFO L134 CoverageAnalysis]: Checked inductivity of 41006 backedges. 0 proven. 41006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:12,251 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:12,251 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [204] total 204 [2018-07-25 13:23:12,251 INFO L451 AbstractCegarLoop]: Interpolant automaton has 205 states [2018-07-25 13:23:12,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 205 interpolants. [2018-07-25 13:23:12,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20910, Invalid=20910, Unknown=0, NotChecked=0, Total=41820 [2018-07-25 13:23:12,257 INFO L87 Difference]: Start difference. First operand 411 states and 412 transitions. Second operand 205 states. [2018-07-25 13:23:14,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:14,145 INFO L93 Difference]: Finished difference Result 417 states and 419 transitions. [2018-07-25 13:23:14,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2018-07-25 13:23:14,146 INFO L78 Accepts]: Start accepts. Automaton has 205 states. Word has length 410 [2018-07-25 13:23:14,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:14,146 INFO L225 Difference]: With dead ends: 417 [2018-07-25 13:23:14,146 INFO L226 Difference]: Without dead ends: 413 [2018-07-25 13:23:14,150 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20910, Invalid=20910, Unknown=0, NotChecked=0, Total=41820 [2018-07-25 13:23:14,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-07-25 13:23:14,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2018-07-25 13:23:14,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-07-25 13:23:14,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 414 transitions. [2018-07-25 13:23:14,154 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 414 transitions. Word has length 410 [2018-07-25 13:23:14,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:14,155 INFO L472 AbstractCegarLoop]: Abstraction has 413 states and 414 transitions. [2018-07-25 13:23:14,155 INFO L473 AbstractCegarLoop]: Interpolant automaton has 205 states. [2018-07-25 13:23:14,155 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 414 transitions. [2018-07-25 13:23:14,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-07-25 13:23:14,156 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:14,156 INFO L354 BasicCegarLoop]: trace histogram [204, 203, 1, 1, 1, 1, 1] [2018-07-25 13:23:14,156 INFO L415 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:14,156 INFO L82 PathProgramCache]: Analyzing trace with hash -641528177, now seen corresponding path program 203 times [2018-07-25 13:23:14,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:15,887 INFO L134 CoverageAnalysis]: Checked inductivity of 41412 backedges. 0 proven. 41412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:15,887 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:15,888 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [205] total 205 [2018-07-25 13:23:15,888 INFO L451 AbstractCegarLoop]: Interpolant automaton has 206 states [2018-07-25 13:23:15,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 206 interpolants. [2018-07-25 13:23:15,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-07-25 13:23:15,895 INFO L87 Difference]: Start difference. First operand 413 states and 414 transitions. Second operand 206 states. [2018-07-25 13:23:18,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:18,400 INFO L93 Difference]: Finished difference Result 419 states and 421 transitions. [2018-07-25 13:23:18,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-07-25 13:23:18,401 INFO L78 Accepts]: Start accepts. Automaton has 206 states. Word has length 412 [2018-07-25 13:23:18,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:18,401 INFO L225 Difference]: With dead ends: 419 [2018-07-25 13:23:18,401 INFO L226 Difference]: Without dead ends: 415 [2018-07-25 13:23:18,406 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-07-25 13:23:18,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-07-25 13:23:18,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2018-07-25 13:23:18,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-07-25 13:23:18,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 416 transitions. [2018-07-25 13:23:18,411 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 416 transitions. Word has length 412 [2018-07-25 13:23:18,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:18,412 INFO L472 AbstractCegarLoop]: Abstraction has 415 states and 416 transitions. [2018-07-25 13:23:18,412 INFO L473 AbstractCegarLoop]: Interpolant automaton has 206 states. [2018-07-25 13:23:18,412 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 416 transitions. [2018-07-25 13:23:18,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-07-25 13:23:18,413 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:18,413 INFO L354 BasicCegarLoop]: trace histogram [205, 204, 1, 1, 1, 1, 1] [2018-07-25 13:23:18,413 INFO L415 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:18,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1883154315, now seen corresponding path program 204 times [2018-07-25 13:23:18,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:20,338 INFO L134 CoverageAnalysis]: Checked inductivity of 41820 backedges. 0 proven. 41820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:20,339 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:20,339 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [206] total 206 [2018-07-25 13:23:20,339 INFO L451 AbstractCegarLoop]: Interpolant automaton has 207 states [2018-07-25 13:23:20,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 207 interpolants. [2018-07-25 13:23:20,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21321, Invalid=21321, Unknown=0, NotChecked=0, Total=42642 [2018-07-25 13:23:20,342 INFO L87 Difference]: Start difference. First operand 415 states and 416 transitions. Second operand 207 states. [2018-07-25 13:23:21,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:21,077 INFO L93 Difference]: Finished difference Result 421 states and 423 transitions. [2018-07-25 13:23:21,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-07-25 13:23:21,077 INFO L78 Accepts]: Start accepts. Automaton has 207 states. Word has length 414 [2018-07-25 13:23:21,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:21,078 INFO L225 Difference]: With dead ends: 421 [2018-07-25 13:23:21,078 INFO L226 Difference]: Without dead ends: 417 [2018-07-25 13:23:21,080 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21321, Invalid=21321, Unknown=0, NotChecked=0, Total=42642 [2018-07-25 13:23:21,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-07-25 13:23:21,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2018-07-25 13:23:21,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-07-25 13:23:21,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 418 transitions. [2018-07-25 13:23:21,083 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 418 transitions. Word has length 414 [2018-07-25 13:23:21,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:21,084 INFO L472 AbstractCegarLoop]: Abstraction has 417 states and 418 transitions. [2018-07-25 13:23:21,084 INFO L473 AbstractCegarLoop]: Interpolant automaton has 207 states. [2018-07-25 13:23:21,084 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 418 transitions. [2018-07-25 13:23:21,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-07-25 13:23:21,085 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:21,085 INFO L354 BasicCegarLoop]: trace histogram [206, 205, 1, 1, 1, 1, 1] [2018-07-25 13:23:21,085 INFO L415 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:21,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1446506887, now seen corresponding path program 205 times [2018-07-25 13:23:21,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:22,926 INFO L134 CoverageAnalysis]: Checked inductivity of 42230 backedges. 0 proven. 42230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:22,926 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:22,926 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [207] total 207 [2018-07-25 13:23:22,926 INFO L451 AbstractCegarLoop]: Interpolant automaton has 208 states [2018-07-25 13:23:22,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 208 interpolants. [2018-07-25 13:23:22,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-07-25 13:23:22,934 INFO L87 Difference]: Start difference. First operand 417 states and 418 transitions. Second operand 208 states. [2018-07-25 13:23:24,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:24,766 INFO L93 Difference]: Finished difference Result 423 states and 425 transitions. [2018-07-25 13:23:24,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2018-07-25 13:23:24,767 INFO L78 Accepts]: Start accepts. Automaton has 208 states. Word has length 416 [2018-07-25 13:23:24,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:24,767 INFO L225 Difference]: With dead ends: 423 [2018-07-25 13:23:24,767 INFO L226 Difference]: Without dead ends: 419 [2018-07-25 13:23:24,772 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-07-25 13:23:24,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-07-25 13:23:24,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2018-07-25 13:23:24,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-07-25 13:23:24,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 420 transitions. [2018-07-25 13:23:24,776 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 420 transitions. Word has length 416 [2018-07-25 13:23:24,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:24,776 INFO L472 AbstractCegarLoop]: Abstraction has 419 states and 420 transitions. [2018-07-25 13:23:24,776 INFO L473 AbstractCegarLoop]: Interpolant automaton has 208 states. [2018-07-25 13:23:24,776 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 420 transitions. [2018-07-25 13:23:24,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-07-25 13:23:24,778 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:24,778 INFO L354 BasicCegarLoop]: trace histogram [207, 206, 1, 1, 1, 1, 1] [2018-07-25 13:23:24,778 INFO L415 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:24,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1559843709, now seen corresponding path program 206 times [2018-07-25 13:23:24,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:26,750 INFO L134 CoverageAnalysis]: Checked inductivity of 42642 backedges. 0 proven. 42642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:26,750 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:26,750 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [208] total 208 [2018-07-25 13:23:26,750 INFO L451 AbstractCegarLoop]: Interpolant automaton has 209 states [2018-07-25 13:23:26,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 209 interpolants. [2018-07-25 13:23:26,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21736, Invalid=21736, Unknown=0, NotChecked=0, Total=43472 [2018-07-25 13:23:26,757 INFO L87 Difference]: Start difference. First operand 419 states and 420 transitions. Second operand 209 states. [2018-07-25 13:23:29,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:29,220 INFO L93 Difference]: Finished difference Result 425 states and 427 transitions. [2018-07-25 13:23:29,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-07-25 13:23:29,220 INFO L78 Accepts]: Start accepts. Automaton has 209 states. Word has length 418 [2018-07-25 13:23:29,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:29,221 INFO L225 Difference]: With dead ends: 425 [2018-07-25 13:23:29,221 INFO L226 Difference]: Without dead ends: 421 [2018-07-25 13:23:29,225 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21736, Invalid=21736, Unknown=0, NotChecked=0, Total=43472 [2018-07-25 13:23:29,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-07-25 13:23:29,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2018-07-25 13:23:29,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-07-25 13:23:29,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 422 transitions. [2018-07-25 13:23:29,229 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 422 transitions. Word has length 418 [2018-07-25 13:23:29,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:29,229 INFO L472 AbstractCegarLoop]: Abstraction has 421 states and 422 transitions. [2018-07-25 13:23:29,229 INFO L473 AbstractCegarLoop]: Interpolant automaton has 209 states. [2018-07-25 13:23:29,229 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 422 transitions. [2018-07-25 13:23:29,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-07-25 13:23:29,230 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:29,230 INFO L354 BasicCegarLoop]: trace histogram [208, 207, 1, 1, 1, 1, 1] [2018-07-25 13:23:29,231 INFO L415 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:29,231 INFO L82 PathProgramCache]: Analyzing trace with hash -149776257, now seen corresponding path program 207 times [2018-07-25 13:23:29,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:31,266 INFO L134 CoverageAnalysis]: Checked inductivity of 43056 backedges. 0 proven. 43056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:31,266 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:31,266 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [209] total 209 [2018-07-25 13:23:31,266 INFO L451 AbstractCegarLoop]: Interpolant automaton has 210 states [2018-07-25 13:23:31,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 210 interpolants. [2018-07-25 13:23:31,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-07-25 13:23:31,270 INFO L87 Difference]: Start difference. First operand 421 states and 422 transitions. Second operand 210 states. [2018-07-25 13:23:32,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:32,083 INFO L93 Difference]: Finished difference Result 427 states and 429 transitions. [2018-07-25 13:23:32,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-07-25 13:23:32,083 INFO L78 Accepts]: Start accepts. Automaton has 210 states. Word has length 420 [2018-07-25 13:23:32,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:32,084 INFO L225 Difference]: With dead ends: 427 [2018-07-25 13:23:32,084 INFO L226 Difference]: Without dead ends: 423 [2018-07-25 13:23:32,086 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-07-25 13:23:32,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-07-25 13:23:32,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2018-07-25 13:23:32,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-07-25 13:23:32,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 424 transitions. [2018-07-25 13:23:32,090 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 424 transitions. Word has length 420 [2018-07-25 13:23:32,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:32,090 INFO L472 AbstractCegarLoop]: Abstraction has 423 states and 424 transitions. [2018-07-25 13:23:32,090 INFO L473 AbstractCegarLoop]: Interpolant automaton has 210 states. [2018-07-25 13:23:32,090 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 424 transitions. [2018-07-25 13:23:32,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-07-25 13:23:32,091 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:32,092 INFO L354 BasicCegarLoop]: trace histogram [209, 208, 1, 1, 1, 1, 1] [2018-07-25 13:23:32,092 INFO L415 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:32,092 INFO L82 PathProgramCache]: Analyzing trace with hash 2010346875, now seen corresponding path program 208 times [2018-07-25 13:23:32,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:34,005 INFO L134 CoverageAnalysis]: Checked inductivity of 43472 backedges. 0 proven. 43472 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:34,005 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:34,005 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [210] total 210 [2018-07-25 13:23:34,006 INFO L451 AbstractCegarLoop]: Interpolant automaton has 211 states [2018-07-25 13:23:34,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 211 interpolants. [2018-07-25 13:23:34,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22155, Invalid=22155, Unknown=0, NotChecked=0, Total=44310 [2018-07-25 13:23:34,012 INFO L87 Difference]: Start difference. First operand 423 states and 424 transitions. Second operand 211 states. [2018-07-25 13:23:36,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:36,753 INFO L93 Difference]: Finished difference Result 429 states and 431 transitions. [2018-07-25 13:23:36,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2018-07-25 13:23:36,753 INFO L78 Accepts]: Start accepts. Automaton has 211 states. Word has length 422 [2018-07-25 13:23:36,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:36,754 INFO L225 Difference]: With dead ends: 429 [2018-07-25 13:23:36,754 INFO L226 Difference]: Without dead ends: 425 [2018-07-25 13:23:36,758 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=22155, Invalid=22155, Unknown=0, NotChecked=0, Total=44310 [2018-07-25 13:23:36,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-07-25 13:23:36,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2018-07-25 13:23:36,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-07-25 13:23:36,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 426 transitions. [2018-07-25 13:23:36,762 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 426 transitions. Word has length 422 [2018-07-25 13:23:36,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:36,763 INFO L472 AbstractCegarLoop]: Abstraction has 425 states and 426 transitions. [2018-07-25 13:23:36,763 INFO L473 AbstractCegarLoop]: Interpolant automaton has 211 states. [2018-07-25 13:23:36,763 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 426 transitions. [2018-07-25 13:23:36,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-07-25 13:23:36,764 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:36,764 INFO L354 BasicCegarLoop]: trace histogram [210, 209, 1, 1, 1, 1, 1] [2018-07-25 13:23:36,764 INFO L415 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:36,765 INFO L82 PathProgramCache]: Analyzing trace with hash -875494537, now seen corresponding path program 209 times [2018-07-25 13:23:36,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:38,669 INFO L134 CoverageAnalysis]: Checked inductivity of 43890 backedges. 0 proven. 43890 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:38,669 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:38,669 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [211] total 211 [2018-07-25 13:23:38,670 INFO L451 AbstractCegarLoop]: Interpolant automaton has 212 states [2018-07-25 13:23:38,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 212 interpolants. [2018-07-25 13:23:38,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-07-25 13:23:38,676 INFO L87 Difference]: Start difference. First operand 425 states and 426 transitions. Second operand 212 states. [2018-07-25 13:23:39,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:39,943 INFO L93 Difference]: Finished difference Result 431 states and 433 transitions. [2018-07-25 13:23:39,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2018-07-25 13:23:39,943 INFO L78 Accepts]: Start accepts. Automaton has 212 states. Word has length 424 [2018-07-25 13:23:39,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:39,943 INFO L225 Difference]: With dead ends: 431 [2018-07-25 13:23:39,944 INFO L226 Difference]: Without dead ends: 427 [2018-07-25 13:23:39,948 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-07-25 13:23:39,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-07-25 13:23:39,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2018-07-25 13:23:39,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-07-25 13:23:39,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 428 transitions. [2018-07-25 13:23:39,952 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 428 transitions. Word has length 424 [2018-07-25 13:23:39,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:39,952 INFO L472 AbstractCegarLoop]: Abstraction has 427 states and 428 transitions. [2018-07-25 13:23:39,953 INFO L473 AbstractCegarLoop]: Interpolant automaton has 212 states. [2018-07-25 13:23:39,953 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 428 transitions. [2018-07-25 13:23:39,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-07-25 13:23:39,954 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:39,954 INFO L354 BasicCegarLoop]: trace histogram [211, 210, 1, 1, 1, 1, 1] [2018-07-25 13:23:39,954 INFO L415 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:39,954 INFO L82 PathProgramCache]: Analyzing trace with hash 379781747, now seen corresponding path program 210 times [2018-07-25 13:23:39,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:42,130 INFO L134 CoverageAnalysis]: Checked inductivity of 44310 backedges. 0 proven. 44310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:42,131 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:42,131 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [212] total 212 [2018-07-25 13:23:42,131 INFO L451 AbstractCegarLoop]: Interpolant automaton has 213 states [2018-07-25 13:23:42,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 213 interpolants. [2018-07-25 13:23:42,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22578, Invalid=22578, Unknown=0, NotChecked=0, Total=45156 [2018-07-25 13:23:42,135 INFO L87 Difference]: Start difference. First operand 427 states and 428 transitions. Second operand 213 states. [2018-07-25 13:23:45,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:45,556 INFO L93 Difference]: Finished difference Result 433 states and 435 transitions. [2018-07-25 13:23:45,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-07-25 13:23:45,556 INFO L78 Accepts]: Start accepts. Automaton has 213 states. Word has length 426 [2018-07-25 13:23:45,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:45,557 INFO L225 Difference]: With dead ends: 433 [2018-07-25 13:23:45,557 INFO L226 Difference]: Without dead ends: 429 [2018-07-25 13:23:45,559 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=22578, Invalid=22578, Unknown=0, NotChecked=0, Total=45156 [2018-07-25 13:23:45,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-07-25 13:23:45,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2018-07-25 13:23:45,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-07-25 13:23:45,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 430 transitions. [2018-07-25 13:23:45,563 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 430 transitions. Word has length 426 [2018-07-25 13:23:45,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:45,564 INFO L472 AbstractCegarLoop]: Abstraction has 429 states and 430 transitions. [2018-07-25 13:23:45,564 INFO L473 AbstractCegarLoop]: Interpolant automaton has 213 states. [2018-07-25 13:23:45,564 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 430 transitions. [2018-07-25 13:23:45,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-07-25 13:23:45,565 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:45,565 INFO L354 BasicCegarLoop]: trace histogram [212, 211, 1, 1, 1, 1, 1] [2018-07-25 13:23:45,565 INFO L415 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:45,566 INFO L82 PathProgramCache]: Analyzing trace with hash -185519505, now seen corresponding path program 211 times [2018-07-25 13:23:45,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:47,755 INFO L134 CoverageAnalysis]: Checked inductivity of 44732 backedges. 0 proven. 44732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:47,756 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:47,756 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [213] total 213 [2018-07-25 13:23:47,756 INFO L451 AbstractCegarLoop]: Interpolant automaton has 214 states [2018-07-25 13:23:47,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 214 interpolants. [2018-07-25 13:23:47,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-07-25 13:23:47,763 INFO L87 Difference]: Start difference. First operand 429 states and 430 transitions. Second operand 214 states. [2018-07-25 13:23:48,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:48,940 INFO L93 Difference]: Finished difference Result 435 states and 437 transitions. [2018-07-25 13:23:48,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2018-07-25 13:23:48,940 INFO L78 Accepts]: Start accepts. Automaton has 214 states. Word has length 428 [2018-07-25 13:23:48,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:48,941 INFO L225 Difference]: With dead ends: 435 [2018-07-25 13:23:48,941 INFO L226 Difference]: Without dead ends: 431 [2018-07-25 13:23:48,945 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-07-25 13:23:48,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-07-25 13:23:48,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2018-07-25 13:23:48,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-07-25 13:23:48,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 432 transitions. [2018-07-25 13:23:48,949 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 432 transitions. Word has length 428 [2018-07-25 13:23:48,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:48,949 INFO L472 AbstractCegarLoop]: Abstraction has 431 states and 432 transitions. [2018-07-25 13:23:48,949 INFO L473 AbstractCegarLoop]: Interpolant automaton has 214 states. [2018-07-25 13:23:48,949 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 432 transitions. [2018-07-25 13:23:48,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-07-25 13:23:48,951 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:48,951 INFO L354 BasicCegarLoop]: trace histogram [213, 212, 1, 1, 1, 1, 1] [2018-07-25 13:23:48,951 INFO L415 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:48,951 INFO L82 PathProgramCache]: Analyzing trace with hash 2020823915, now seen corresponding path program 212 times [2018-07-25 13:23:48,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:50,833 INFO L134 CoverageAnalysis]: Checked inductivity of 45156 backedges. 0 proven. 45156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:50,834 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:50,834 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [214] total 214 [2018-07-25 13:23:50,834 INFO L451 AbstractCegarLoop]: Interpolant automaton has 215 states [2018-07-25 13:23:50,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 215 interpolants. [2018-07-25 13:23:50,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23005, Invalid=23005, Unknown=0, NotChecked=0, Total=46010 [2018-07-25 13:23:50,840 INFO L87 Difference]: Start difference. First operand 431 states and 432 transitions. Second operand 215 states. [2018-07-25 13:23:52,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:52,491 INFO L93 Difference]: Finished difference Result 437 states and 439 transitions. [2018-07-25 13:23:52,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2018-07-25 13:23:52,492 INFO L78 Accepts]: Start accepts. Automaton has 215 states. Word has length 430 [2018-07-25 13:23:52,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:52,492 INFO L225 Difference]: With dead ends: 437 [2018-07-25 13:23:52,492 INFO L226 Difference]: Without dead ends: 433 [2018-07-25 13:23:52,497 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=23005, Invalid=23005, Unknown=0, NotChecked=0, Total=46010 [2018-07-25 13:23:52,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-07-25 13:23:52,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2018-07-25 13:23:52,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-07-25 13:23:52,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 434 transitions. [2018-07-25 13:23:52,501 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 434 transitions. Word has length 430 [2018-07-25 13:23:52,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:52,501 INFO L472 AbstractCegarLoop]: Abstraction has 433 states and 434 transitions. [2018-07-25 13:23:52,501 INFO L473 AbstractCegarLoop]: Interpolant automaton has 215 states. [2018-07-25 13:23:52,501 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 434 transitions. [2018-07-25 13:23:52,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-07-25 13:23:52,503 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:52,503 INFO L354 BasicCegarLoop]: trace histogram [214, 213, 1, 1, 1, 1, 1] [2018-07-25 13:23:52,503 INFO L415 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:52,503 INFO L82 PathProgramCache]: Analyzing trace with hash 603006311, now seen corresponding path program 213 times [2018-07-25 13:23:52,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:54,588 INFO L134 CoverageAnalysis]: Checked inductivity of 45582 backedges. 0 proven. 45582 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:54,589 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:54,589 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [215] total 215 [2018-07-25 13:23:54,589 INFO L451 AbstractCegarLoop]: Interpolant automaton has 216 states [2018-07-25 13:23:54,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 216 interpolants. [2018-07-25 13:23:54,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-07-25 13:23:54,597 INFO L87 Difference]: Start difference. First operand 433 states and 434 transitions. Second operand 216 states. [2018-07-25 13:23:57,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:57,277 INFO L93 Difference]: Finished difference Result 439 states and 441 transitions. [2018-07-25 13:23:57,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-07-25 13:23:57,277 INFO L78 Accepts]: Start accepts. Automaton has 216 states. Word has length 432 [2018-07-25 13:23:57,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:57,278 INFO L225 Difference]: With dead ends: 439 [2018-07-25 13:23:57,278 INFO L226 Difference]: Without dead ends: 435 [2018-07-25 13:23:57,282 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-07-25 13:23:57,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-07-25 13:23:57,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2018-07-25 13:23:57,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-07-25 13:23:57,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 436 transitions. [2018-07-25 13:23:57,286 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 436 transitions. Word has length 432 [2018-07-25 13:23:57,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:57,286 INFO L472 AbstractCegarLoop]: Abstraction has 435 states and 436 transitions. [2018-07-25 13:23:57,286 INFO L473 AbstractCegarLoop]: Interpolant automaton has 216 states. [2018-07-25 13:23:57,286 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 436 transitions. [2018-07-25 13:23:57,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-07-25 13:23:57,288 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:57,288 INFO L354 BasicCegarLoop]: trace histogram [215, 214, 1, 1, 1, 1, 1] [2018-07-25 13:23:57,288 INFO L415 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:57,288 INFO L82 PathProgramCache]: Analyzing trace with hash -415078301, now seen corresponding path program 214 times [2018-07-25 13:23:57,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:59,432 INFO L134 CoverageAnalysis]: Checked inductivity of 46010 backedges. 0 proven. 46010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:59,432 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:59,432 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [216] total 216 [2018-07-25 13:23:59,433 INFO L451 AbstractCegarLoop]: Interpolant automaton has 217 states [2018-07-25 13:23:59,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 217 interpolants. [2018-07-25 13:23:59,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23436, Invalid=23436, Unknown=0, NotChecked=0, Total=46872 [2018-07-25 13:23:59,436 INFO L87 Difference]: Start difference. First operand 435 states and 436 transitions. Second operand 217 states. [2018-07-25 13:24:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:00,867 INFO L93 Difference]: Finished difference Result 441 states and 443 transitions. [2018-07-25 13:24:00,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 217 states. [2018-07-25 13:24:00,868 INFO L78 Accepts]: Start accepts. Automaton has 217 states. Word has length 434 [2018-07-25 13:24:00,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:00,869 INFO L225 Difference]: With dead ends: 441 [2018-07-25 13:24:00,869 INFO L226 Difference]: Without dead ends: 437 [2018-07-25 13:24:00,871 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=23436, Invalid=23436, Unknown=0, NotChecked=0, Total=46872 [2018-07-25 13:24:00,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-07-25 13:24:00,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2018-07-25 13:24:00,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-07-25 13:24:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 438 transitions. [2018-07-25 13:24:00,875 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 438 transitions. Word has length 434 [2018-07-25 13:24:00,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:00,876 INFO L472 AbstractCegarLoop]: Abstraction has 437 states and 438 transitions. [2018-07-25 13:24:00,876 INFO L473 AbstractCegarLoop]: Interpolant automaton has 217 states. [2018-07-25 13:24:00,876 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 438 transitions. [2018-07-25 13:24:00,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-07-25 13:24:00,877 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:00,877 INFO L354 BasicCegarLoop]: trace histogram [216, 215, 1, 1, 1, 1, 1] [2018-07-25 13:24:00,877 INFO L415 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:00,878 INFO L82 PathProgramCache]: Analyzing trace with hash 458153055, now seen corresponding path program 215 times [2018-07-25 13:24:00,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:03,117 INFO L134 CoverageAnalysis]: Checked inductivity of 46440 backedges. 0 proven. 46440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:03,117 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:03,117 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [217] total 217 [2018-07-25 13:24:03,117 INFO L451 AbstractCegarLoop]: Interpolant automaton has 218 states [2018-07-25 13:24:03,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 218 interpolants. [2018-07-25 13:24:03,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-07-25 13:24:03,125 INFO L87 Difference]: Start difference. First operand 437 states and 438 transitions. Second operand 218 states. [2018-07-25 13:24:05,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:05,647 INFO L93 Difference]: Finished difference Result 443 states and 445 transitions. [2018-07-25 13:24:05,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2018-07-25 13:24:05,647 INFO L78 Accepts]: Start accepts. Automaton has 218 states. Word has length 436 [2018-07-25 13:24:05,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:05,648 INFO L225 Difference]: With dead ends: 443 [2018-07-25 13:24:05,648 INFO L226 Difference]: Without dead ends: 439 [2018-07-25 13:24:05,652 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-07-25 13:24:05,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-07-25 13:24:05,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2018-07-25 13:24:05,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-07-25 13:24:05,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 440 transitions. [2018-07-25 13:24:05,657 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 440 transitions. Word has length 436 [2018-07-25 13:24:05,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:05,657 INFO L472 AbstractCegarLoop]: Abstraction has 439 states and 440 transitions. [2018-07-25 13:24:05,657 INFO L473 AbstractCegarLoop]: Interpolant automaton has 218 states. [2018-07-25 13:24:05,657 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 440 transitions. [2018-07-25 13:24:05,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-07-25 13:24:05,658 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:05,659 INFO L354 BasicCegarLoop]: trace histogram [217, 216, 1, 1, 1, 1, 1] [2018-07-25 13:24:05,659 INFO L415 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:05,659 INFO L82 PathProgramCache]: Analyzing trace with hash 2114863451, now seen corresponding path program 216 times [2018-07-25 13:24:05,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:07,733 INFO L134 CoverageAnalysis]: Checked inductivity of 46872 backedges. 0 proven. 46872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:07,734 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:07,734 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [218] total 218 [2018-07-25 13:24:07,734 INFO L451 AbstractCegarLoop]: Interpolant automaton has 219 states [2018-07-25 13:24:07,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 219 interpolants. [2018-07-25 13:24:07,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23871, Invalid=23871, Unknown=0, NotChecked=0, Total=47742 [2018-07-25 13:24:07,741 INFO L87 Difference]: Start difference. First operand 439 states and 440 transitions. Second operand 219 states. [2018-07-25 13:24:10,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:10,861 INFO L93 Difference]: Finished difference Result 445 states and 447 transitions. [2018-07-25 13:24:10,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-07-25 13:24:10,861 INFO L78 Accepts]: Start accepts. Automaton has 219 states. Word has length 438 [2018-07-25 13:24:10,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:10,862 INFO L225 Difference]: With dead ends: 445 [2018-07-25 13:24:10,862 INFO L226 Difference]: Without dead ends: 441 [2018-07-25 13:24:10,867 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=23871, Invalid=23871, Unknown=0, NotChecked=0, Total=47742 [2018-07-25 13:24:10,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-07-25 13:24:10,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2018-07-25 13:24:10,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-07-25 13:24:10,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 442 transitions. [2018-07-25 13:24:10,871 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 442 transitions. Word has length 438 [2018-07-25 13:24:10,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:10,871 INFO L472 AbstractCegarLoop]: Abstraction has 441 states and 442 transitions. [2018-07-25 13:24:10,871 INFO L473 AbstractCegarLoop]: Interpolant automaton has 219 states. [2018-07-25 13:24:10,871 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 442 transitions. [2018-07-25 13:24:10,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-07-25 13:24:10,873 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:10,873 INFO L354 BasicCegarLoop]: trace histogram [218, 217, 1, 1, 1, 1, 1] [2018-07-25 13:24:10,873 INFO L415 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:10,873 INFO L82 PathProgramCache]: Analyzing trace with hash 780687191, now seen corresponding path program 217 times [2018-07-25 13:24:10,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy Received shutdown request... [2018-07-25 13:24:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:11,747 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:215) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:919) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:262) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:193) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:204) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:210) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedRefinementStrategy.getTraceCheck(FixedRefinementStrategy.java:130) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:220) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:309) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:151) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:120) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-07-25 13:24:11,750 INFO L168 Benchmark]: Toolchain (without parser) took 261671.04 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 943.8 MB in the end (delta: 524.6 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-07-25 13:24:11,752 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.14 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:24:11,752 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.95 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:24:11,753 INFO L168 Benchmark]: Boogie Preprocessor took 25.11 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:24:11,753 INFO L168 Benchmark]: RCFGBuilder took 265.10 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:24:11,754 INFO L168 Benchmark]: TraceAbstraction took 261331.48 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 943.8 MB in the end (delta: 514.0 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-07-25 13:24:11,756 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.14 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 42.95 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.11 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 265.10 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 261331.48 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 943.8 MB in the end (delta: 514.0 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:215) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/fragtest_simple.i_4.bplTransformedIcfg_BEv2_5.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-24-11-765.csv Completed graceful shutdown