java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/functions1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-56c9370 [2018-07-23 15:24:20,060 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-23 15:24:20,064 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-23 15:24:20,079 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-23 15:24:20,080 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-23 15:24:20,081 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-23 15:24:20,082 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-23 15:24:20,084 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-23 15:24:20,086 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-23 15:24:20,086 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-23 15:24:20,087 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-23 15:24:20,088 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-23 15:24:20,089 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-23 15:24:20,089 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-23 15:24:20,091 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-23 15:24:20,091 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-23 15:24:20,092 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-23 15:24:20,094 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-23 15:24:20,096 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-23 15:24:20,098 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-23 15:24:20,099 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-23 15:24:20,101 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-23 15:24:20,103 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-23 15:24:20,103 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-23 15:24:20,103 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-23 15:24:20,104 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-23 15:24:20,105 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-23 15:24:20,106 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-23 15:24:20,107 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-23 15:24:20,108 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-23 15:24:20,109 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-23 15:24:20,109 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-23 15:24:20,110 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-23 15:24:20,110 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-23 15:24:20,111 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-23 15:24:20,112 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-23 15:24:20,112 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/AutomizerBpl-nestedInterpolants.epf [2018-07-23 15:24:20,136 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-23 15:24:20,136 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-23 15:24:20,137 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-23 15:24:20,138 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-23 15:24:20,138 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-23 15:24:20,138 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-23 15:24:20,138 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-23 15:24:20,138 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-23 15:24:20,185 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-23 15:24:20,204 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-23 15:24:20,208 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-23 15:24:20,209 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-23 15:24:20,210 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-23 15:24:20,210 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/functions1.i_3.bpl [2018-07-23 15:24:20,211 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/functions1.i_3.bpl' [2018-07-23 15:24:20,255 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-23 15:24:20,257 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-07-23 15:24:20,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-23 15:24:20,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-23 15:24:20,258 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-23 15:24:20,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:24:20" (1/1) ... [2018-07-23 15:24:20,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:24:20" (1/1) ... [2018-07-23 15:24:20,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:24:20" (1/1) ... [2018-07-23 15:24:20,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:24:20" (1/1) ... [2018-07-23 15:24:20,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:24:20" (1/1) ... [2018-07-23 15:24:20,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:24:20" (1/1) ... [2018-07-23 15:24:20,304 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:24:20" (1/1) ... [2018-07-23 15:24:20,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-23 15:24:20,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-23 15:24:20,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-23 15:24:20,307 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-23 15:24:20,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:24:20" (1/1) ... [2018-07-23 15:24:20,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-23 15:24:20,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-23 15:24:20,578 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-23 15:24:20,579 INFO L202 PluginConnector]: Adding new model functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:24:20 BoogieIcfgContainer [2018-07-23 15:24:20,579 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-23 15:24:20,581 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-23 15:24:20,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-23 15:24:20,585 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-23 15:24:20,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.07 03:24:20" (1/2) ... [2018-07-23 15:24:20,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ae0393 and model type functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 03:24:20, skipping insertion in model container [2018-07-23 15:24:20,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:24:20" (2/2) ... [2018-07-23 15:24:20,591 INFO L112 eAbstractionObserver]: Analyzing ICFG functions1.i_3.bpl [2018-07-23 15:24:20,602 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-23 15:24:20,611 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-23 15:24:20,668 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-23 15:24:20,668 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-23 15:24:20,669 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-23 15:24:20,669 INFO L375 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-23 15:24:20,669 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-23 15:24:20,669 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-23 15:24:20,670 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-23 15:24:20,670 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-23 15:24:20,670 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-23 15:24:20,686 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-23 15:24:20,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-23 15:24:20,698 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:20,700 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-23 15:24:20,700 INFO L414 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:20,708 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-07-23 15:24:20,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:20,799 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-23 15:24:20,803 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-23 15:24:20,803 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-23 15:24:20,806 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-23 15:24:20,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-23 15:24:20,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-23 15:24:20,820 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-07-23 15:24:20,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:20,860 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-07-23 15:24:20,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-23 15:24:20,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-07-23 15:24:20,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:20,879 INFO L225 Difference]: With dead ends: 10 [2018-07-23 15:24:20,880 INFO L226 Difference]: Without dead ends: 7 [2018-07-23 15:24:20,883 INFO L573 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-23 15:24:20,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-23 15:24:20,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-23 15:24:20,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-23 15:24:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-23 15:24:20,923 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-23 15:24:20,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:20,924 INFO L471 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-23 15:24:20,924 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-23 15:24:20,924 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-23 15:24:20,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-23 15:24:20,925 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:20,925 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-23 15:24:20,925 INFO L414 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:20,926 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-07-23 15:24:20,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:20,985 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-23 15:24:20,986 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:20,986 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-23 15:24:20,988 INFO L450 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-23 15:24:20,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-23 15:24:20,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:24:20,989 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-07-23 15:24:21,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:21,020 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-23 15:24:21,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-23 15:24:21,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-07-23 15:24:21,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:21,022 INFO L225 Difference]: With dead ends: 11 [2018-07-23 15:24:21,023 INFO L226 Difference]: Without dead ends: 9 [2018-07-23 15:24:21,024 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-23 15:24:21,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-23 15:24:21,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-23 15:24:21,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-23 15:24:21,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-23 15:24:21,029 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-23 15:24:21,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:21,029 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-23 15:24:21,029 INFO L472 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-23 15:24:21,029 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-23 15:24:21,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-23 15:24:21,030 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:21,030 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-23 15:24:21,030 INFO L414 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:21,031 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-07-23 15:24:21,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:21,124 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-23 15:24:21,125 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:21,125 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-23 15:24:21,125 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-23 15:24:21,126 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-23 15:24:21,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:24:21,128 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-07-23 15:24:21,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:21,175 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-23 15:24:21,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-23 15:24:21,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-07-23 15:24:21,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:21,177 INFO L225 Difference]: With dead ends: 13 [2018-07-23 15:24:21,177 INFO L226 Difference]: Without dead ends: 11 [2018-07-23 15:24:21,178 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-23 15:24:21,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-23 15:24:21,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-23 15:24:21,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-23 15:24:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-23 15:24:21,182 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-23 15:24:21,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:21,182 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-23 15:24:21,183 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-23 15:24:21,183 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-23 15:24:21,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-23 15:24:21,183 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:21,184 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-23 15:24:21,184 INFO L414 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:21,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-07-23 15:24:21,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:21,238 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-23 15:24:21,238 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:21,238 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-23 15:24:21,239 INFO L450 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-23 15:24:21,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-23 15:24:21,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 15:24:21,240 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-07-23 15:24:21,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:21,277 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-23 15:24:21,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-23 15:24:21,278 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-07-23 15:24:21,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:21,281 INFO L225 Difference]: With dead ends: 15 [2018-07-23 15:24:21,281 INFO L226 Difference]: Without dead ends: 13 [2018-07-23 15:24:21,282 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-23 15:24:21,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-23 15:24:21,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-23 15:24:21,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-23 15:24:21,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-23 15:24:21,293 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-07-23 15:24:21,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:21,293 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-23 15:24:21,294 INFO L472 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-23 15:24:21,295 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-23 15:24:21,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-23 15:24:21,295 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:21,295 INFO L353 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-07-23 15:24:21,296 INFO L414 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:21,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-07-23 15:24:21,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:21,382 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-23 15:24:21,382 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:21,383 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-23 15:24:21,383 INFO L450 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-23 15:24:21,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-23 15:24:21,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:24:21,384 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-07-23 15:24:21,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:21,424 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-23 15:24:21,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-23 15:24:21,424 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-07-23 15:24:21,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:21,425 INFO L225 Difference]: With dead ends: 17 [2018-07-23 15:24:21,426 INFO L226 Difference]: Without dead ends: 15 [2018-07-23 15:24:21,426 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-23 15:24:21,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-23 15:24:21,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-23 15:24:21,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-23 15:24:21,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-23 15:24:21,432 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-07-23 15:24:21,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:21,433 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-23 15:24:21,433 INFO L472 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-23 15:24:21,433 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-23 15:24:21,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-23 15:24:21,434 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:21,434 INFO L353 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-23 15:24:21,434 INFO L414 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:21,435 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-07-23 15:24:21,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:21,497 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-23 15:24:21,498 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:21,498 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-23 15:24:21,499 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-23 15:24:21,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-23 15:24:21,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:24:21,500 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-07-23 15:24:21,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:21,555 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-23 15:24:21,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-23 15:24:21,559 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-23 15:24:21,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:21,560 INFO L225 Difference]: With dead ends: 19 [2018-07-23 15:24:21,560 INFO L226 Difference]: Without dead ends: 17 [2018-07-23 15:24:21,562 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-23 15:24:21,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-23 15:24:21,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-23 15:24:21,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-23 15:24:21,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-23 15:24:21,576 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-07-23 15:24:21,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:21,576 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-23 15:24:21,576 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-23 15:24:21,576 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-23 15:24:21,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-23 15:24:21,577 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:21,577 INFO L353 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-07-23 15:24:21,578 INFO L414 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:21,578 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-07-23 15:24:21,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:21,686 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-23 15:24:21,687 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:21,687 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-23 15:24:21,687 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-23 15:24:21,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-23 15:24:21,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:24:21,689 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-07-23 15:24:21,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:21,778 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-23 15:24:21,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-23 15:24:21,779 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-23 15:24:21,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:21,782 INFO L225 Difference]: With dead ends: 21 [2018-07-23 15:24:21,782 INFO L226 Difference]: Without dead ends: 19 [2018-07-23 15:24:21,783 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-23 15:24:21,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-23 15:24:21,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-23 15:24:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-23 15:24:21,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-23 15:24:21,795 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-07-23 15:24:21,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:21,797 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-23 15:24:21,797 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-23 15:24:21,797 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-23 15:24:21,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-23 15:24:21,798 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:21,800 INFO L353 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-07-23 15:24:21,800 INFO L414 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:21,801 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-07-23 15:24:21,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:21,895 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-23 15:24:21,895 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:21,895 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-23 15:24:21,896 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-23 15:24:21,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-23 15:24:21,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:24:21,897 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-07-23 15:24:21,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:21,975 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-23 15:24:21,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-23 15:24:21,976 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-23 15:24:21,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:21,980 INFO L225 Difference]: With dead ends: 23 [2018-07-23 15:24:21,981 INFO L226 Difference]: Without dead ends: 21 [2018-07-23 15:24:21,982 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-23 15:24:21,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-23 15:24:21,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-23 15:24:21,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-23 15:24:21,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-23 15:24:21,995 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-07-23 15:24:21,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:21,995 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-23 15:24:21,996 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-23 15:24:21,996 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-23 15:24:21,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-23 15:24:21,997 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:21,997 INFO L353 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-07-23 15:24:21,997 INFO L414 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:21,998 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-07-23 15:24:21,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:22,092 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-23 15:24:22,092 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:22,093 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-23 15:24:22,094 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-23 15:24:22,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-23 15:24:22,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:24:22,095 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-07-23 15:24:22,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:22,154 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-23 15:24:22,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-23 15:24:22,155 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-23 15:24:22,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:22,156 INFO L225 Difference]: With dead ends: 25 [2018-07-23 15:24:22,156 INFO L226 Difference]: Without dead ends: 23 [2018-07-23 15:24:22,157 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-23 15:24:22,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-23 15:24:22,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-23 15:24:22,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-23 15:24:22,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-23 15:24:22,162 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-07-23 15:24:22,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:22,163 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-23 15:24:22,163 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-23 15:24:22,163 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-23 15:24:22,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-23 15:24:22,164 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:22,165 INFO L353 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-07-23 15:24:22,165 INFO L414 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:22,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2018-07-23 15:24:22,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:22,233 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-23 15:24:22,234 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:22,234 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-23 15:24:22,235 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-23 15:24:22,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-23 15:24:22,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:24:22,236 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2018-07-23 15:24:22,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:22,288 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-23 15:24:22,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-23 15:24:22,290 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-07-23 15:24:22,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:22,291 INFO L225 Difference]: With dead ends: 27 [2018-07-23 15:24:22,291 INFO L226 Difference]: Without dead ends: 25 [2018-07-23 15:24:22,292 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-23 15:24:22,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-23 15:24:22,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-23 15:24:22,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-23 15:24:22,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-23 15:24:22,300 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-07-23 15:24:22,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:22,300 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-23 15:24:22,300 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-23 15:24:22,300 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-23 15:24:22,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-23 15:24:22,301 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:22,301 INFO L353 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-07-23 15:24:22,302 INFO L414 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:22,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2018-07-23 15:24:22,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:22,375 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-23 15:24:22,375 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:22,376 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-23 15:24:22,376 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-23 15:24:22,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-23 15:24:22,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:24:22,377 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2018-07-23 15:24:22,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:22,434 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-23 15:24:22,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-23 15:24:22,435 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-07-23 15:24:22,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:22,436 INFO L225 Difference]: With dead ends: 29 [2018-07-23 15:24:22,436 INFO L226 Difference]: Without dead ends: 27 [2018-07-23 15:24:22,437 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-23 15:24:22,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-23 15:24:22,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-23 15:24:22,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-23 15:24:22,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-23 15:24:22,442 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-07-23 15:24:22,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:22,443 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-23 15:24:22,443 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-23 15:24:22,443 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-23 15:24:22,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-23 15:24:22,444 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:22,444 INFO L353 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-07-23 15:24:22,444 INFO L414 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:22,445 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2018-07-23 15:24:22,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:22,522 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-23 15:24:22,522 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:22,523 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-23 15:24:22,523 INFO L450 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-23 15:24:22,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-23 15:24:22,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:24:22,524 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-07-23 15:24:22,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:22,585 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-23 15:24:22,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-23 15:24:22,586 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-07-23 15:24:22,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:22,587 INFO L225 Difference]: With dead ends: 31 [2018-07-23 15:24:22,587 INFO L226 Difference]: Without dead ends: 29 [2018-07-23 15:24:22,588 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-23 15:24:22,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-23 15:24:22,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-23 15:24:22,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-23 15:24:22,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-23 15:24:22,593 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-07-23 15:24:22,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:22,594 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-23 15:24:22,594 INFO L472 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-23 15:24:22,594 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-23 15:24:22,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-23 15:24:22,595 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:22,595 INFO L353 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-07-23 15:24:22,595 INFO L414 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:22,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2018-07-23 15:24:22,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:22,681 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-23 15:24:22,682 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:22,682 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-23 15:24:22,683 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-23 15:24:22,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-23 15:24:22,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:24:22,684 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-07-23 15:24:22,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:22,755 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-23 15:24:22,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-23 15:24:22,756 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-07-23 15:24:22,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:22,756 INFO L225 Difference]: With dead ends: 33 [2018-07-23 15:24:22,757 INFO L226 Difference]: Without dead ends: 31 [2018-07-23 15:24:22,757 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-23 15:24:22,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-23 15:24:22,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-23 15:24:22,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-23 15:24:22,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-23 15:24:22,763 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-07-23 15:24:22,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:22,764 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-23 15:24:22,764 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-23 15:24:22,764 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-23 15:24:22,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-23 15:24:22,765 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:22,765 INFO L353 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-07-23 15:24:22,765 INFO L414 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:22,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2018-07-23 15:24:22,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:22,864 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-23 15:24:22,864 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:22,865 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-23 15:24:22,865 INFO L450 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-23 15:24:22,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-23 15:24:22,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:24:22,866 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-07-23 15:24:22,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:22,954 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-23 15:24:22,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-23 15:24:22,955 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-07-23 15:24:22,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:22,959 INFO L225 Difference]: With dead ends: 35 [2018-07-23 15:24:22,960 INFO L226 Difference]: Without dead ends: 33 [2018-07-23 15:24:22,963 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-23 15:24:22,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-23 15:24:22,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-23 15:24:22,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-23 15:24:22,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-23 15:24:22,971 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-07-23 15:24:22,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:22,972 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-23 15:24:22,972 INFO L472 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-23 15:24:22,972 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-23 15:24:22,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-23 15:24:22,975 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:22,975 INFO L353 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-07-23 15:24:22,975 INFO L414 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:22,976 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2018-07-23 15:24:22,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:23,122 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-23 15:24:23,122 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:23,122 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-23 15:24:23,123 INFO L450 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-23 15:24:23,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-23 15:24:23,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-23 15:24:23,124 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2018-07-23 15:24:23,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:23,224 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-23 15:24:23,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-23 15:24:23,225 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-07-23 15:24:23,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:23,226 INFO L225 Difference]: With dead ends: 37 [2018-07-23 15:24:23,226 INFO L226 Difference]: Without dead ends: 35 [2018-07-23 15:24:23,229 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-23 15:24:23,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-23 15:24:23,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-23 15:24:23,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-23 15:24:23,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-23 15:24:23,238 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-07-23 15:24:23,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:23,238 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-23 15:24:23,239 INFO L472 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-23 15:24:23,239 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-23 15:24:23,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-23 15:24:23,240 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:23,240 INFO L353 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-07-23 15:24:23,240 INFO L414 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:23,241 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2018-07-23 15:24:23,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:23,385 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-23 15:24:23,386 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:23,386 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-23 15:24:23,387 INFO L450 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-23 15:24:23,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-23 15:24:23,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-23 15:24:23,388 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2018-07-23 15:24:23,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:23,488 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-23 15:24:23,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-23 15:24:23,489 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-07-23 15:24:23,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:23,489 INFO L225 Difference]: With dead ends: 39 [2018-07-23 15:24:23,490 INFO L226 Difference]: Without dead ends: 37 [2018-07-23 15:24:23,490 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-23 15:24:23,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-23 15:24:23,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-23 15:24:23,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-23 15:24:23,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-23 15:24:23,497 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-07-23 15:24:23,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:23,497 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-23 15:24:23,497 INFO L472 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-23 15:24:23,498 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-23 15:24:23,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-23 15:24:23,498 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:23,499 INFO L353 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-07-23 15:24:23,499 INFO L414 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:23,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2018-07-23 15:24:23,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:23,638 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-23 15:24:23,638 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:23,639 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-23 15:24:23,639 INFO L450 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-23 15:24:23,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-23 15:24:23,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-23 15:24:23,640 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 19 states. [2018-07-23 15:24:23,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:23,771 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-23 15:24:23,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-23 15:24:23,771 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-07-23 15:24:23,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:23,772 INFO L225 Difference]: With dead ends: 41 [2018-07-23 15:24:23,772 INFO L226 Difference]: Without dead ends: 39 [2018-07-23 15:24:23,773 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-23 15:24:23,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-23 15:24:23,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-23 15:24:23,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-23 15:24:23,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-23 15:24:23,784 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-07-23 15:24:23,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:23,784 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-23 15:24:23,785 INFO L472 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-23 15:24:23,785 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-23 15:24:23,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-23 15:24:23,786 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:23,786 INFO L353 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-07-23 15:24:23,787 INFO L414 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:23,787 INFO L82 PathProgramCache]: Analyzing trace with hash 225377569, now seen corresponding path program 17 times [2018-07-23 15:24:23,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:23,932 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-23 15:24:23,932 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:23,932 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-23 15:24:23,933 INFO L450 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-23 15:24:23,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-23 15:24:23,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-23 15:24:23,934 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 20 states. [2018-07-23 15:24:24,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:24,073 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-23 15:24:24,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-23 15:24:24,073 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-07-23 15:24:24,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:24,074 INFO L225 Difference]: With dead ends: 43 [2018-07-23 15:24:24,076 INFO L226 Difference]: Without dead ends: 41 [2018-07-23 15:24:24,077 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-23 15:24:24,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-23 15:24:24,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-23 15:24:24,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-23 15:24:24,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-23 15:24:24,091 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-07-23 15:24:24,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:24,092 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-23 15:24:24,092 INFO L472 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-23 15:24:24,092 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-23 15:24:24,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-23 15:24:24,093 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:24,093 INFO L353 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-07-23 15:24:24,093 INFO L414 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:24,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1839531099, now seen corresponding path program 18 times [2018-07-23 15:24:24,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:24,259 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-23 15:24:24,260 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:24,260 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-23 15:24:24,261 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-23 15:24:24,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-23 15:24:24,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-23 15:24:24,262 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2018-07-23 15:24:24,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:24,410 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-23 15:24:24,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-23 15:24:24,410 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-07-23 15:24:24,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:24,411 INFO L225 Difference]: With dead ends: 45 [2018-07-23 15:24:24,411 INFO L226 Difference]: Without dead ends: 43 [2018-07-23 15:24:24,415 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-23 15:24:24,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-23 15:24:24,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-23 15:24:24,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-23 15:24:24,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-23 15:24:24,423 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-07-23 15:24:24,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:24,424 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-23 15:24:24,424 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-23 15:24:24,424 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-23 15:24:24,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-23 15:24:24,425 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:24,425 INFO L353 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-07-23 15:24:24,425 INFO L414 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:24,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1737087723, now seen corresponding path program 19 times [2018-07-23 15:24:24,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:24,618 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-23 15:24:24,619 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:24,619 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-23 15:24:24,620 INFO L450 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-23 15:24:24,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-23 15:24:24,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-23 15:24:24,624 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2018-07-23 15:24:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:24,798 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-23 15:24:24,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-23 15:24:24,799 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-07-23 15:24:24,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:24,800 INFO L225 Difference]: With dead ends: 47 [2018-07-23 15:24:24,800 INFO L226 Difference]: Without dead ends: 45 [2018-07-23 15:24:24,800 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-23 15:24:24,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-23 15:24:24,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-23 15:24:24,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-23 15:24:24,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-23 15:24:24,806 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-07-23 15:24:24,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:24,807 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-23 15:24:24,807 INFO L472 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-23 15:24:24,807 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-23 15:24:24,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-23 15:24:24,808 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:24,808 INFO L353 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-07-23 15:24:24,808 INFO L414 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:24,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1401028431, now seen corresponding path program 20 times [2018-07-23 15:24:24,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:24,965 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-23 15:24:24,966 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:24,966 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-23 15:24:24,966 INFO L450 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-23 15:24:24,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-23 15:24:24,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-23 15:24:24,967 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 23 states. [2018-07-23 15:24:25,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:25,113 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-23 15:24:25,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-23 15:24:25,113 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-07-23 15:24:25,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:25,114 INFO L225 Difference]: With dead ends: 49 [2018-07-23 15:24:25,114 INFO L226 Difference]: Without dead ends: 47 [2018-07-23 15:24:25,115 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-23 15:24:25,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-23 15:24:25,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-23 15:24:25,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-23 15:24:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-23 15:24:25,121 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-07-23 15:24:25,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:25,121 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-23 15:24:25,121 INFO L472 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-23 15:24:25,121 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-23 15:24:25,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-23 15:24:25,122 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:25,122 INFO L353 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-07-23 15:24:25,122 INFO L414 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:25,123 INFO L82 PathProgramCache]: Analyzing trace with hash 2063610633, now seen corresponding path program 21 times [2018-07-23 15:24:25,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:25,296 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-23 15:24:25,297 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:25,297 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-23 15:24:25,297 INFO L450 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-23 15:24:25,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-23 15:24:25,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-23 15:24:25,298 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 24 states. [2018-07-23 15:24:25,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:25,459 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-23 15:24:25,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-23 15:24:25,459 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-07-23 15:24:25,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:25,460 INFO L225 Difference]: With dead ends: 51 [2018-07-23 15:24:25,460 INFO L226 Difference]: Without dead ends: 49 [2018-07-23 15:24:25,461 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-23 15:24:25,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-23 15:24:25,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-23 15:24:25,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-23 15:24:25,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-23 15:24:25,468 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-07-23 15:24:25,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:25,469 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-23 15:24:25,469 INFO L472 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-23 15:24:25,469 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-23 15:24:25,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-23 15:24:25,469 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:25,469 INFO L353 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-07-23 15:24:25,470 INFO L414 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:25,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1145020349, now seen corresponding path program 22 times [2018-07-23 15:24:25,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:25,687 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-23 15:24:25,688 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:25,688 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-23 15:24:25,688 INFO L450 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-23 15:24:25,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-23 15:24:25,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-23 15:24:25,689 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 25 states. [2018-07-23 15:24:25,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:25,876 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-23 15:24:25,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-23 15:24:25,876 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-07-23 15:24:25,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:25,877 INFO L225 Difference]: With dead ends: 53 [2018-07-23 15:24:25,877 INFO L226 Difference]: Without dead ends: 51 [2018-07-23 15:24:25,879 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-23 15:24:25,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-23 15:24:25,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-23 15:24:25,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-23 15:24:25,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-23 15:24:25,893 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-07-23 15:24:25,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:25,893 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-23 15:24:25,894 INFO L472 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-23 15:24:25,894 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-23 15:24:25,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-23 15:24:25,897 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:25,897 INFO L353 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-07-23 15:24:25,898 INFO L414 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:25,898 INFO L82 PathProgramCache]: Analyzing trace with hash -852875523, now seen corresponding path program 23 times [2018-07-23 15:24:25,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:26,085 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-23 15:24:26,085 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:26,085 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-23 15:24:26,086 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-23 15:24:26,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-23 15:24:26,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-23 15:24:26,087 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 26 states. [2018-07-23 15:24:26,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:26,271 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-23 15:24:26,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-23 15:24:26,272 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-07-23 15:24:26,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:26,273 INFO L225 Difference]: With dead ends: 55 [2018-07-23 15:24:26,273 INFO L226 Difference]: Without dead ends: 53 [2018-07-23 15:24:26,273 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-23 15:24:26,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-23 15:24:26,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-23 15:24:26,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-23 15:24:26,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-23 15:24:26,279 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-07-23 15:24:26,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:26,280 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-23 15:24:26,280 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-23 15:24:26,280 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-23 15:24:26,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-23 15:24:26,280 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:26,280 INFO L353 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-07-23 15:24:26,281 INFO L414 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:26,281 INFO L82 PathProgramCache]: Analyzing trace with hash 725428023, now seen corresponding path program 24 times [2018-07-23 15:24:26,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:26,487 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-23 15:24:26,487 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:26,487 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-23 15:24:26,488 INFO L450 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-23 15:24:26,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-23 15:24:26,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-23 15:24:26,489 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 27 states. [2018-07-23 15:24:26,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:26,675 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-23 15:24:26,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-23 15:24:26,676 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-07-23 15:24:26,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:26,676 INFO L225 Difference]: With dead ends: 57 [2018-07-23 15:24:26,676 INFO L226 Difference]: Without dead ends: 55 [2018-07-23 15:24:26,677 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-23 15:24:26,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-23 15:24:26,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-23 15:24:26,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-23 15:24:26,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-23 15:24:26,692 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-07-23 15:24:26,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:26,693 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-23 15:24:26,693 INFO L472 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-23 15:24:26,693 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-23 15:24:26,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-23 15:24:26,694 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:26,694 INFO L353 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-07-23 15:24:26,694 INFO L414 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:26,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1351680241, now seen corresponding path program 25 times [2018-07-23 15:24:26,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:26,898 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-23 15:24:26,898 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:26,898 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-23 15:24:26,899 INFO L450 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-23 15:24:26,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-23 15:24:26,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-23 15:24:26,900 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 28 states. [2018-07-23 15:24:27,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:27,087 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-23 15:24:27,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-23 15:24:27,087 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-07-23 15:24:27,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:27,088 INFO L225 Difference]: With dead ends: 59 [2018-07-23 15:24:27,088 INFO L226 Difference]: Without dead ends: 57 [2018-07-23 15:24:27,089 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-23 15:24:27,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-23 15:24:27,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-23 15:24:27,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-23 15:24:27,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-23 15:24:27,094 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-07-23 15:24:27,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:27,095 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-23 15:24:27,095 INFO L472 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-23 15:24:27,095 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-23 15:24:27,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-23 15:24:27,095 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:27,096 INFO L353 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-07-23 15:24:27,096 INFO L414 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:27,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1884640299, now seen corresponding path program 26 times [2018-07-23 15:24:27,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:27,308 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-23 15:24:27,309 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:27,309 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-23 15:24:27,310 INFO L450 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-23 15:24:27,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-23 15:24:27,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-23 15:24:27,311 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 29 states. [2018-07-23 15:24:27,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:27,551 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-23 15:24:27,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-23 15:24:27,551 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-07-23 15:24:27,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:27,552 INFO L225 Difference]: With dead ends: 61 [2018-07-23 15:24:27,552 INFO L226 Difference]: Without dead ends: 59 [2018-07-23 15:24:27,553 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-23 15:24:27,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-23 15:24:27,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-23 15:24:27,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-23 15:24:27,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-23 15:24:27,565 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-07-23 15:24:27,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:27,566 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-23 15:24:27,566 INFO L472 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-23 15:24:27,566 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-23 15:24:27,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-23 15:24:27,567 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:27,567 INFO L353 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-07-23 15:24:27,567 INFO L414 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:27,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1336819483, now seen corresponding path program 27 times [2018-07-23 15:24:27,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:27,858 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-23 15:24:27,859 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:27,859 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-23 15:24:27,860 INFO L450 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-23 15:24:27,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-23 15:24:27,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-23 15:24:27,861 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 30 states. [2018-07-23 15:24:28,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:28,133 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-23 15:24:28,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-23 15:24:28,134 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-07-23 15:24:28,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:28,135 INFO L225 Difference]: With dead ends: 63 [2018-07-23 15:24:28,135 INFO L226 Difference]: Without dead ends: 61 [2018-07-23 15:24:28,136 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-23 15:24:28,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-23 15:24:28,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-23 15:24:28,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-23 15:24:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-23 15:24:28,141 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-07-23 15:24:28,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:28,141 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-23 15:24:28,141 INFO L472 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-23 15:24:28,141 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-23 15:24:28,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-23 15:24:28,143 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:28,143 INFO L353 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-07-23 15:24:28,143 INFO L414 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:28,144 INFO L82 PathProgramCache]: Analyzing trace with hash -488249569, now seen corresponding path program 28 times [2018-07-23 15:24:28,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:28,383 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-23 15:24:28,384 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:28,384 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-23 15:24:28,384 INFO L450 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-23 15:24:28,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-23 15:24:28,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-23 15:24:28,386 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 31 states. [2018-07-23 15:24:28,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:28,637 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-23 15:24:28,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-23 15:24:28,638 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-07-23 15:24:28,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:28,638 INFO L225 Difference]: With dead ends: 65 [2018-07-23 15:24:28,639 INFO L226 Difference]: Without dead ends: 63 [2018-07-23 15:24:28,639 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-23 15:24:28,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-23 15:24:28,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-23 15:24:28,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-23 15:24:28,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-23 15:24:28,647 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-07-23 15:24:28,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:28,648 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-23 15:24:28,648 INFO L472 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-23 15:24:28,648 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-23 15:24:28,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-23 15:24:28,649 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:28,649 INFO L353 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-07-23 15:24:28,649 INFO L414 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:28,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1056348455, now seen corresponding path program 29 times [2018-07-23 15:24:28,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:28,885 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-23 15:24:28,885 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:28,886 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-23 15:24:28,886 INFO L450 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-23 15:24:28,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-23 15:24:28,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-23 15:24:28,887 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 32 states. [2018-07-23 15:24:29,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:29,133 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-23 15:24:29,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-23 15:24:29,134 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-07-23 15:24:29,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:29,135 INFO L225 Difference]: With dead ends: 67 [2018-07-23 15:24:29,135 INFO L226 Difference]: Without dead ends: 65 [2018-07-23 15:24:29,136 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-23 15:24:29,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-23 15:24:29,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-23 15:24:29,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-23 15:24:29,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-23 15:24:29,144 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-07-23 15:24:29,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:29,145 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-23 15:24:29,145 INFO L472 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-23 15:24:29,145 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-23 15:24:29,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-23 15:24:29,146 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:29,146 INFO L353 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2018-07-23 15:24:29,146 INFO L414 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:29,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1538531309, now seen corresponding path program 30 times [2018-07-23 15:24:29,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:29,397 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-23 15:24:29,398 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:29,398 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-23 15:24:29,398 INFO L450 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-23 15:24:29,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-23 15:24:29,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 15:24:29,399 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 33 states. [2018-07-23 15:24:29,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:29,638 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-23 15:24:29,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-23 15:24:29,638 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-07-23 15:24:29,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:29,639 INFO L225 Difference]: With dead ends: 69 [2018-07-23 15:24:29,639 INFO L226 Difference]: Without dead ends: 67 [2018-07-23 15:24:29,640 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-23 15:24:29,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-23 15:24:29,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-23 15:24:29,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-23 15:24:29,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-23 15:24:29,644 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-07-23 15:24:29,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:29,645 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-23 15:24:29,645 INFO L472 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-23 15:24:29,645 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-23 15:24:29,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-23 15:24:29,645 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:29,646 INFO L353 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2018-07-23 15:24:29,646 INFO L414 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:29,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1059786035, now seen corresponding path program 31 times [2018-07-23 15:24:29,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:29,904 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-23 15:24:29,905 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:29,905 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-23 15:24:29,906 INFO L450 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-23 15:24:29,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-23 15:24:29,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 15:24:29,907 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 34 states. [2018-07-23 15:24:30,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:30,164 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-23 15:24:30,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-23 15:24:30,164 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-07-23 15:24:30,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:30,165 INFO L225 Difference]: With dead ends: 71 [2018-07-23 15:24:30,165 INFO L226 Difference]: Without dead ends: 69 [2018-07-23 15:24:30,166 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-23 15:24:30,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-23 15:24:30,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-23 15:24:30,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-23 15:24:30,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-23 15:24:30,172 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-07-23 15:24:30,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:30,173 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-23 15:24:30,173 INFO L472 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-23 15:24:30,173 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-23 15:24:30,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-23 15:24:30,173 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:30,174 INFO L353 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2018-07-23 15:24:30,174 INFO L414 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:30,174 INFO L82 PathProgramCache]: Analyzing trace with hash -547078393, now seen corresponding path program 32 times [2018-07-23 15:24:30,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:30,473 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-23 15:24:30,473 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:30,473 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-23 15:24:30,474 INFO L450 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-23 15:24:30,474 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-23 15:24:30,474 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 15:24:30,475 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 35 states. [2018-07-23 15:24:30,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:30,741 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-23 15:24:30,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-23 15:24:30,742 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-07-23 15:24:30,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:30,743 INFO L225 Difference]: With dead ends: 73 [2018-07-23 15:24:30,743 INFO L226 Difference]: Without dead ends: 71 [2018-07-23 15:24:30,744 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-23 15:24:30,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-23 15:24:30,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-23 15:24:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-23 15:24:30,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-23 15:24:30,749 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-07-23 15:24:30,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:30,750 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-23 15:24:30,750 INFO L472 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-23 15:24:30,750 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-23 15:24:30,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-23 15:24:30,751 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:30,751 INFO L353 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2018-07-23 15:24:30,751 INFO L414 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:30,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1756273471, now seen corresponding path program 33 times [2018-07-23 15:24:30,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:31,097 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-23 15:24:31,098 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:31,098 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-23 15:24:31,099 INFO L450 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-23 15:24:31,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-23 15:24:31,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 15:24:31,100 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 36 states. [2018-07-23 15:24:31,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:31,432 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-23 15:24:31,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-23 15:24:31,433 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-07-23 15:24:31,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:31,434 INFO L225 Difference]: With dead ends: 75 [2018-07-23 15:24:31,434 INFO L226 Difference]: Without dead ends: 73 [2018-07-23 15:24:31,435 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-23 15:24:31,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-23 15:24:31,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-23 15:24:31,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-23 15:24:31,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-23 15:24:31,441 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-07-23 15:24:31,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:31,442 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-23 15:24:31,442 INFO L472 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-23 15:24:31,442 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-23 15:24:31,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-23 15:24:31,443 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:31,443 INFO L353 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2018-07-23 15:24:31,443 INFO L414 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:31,477 INFO L82 PathProgramCache]: Analyzing trace with hash 143393787, now seen corresponding path program 34 times [2018-07-23 15:24:31,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:31,772 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-23 15:24:31,773 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:31,773 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-23 15:24:31,773 INFO L450 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-23 15:24:31,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-23 15:24:31,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 15:24:31,775 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 37 states. [2018-07-23 15:24:32,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:32,065 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-23 15:24:32,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-23 15:24:32,065 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-07-23 15:24:32,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:32,066 INFO L225 Difference]: With dead ends: 77 [2018-07-23 15:24:32,066 INFO L226 Difference]: Without dead ends: 75 [2018-07-23 15:24:32,067 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-23 15:24:32,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-23 15:24:32,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-23 15:24:32,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-23 15:24:32,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-23 15:24:32,074 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-07-23 15:24:32,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:32,075 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-23 15:24:32,075 INFO L472 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-23 15:24:32,075 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-23 15:24:32,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-23 15:24:32,075 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:32,076 INFO L353 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2018-07-23 15:24:32,076 INFO L414 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:32,076 INFO L82 PathProgramCache]: Analyzing trace with hash 362527925, now seen corresponding path program 35 times [2018-07-23 15:24:32,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:32,347 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-23 15:24:32,348 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:32,348 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-23 15:24:32,349 INFO L450 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-23 15:24:32,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-23 15:24:32,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 15:24:32,350 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 38 states. [2018-07-23 15:24:32,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:32,640 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-23 15:24:32,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-23 15:24:32,641 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-07-23 15:24:32,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:32,642 INFO L225 Difference]: With dead ends: 79 [2018-07-23 15:24:32,642 INFO L226 Difference]: Without dead ends: 77 [2018-07-23 15:24:32,643 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-23 15:24:32,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-23 15:24:32,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-23 15:24:32,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-23 15:24:32,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-23 15:24:32,648 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-07-23 15:24:32,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:32,648 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-23 15:24:32,649 INFO L472 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-23 15:24:32,649 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-23 15:24:32,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-23 15:24:32,649 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:32,649 INFO L353 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2018-07-23 15:24:32,650 INFO L414 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:32,650 INFO L82 PathProgramCache]: Analyzing trace with hash 497037039, now seen corresponding path program 36 times [2018-07-23 15:24:32,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:32,914 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-23 15:24:32,914 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:32,915 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-23 15:24:32,915 INFO L450 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-23 15:24:32,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-23 15:24:32,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 15:24:32,916 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 39 states. [2018-07-23 15:24:33,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:33,213 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-23 15:24:33,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-23 15:24:33,213 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-07-23 15:24:33,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:33,214 INFO L225 Difference]: With dead ends: 81 [2018-07-23 15:24:33,214 INFO L226 Difference]: Without dead ends: 79 [2018-07-23 15:24:33,215 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-23 15:24:33,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-23 15:24:33,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-23 15:24:33,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-23 15:24:33,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-23 15:24:33,221 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-07-23 15:24:33,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:33,221 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-23 15:24:33,221 INFO L472 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-23 15:24:33,221 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-23 15:24:33,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-23 15:24:33,222 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:33,222 INFO L353 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2018-07-23 15:24:33,222 INFO L414 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:33,223 INFO L82 PathProgramCache]: Analyzing trace with hash 911276713, now seen corresponding path program 37 times [2018-07-23 15:24:33,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:33,503 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-23 15:24:33,504 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:33,504 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-23 15:24:33,504 INFO L450 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-23 15:24:33,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-23 15:24:33,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 15:24:33,506 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 40 states. [2018-07-23 15:24:33,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:33,822 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-23 15:24:33,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-23 15:24:33,822 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-07-23 15:24:33,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:33,823 INFO L225 Difference]: With dead ends: 83 [2018-07-23 15:24:33,823 INFO L226 Difference]: Without dead ends: 81 [2018-07-23 15:24:33,824 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-23 15:24:33,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-23 15:24:33,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-23 15:24:33,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-23 15:24:33,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-23 15:24:33,830 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-07-23 15:24:33,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:33,831 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-23 15:24:33,831 INFO L472 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-23 15:24:33,831 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-23 15:24:33,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-23 15:24:33,832 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:33,832 INFO L353 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2018-07-23 15:24:33,832 INFO L414 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:33,832 INFO L82 PathProgramCache]: Analyzing trace with hash -436355101, now seen corresponding path program 38 times [2018-07-23 15:24:33,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:34,119 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-23 15:24:34,119 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:34,119 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-23 15:24:34,120 INFO L450 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-23 15:24:34,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-23 15:24:34,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 15:24:34,121 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 41 states. [2018-07-23 15:24:34,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:34,443 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-23 15:24:34,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-23 15:24:34,444 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-07-23 15:24:34,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:34,445 INFO L225 Difference]: With dead ends: 85 [2018-07-23 15:24:34,445 INFO L226 Difference]: Without dead ends: 83 [2018-07-23 15:24:34,446 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-23 15:24:34,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-23 15:24:34,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-23 15:24:34,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-23 15:24:34,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-23 15:24:34,455 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-07-23 15:24:34,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:34,455 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-23 15:24:34,455 INFO L472 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-23 15:24:34,456 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-23 15:24:34,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-23 15:24:34,456 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:34,457 INFO L353 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2018-07-23 15:24:34,457 INFO L414 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:34,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1569595037, now seen corresponding path program 39 times [2018-07-23 15:24:34,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:34,816 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-23 15:24:34,817 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:34,817 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-23 15:24:34,817 INFO L450 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-23 15:24:34,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-23 15:24:34,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-23 15:24:34,819 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 42 states. [2018-07-23 15:24:35,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:35,215 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-23 15:24:35,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-23 15:24:35,215 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-07-23 15:24:35,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:35,216 INFO L225 Difference]: With dead ends: 87 [2018-07-23 15:24:35,216 INFO L226 Difference]: Without dead ends: 85 [2018-07-23 15:24:35,217 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-23 15:24:35,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-23 15:24:35,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-23 15:24:35,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-23 15:24:35,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-23 15:24:35,223 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-07-23 15:24:35,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:35,223 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-23 15:24:35,224 INFO L472 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-23 15:24:35,224 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-23 15:24:35,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-23 15:24:35,224 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:35,225 INFO L353 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2018-07-23 15:24:35,225 INFO L414 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:35,225 INFO L82 PathProgramCache]: Analyzing trace with hash 847361751, now seen corresponding path program 40 times [2018-07-23 15:24:35,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:35,494 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-23 15:24:35,495 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:35,495 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-23 15:24:35,495 INFO L450 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-23 15:24:35,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-23 15:24:35,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 15:24:35,497 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 43 states. [2018-07-23 15:24:35,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:35,840 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-23 15:24:35,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-23 15:24:35,841 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-07-23 15:24:35,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:35,842 INFO L225 Difference]: With dead ends: 89 [2018-07-23 15:24:35,842 INFO L226 Difference]: Without dead ends: 87 [2018-07-23 15:24:35,844 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-23 15:24:35,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-23 15:24:35,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-23 15:24:35,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-23 15:24:35,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-23 15:24:35,851 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-07-23 15:24:35,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:35,851 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-23 15:24:35,851 INFO L472 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-23 15:24:35,851 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-23 15:24:35,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-23 15:24:35,852 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:35,852 INFO L353 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2018-07-23 15:24:35,852 INFO L414 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:35,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1729091439, now seen corresponding path program 41 times [2018-07-23 15:24:35,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:36,152 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-23 15:24:36,152 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:36,152 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-23 15:24:36,153 INFO L450 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-23 15:24:36,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-23 15:24:36,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 15:24:36,154 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 44 states. [2018-07-23 15:24:36,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:36,520 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-23 15:24:36,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-23 15:24:36,520 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-07-23 15:24:36,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:36,521 INFO L225 Difference]: With dead ends: 91 [2018-07-23 15:24:36,521 INFO L226 Difference]: Without dead ends: 89 [2018-07-23 15:24:36,522 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-23 15:24:36,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-23 15:24:36,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-23 15:24:36,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-23 15:24:36,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-23 15:24:36,529 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-07-23 15:24:36,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:36,529 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-23 15:24:36,529 INFO L472 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-23 15:24:36,530 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-23 15:24:36,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-23 15:24:36,530 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:36,531 INFO L353 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2018-07-23 15:24:36,531 INFO L414 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:36,531 INFO L82 PathProgramCache]: Analyzing trace with hash 495522763, now seen corresponding path program 42 times [2018-07-23 15:24:36,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:36,831 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-23 15:24:36,831 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:36,831 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-23 15:24:36,832 INFO L450 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-23 15:24:36,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-23 15:24:36,833 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 15:24:36,833 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 45 states. [2018-07-23 15:24:37,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:37,198 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-23 15:24:37,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-23 15:24:37,199 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-07-23 15:24:37,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:37,200 INFO L225 Difference]: With dead ends: 93 [2018-07-23 15:24:37,200 INFO L226 Difference]: Without dead ends: 91 [2018-07-23 15:24:37,202 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-23 15:24:37,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-23 15:24:37,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-23 15:24:37,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-23 15:24:37,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-23 15:24:37,211 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-07-23 15:24:37,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:37,212 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-23 15:24:37,212 INFO L472 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-23 15:24:37,212 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-23 15:24:37,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-23 15:24:37,213 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:37,213 INFO L353 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2018-07-23 15:24:37,213 INFO L414 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:37,214 INFO L82 PathProgramCache]: Analyzing trace with hash -543942523, now seen corresponding path program 43 times [2018-07-23 15:24:37,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:37,517 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-23 15:24:37,517 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:37,517 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-23 15:24:37,518 INFO L450 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-23 15:24:37,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-23 15:24:37,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 15:24:37,519 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 46 states. [2018-07-23 15:24:37,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:37,902 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-23 15:24:37,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-23 15:24:37,903 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-07-23 15:24:37,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:37,903 INFO L225 Difference]: With dead ends: 95 [2018-07-23 15:24:37,904 INFO L226 Difference]: Without dead ends: 93 [2018-07-23 15:24:37,904 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-23 15:24:37,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-23 15:24:37,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-23 15:24:37,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-23 15:24:37,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-23 15:24:37,912 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-07-23 15:24:37,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:37,912 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-23 15:24:37,912 INFO L472 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-23 15:24:37,912 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-23 15:24:37,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-23 15:24:37,913 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:37,913 INFO L353 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2018-07-23 15:24:37,913 INFO L414 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:37,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1257297599, now seen corresponding path program 44 times [2018-07-23 15:24:37,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:38,242 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-23 15:24:38,242 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:38,243 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-23 15:24:38,243 INFO L450 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-23 15:24:38,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-23 15:24:38,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 15:24:38,244 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 47 states. [2018-07-23 15:24:38,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:38,671 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-23 15:24:38,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-23 15:24:38,671 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-07-23 15:24:38,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:38,672 INFO L225 Difference]: With dead ends: 97 [2018-07-23 15:24:38,673 INFO L226 Difference]: Without dead ends: 95 [2018-07-23 15:24:38,673 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-23 15:24:38,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-23 15:24:38,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-23 15:24:38,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-23 15:24:38,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-23 15:24:38,682 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-07-23 15:24:38,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:38,682 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-23 15:24:38,682 INFO L472 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-23 15:24:38,682 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-23 15:24:38,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-23 15:24:38,683 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:38,683 INFO L353 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2018-07-23 15:24:38,684 INFO L414 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:38,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1377234553, now seen corresponding path program 45 times [2018-07-23 15:24:38,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:39,018 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-23 15:24:39,019 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:39,019 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-23 15:24:39,019 INFO L450 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-23 15:24:39,020 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-23 15:24:39,020 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 15:24:39,020 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 48 states. [2018-07-23 15:24:39,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:39,408 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-23 15:24:39,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-23 15:24:39,408 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-07-23 15:24:39,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:39,409 INFO L225 Difference]: With dead ends: 99 [2018-07-23 15:24:39,409 INFO L226 Difference]: Without dead ends: 97 [2018-07-23 15:24:39,411 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-23 15:24:39,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-23 15:24:39,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-23 15:24:39,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-23 15:24:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-23 15:24:39,419 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-07-23 15:24:39,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:39,419 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-23 15:24:39,419 INFO L472 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-23 15:24:39,419 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-23 15:24:39,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-23 15:24:39,420 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:39,421 INFO L353 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2018-07-23 15:24:39,421 INFO L414 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:39,421 INFO L82 PathProgramCache]: Analyzing trace with hash 672530355, now seen corresponding path program 46 times [2018-07-23 15:24:39,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:39,731 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-23 15:24:39,731 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:39,731 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-23 15:24:39,732 INFO L450 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-23 15:24:39,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-23 15:24:39,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 15:24:39,733 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 49 states. [2018-07-23 15:24:40,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:40,134 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-23 15:24:40,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-23 15:24:40,135 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-07-23 15:24:40,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:40,136 INFO L225 Difference]: With dead ends: 101 [2018-07-23 15:24:40,136 INFO L226 Difference]: Without dead ends: 99 [2018-07-23 15:24:40,137 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-23 15:24:40,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-23 15:24:40,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-23 15:24:40,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-23 15:24:40,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-23 15:24:40,145 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-07-23 15:24:40,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:40,145 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-23 15:24:40,145 INFO L472 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-23 15:24:40,145 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-23 15:24:40,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-23 15:24:40,146 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:40,146 INFO L353 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2018-07-23 15:24:40,146 INFO L414 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:40,147 INFO L82 PathProgramCache]: Analyzing trace with hash 2056628845, now seen corresponding path program 47 times [2018-07-23 15:24:40,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:40,468 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-23 15:24:40,469 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:40,469 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-23 15:24:40,469 INFO L450 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-23 15:24:40,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-23 15:24:40,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 15:24:40,471 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 50 states. [2018-07-23 15:24:40,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:40,875 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-23 15:24:40,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-23 15:24:40,875 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-07-23 15:24:40,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:40,876 INFO L225 Difference]: With dead ends: 103 [2018-07-23 15:24:40,877 INFO L226 Difference]: Without dead ends: 101 [2018-07-23 15:24:40,877 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-23 15:24:40,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-23 15:24:40,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-23 15:24:40,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-23 15:24:40,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-23 15:24:40,889 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-07-23 15:24:40,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:40,889 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-23 15:24:40,889 INFO L472 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-23 15:24:40,889 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-23 15:24:40,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-23 15:24:40,890 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:40,891 INFO L353 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2018-07-23 15:24:40,891 INFO L414 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:40,891 INFO L82 PathProgramCache]: Analyzing trace with hash 735415975, now seen corresponding path program 48 times [2018-07-23 15:24:40,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:41,233 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-23 15:24:41,233 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:41,233 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-23 15:24:41,234 INFO L450 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-23 15:24:41,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-23 15:24:41,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 15:24:41,235 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 51 states. [2018-07-23 15:24:41,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:41,694 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-23 15:24:41,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-23 15:24:41,694 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-07-23 15:24:41,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:41,695 INFO L225 Difference]: With dead ends: 105 [2018-07-23 15:24:41,695 INFO L226 Difference]: Without dead ends: 103 [2018-07-23 15:24:41,696 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-23 15:24:41,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-23 15:24:41,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-23 15:24:41,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-23 15:24:41,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-23 15:24:41,705 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-07-23 15:24:41,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:41,705 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-23 15:24:41,705 INFO L472 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-23 15:24:41,706 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-23 15:24:41,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-23 15:24:41,707 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:41,707 INFO L353 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2018-07-23 15:24:41,707 INFO L414 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:41,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1934799775, now seen corresponding path program 49 times [2018-07-23 15:24:41,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:42,093 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-23 15:24:42,093 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:42,093 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-23 15:24:42,094 INFO L450 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-23 15:24:42,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-23 15:24:42,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 15:24:42,095 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 52 states. [2018-07-23 15:24:42,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:42,516 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-23 15:24:42,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-23 15:24:42,517 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-07-23 15:24:42,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:42,518 INFO L225 Difference]: With dead ends: 107 [2018-07-23 15:24:42,518 INFO L226 Difference]: Without dead ends: 105 [2018-07-23 15:24:42,519 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-23 15:24:42,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-23 15:24:42,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-23 15:24:42,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-23 15:24:42,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-23 15:24:42,526 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-07-23 15:24:42,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:42,527 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-23 15:24:42,527 INFO L472 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-23 15:24:42,527 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-23 15:24:42,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-23 15:24:42,528 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:42,528 INFO L353 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2018-07-23 15:24:42,528 INFO L414 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:42,528 INFO L82 PathProgramCache]: Analyzing trace with hash 378307483, now seen corresponding path program 50 times [2018-07-23 15:24:42,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:42,848 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-23 15:24:42,848 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:42,848 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-23 15:24:42,849 INFO L450 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-23 15:24:42,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-23 15:24:42,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 15:24:42,850 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 53 states. [2018-07-23 15:24:43,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:43,261 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-07-23 15:24:43,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-23 15:24:43,262 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-07-23 15:24:43,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:43,263 INFO L225 Difference]: With dead ends: 109 [2018-07-23 15:24:43,263 INFO L226 Difference]: Without dead ends: 107 [2018-07-23 15:24:43,264 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-23 15:24:43,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-23 15:24:43,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-07-23 15:24:43,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-23 15:24:43,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-07-23 15:24:43,275 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-07-23 15:24:43,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:43,275 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-07-23 15:24:43,275 INFO L472 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-23 15:24:43,275 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-07-23 15:24:43,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-23 15:24:43,277 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:43,278 INFO L353 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2018-07-23 15:24:43,278 INFO L414 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:43,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1518676907, now seen corresponding path program 51 times [2018-07-23 15:24:43,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:43,594 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-23 15:24:43,595 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:43,595 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-23 15:24:43,595 INFO L450 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-23 15:24:43,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-23 15:24:43,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 15:24:43,596 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 54 states. [2018-07-23 15:24:44,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:44,038 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-07-23 15:24:44,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-23 15:24:44,038 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-07-23 15:24:44,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:44,039 INFO L225 Difference]: With dead ends: 111 [2018-07-23 15:24:44,039 INFO L226 Difference]: Without dead ends: 109 [2018-07-23 15:24:44,041 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-23 15:24:44,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-23 15:24:44,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-07-23 15:24:44,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-23 15:24:44,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-07-23 15:24:44,050 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-07-23 15:24:44,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:44,051 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-07-23 15:24:44,051 INFO L472 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-23 15:24:44,051 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-07-23 15:24:44,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-23 15:24:44,052 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:44,052 INFO L353 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2018-07-23 15:24:44,052 INFO L414 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:44,052 INFO L82 PathProgramCache]: Analyzing trace with hash 840425103, now seen corresponding path program 52 times [2018-07-23 15:24:44,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:44,401 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-23 15:24:44,402 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:44,402 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-23 15:24:44,402 INFO L450 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-23 15:24:44,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-23 15:24:44,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 15:24:44,404 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 55 states. [2018-07-23 15:24:44,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:44,846 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-07-23 15:24:44,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-23 15:24:44,847 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-07-23 15:24:44,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:44,848 INFO L225 Difference]: With dead ends: 113 [2018-07-23 15:24:44,848 INFO L226 Difference]: Without dead ends: 111 [2018-07-23 15:24:44,849 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-23 15:24:44,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-23 15:24:44,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-07-23 15:24:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-23 15:24:44,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-07-23 15:24:44,856 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2018-07-23 15:24:44,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:44,856 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-07-23 15:24:44,857 INFO L472 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-23 15:24:44,857 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-07-23 15:24:44,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-23 15:24:44,858 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:44,858 INFO L353 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2018-07-23 15:24:44,858 INFO L414 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:44,858 INFO L82 PathProgramCache]: Analyzing trace with hash 194724425, now seen corresponding path program 53 times [2018-07-23 15:24:44,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:45,232 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-23 15:24:45,232 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:45,233 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-23 15:24:45,233 INFO L450 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-23 15:24:45,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-23 15:24:45,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 15:24:45,234 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 56 states. [2018-07-23 15:24:45,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:45,675 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-07-23 15:24:45,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-23 15:24:45,675 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-07-23 15:24:45,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:45,676 INFO L225 Difference]: With dead ends: 115 [2018-07-23 15:24:45,677 INFO L226 Difference]: Without dead ends: 113 [2018-07-23 15:24:45,677 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-23 15:24:45,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-23 15:24:45,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-07-23 15:24:45,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-23 15:24:45,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-07-23 15:24:45,685 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2018-07-23 15:24:45,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:45,686 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-07-23 15:24:45,686 INFO L472 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-23 15:24:45,686 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-07-23 15:24:45,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-23 15:24:45,687 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:45,687 INFO L353 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2018-07-23 15:24:45,687 INFO L414 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:45,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1848336509, now seen corresponding path program 54 times [2018-07-23 15:24:45,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:46,037 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-23 15:24:46,037 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:46,037 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-23 15:24:46,038 INFO L450 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-23 15:24:46,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-23 15:24:46,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 15:24:46,040 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 57 states. [2018-07-23 15:24:46,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:46,488 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-07-23 15:24:46,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-23 15:24:46,489 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-07-23 15:24:46,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:46,491 INFO L225 Difference]: With dead ends: 117 [2018-07-23 15:24:46,491 INFO L226 Difference]: Without dead ends: 115 [2018-07-23 15:24:46,492 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-23 15:24:46,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-23 15:24:46,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-07-23 15:24:46,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-23 15:24:46,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-07-23 15:24:46,499 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2018-07-23 15:24:46,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:46,500 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-07-23 15:24:46,500 INFO L472 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-23 15:24:46,500 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-07-23 15:24:46,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-23 15:24:46,501 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:46,501 INFO L353 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2018-07-23 15:24:46,501 INFO L414 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:46,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1865127485, now seen corresponding path program 55 times [2018-07-23 15:24:46,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:46,856 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-23 15:24:46,861 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:46,861 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-23 15:24:46,862 INFO L450 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-23 15:24:46,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-23 15:24:46,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 15:24:46,863 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 58 states. [2018-07-23 15:24:47,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:47,318 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-07-23 15:24:47,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-23 15:24:47,318 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-07-23 15:24:47,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:47,319 INFO L225 Difference]: With dead ends: 119 [2018-07-23 15:24:47,319 INFO L226 Difference]: Without dead ends: 117 [2018-07-23 15:24:47,320 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-23 15:24:47,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-07-23 15:24:47,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-07-23 15:24:47,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-23 15:24:47,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-07-23 15:24:47,327 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2018-07-23 15:24:47,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:47,327 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-07-23 15:24:47,328 INFO L472 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-23 15:24:47,328 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-07-23 15:24:47,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-23 15:24:47,329 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:47,329 INFO L353 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2018-07-23 15:24:47,329 INFO L414 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:47,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1386202743, now seen corresponding path program 56 times [2018-07-23 15:24:47,329 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:47,705 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-23 15:24:47,708 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:47,709 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-23 15:24:47,709 INFO L450 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-23 15:24:47,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-23 15:24:47,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 15:24:47,710 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 59 states. [2018-07-23 15:24:48,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:48,225 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-07-23 15:24:48,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-23 15:24:48,226 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2018-07-23 15:24:48,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:48,227 INFO L225 Difference]: With dead ends: 121 [2018-07-23 15:24:48,227 INFO L226 Difference]: Without dead ends: 119 [2018-07-23 15:24:48,228 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-23 15:24:48,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-23 15:24:48,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-23 15:24:48,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-23 15:24:48,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-07-23 15:24:48,238 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2018-07-23 15:24:48,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:48,238 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-07-23 15:24:48,238 INFO L472 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-23 15:24:48,238 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-07-23 15:24:48,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-23 15:24:48,239 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:48,240 INFO L353 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2018-07-23 15:24:48,240 INFO L414 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:48,240 INFO L82 PathProgramCache]: Analyzing trace with hash 701026353, now seen corresponding path program 57 times [2018-07-23 15:24:48,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:48,728 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-23 15:24:48,729 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:48,729 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-23 15:24:48,729 INFO L450 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-23 15:24:48,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-23 15:24:48,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 15:24:48,730 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 60 states. [2018-07-23 15:24:49,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:49,197 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-07-23 15:24:49,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-23 15:24:49,197 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-07-23 15:24:49,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:49,198 INFO L225 Difference]: With dead ends: 123 [2018-07-23 15:24:49,199 INFO L226 Difference]: Without dead ends: 121 [2018-07-23 15:24:49,199 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-23 15:24:49,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-23 15:24:49,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-07-23 15:24:49,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-23 15:24:49,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-07-23 15:24:49,207 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2018-07-23 15:24:49,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:49,207 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-07-23 15:24:49,207 INFO L472 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-23 15:24:49,208 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-07-23 15:24:49,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-23 15:24:49,209 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:49,209 INFO L353 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2018-07-23 15:24:49,209 INFO L414 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:49,209 INFO L82 PathProgramCache]: Analyzing trace with hash -623488149, now seen corresponding path program 58 times [2018-07-23 15:24:49,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:49,572 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-23 15:24:49,572 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:49,572 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-23 15:24:49,572 INFO L450 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-23 15:24:49,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-23 15:24:49,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 15:24:49,574 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 61 states. [2018-07-23 15:24:50,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:50,015 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-07-23 15:24:50,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-23 15:24:50,015 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-07-23 15:24:50,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:50,016 INFO L225 Difference]: With dead ends: 125 [2018-07-23 15:24:50,016 INFO L226 Difference]: Without dead ends: 123 [2018-07-23 15:24:50,017 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-23 15:24:50,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-23 15:24:50,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-07-23 15:24:50,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-07-23 15:24:50,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-07-23 15:24:50,025 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2018-07-23 15:24:50,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:50,025 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-07-23 15:24:50,025 INFO L472 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-23 15:24:50,025 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-07-23 15:24:50,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-23 15:24:50,026 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:50,026 INFO L353 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2018-07-23 15:24:50,027 INFO L414 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:50,027 INFO L82 PathProgramCache]: Analyzing trace with hash 2123362341, now seen corresponding path program 59 times [2018-07-23 15:24:50,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:50,378 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-23 15:24:50,379 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:50,379 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-23 15:24:50,379 INFO L450 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-23 15:24:50,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-23 15:24:50,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 15:24:50,380 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 62 states. [2018-07-23 15:24:50,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:50,905 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-07-23 15:24:50,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-23 15:24:50,905 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-07-23 15:24:50,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:50,906 INFO L225 Difference]: With dead ends: 127 [2018-07-23 15:24:50,906 INFO L226 Difference]: Without dead ends: 125 [2018-07-23 15:24:50,908 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-23 15:24:50,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-23 15:24:50,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-07-23 15:24:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-23 15:24:50,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-07-23 15:24:50,916 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2018-07-23 15:24:50,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:50,916 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-07-23 15:24:50,916 INFO L472 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-23 15:24:50,916 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-07-23 15:24:50,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-23 15:24:50,917 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:50,917 INFO L353 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2018-07-23 15:24:50,917 INFO L414 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:50,918 INFO L82 PathProgramCache]: Analyzing trace with hash 441796191, now seen corresponding path program 60 times [2018-07-23 15:24:50,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:51,343 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-23 15:24:51,343 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:51,343 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-23 15:24:51,344 INFO L450 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-23 15:24:51,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-23 15:24:51,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 15:24:51,345 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 63 states. [2018-07-23 15:24:51,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:51,887 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-07-23 15:24:51,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-23 15:24:51,887 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-07-23 15:24:51,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:51,888 INFO L225 Difference]: With dead ends: 129 [2018-07-23 15:24:51,889 INFO L226 Difference]: Without dead ends: 127 [2018-07-23 15:24:51,890 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-23 15:24:51,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-23 15:24:51,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-07-23 15:24:51,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-23 15:24:51,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-07-23 15:24:51,897 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2018-07-23 15:24:51,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:51,898 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-07-23 15:24:51,898 INFO L472 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-23 15:24:51,898 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-07-23 15:24:51,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-23 15:24:51,899 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:51,899 INFO L353 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2018-07-23 15:24:51,899 INFO L414 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:51,899 INFO L82 PathProgramCache]: Analyzing trace with hash -635570663, now seen corresponding path program 61 times [2018-07-23 15:24:51,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:52,339 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-23 15:24:52,340 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:52,340 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-23 15:24:52,340 INFO L450 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-23 15:24:52,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-23 15:24:52,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 15:24:52,342 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 64 states. [2018-07-23 15:24:52,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:52,874 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-07-23 15:24:52,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-23 15:24:52,874 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-07-23 15:24:52,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:52,876 INFO L225 Difference]: With dead ends: 131 [2018-07-23 15:24:52,876 INFO L226 Difference]: Without dead ends: 129 [2018-07-23 15:24:52,877 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-23 15:24:52,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-23 15:24:52,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-07-23 15:24:52,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-23 15:24:52,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-07-23 15:24:52,884 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2018-07-23 15:24:52,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:52,884 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-07-23 15:24:52,884 INFO L472 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-23 15:24:52,884 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-07-23 15:24:52,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-23 15:24:52,885 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:52,885 INFO L353 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2018-07-23 15:24:52,885 INFO L414 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:52,886 INFO L82 PathProgramCache]: Analyzing trace with hash -897999021, now seen corresponding path program 62 times [2018-07-23 15:24:52,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:53,327 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-23 15:24:53,327 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:53,328 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-23 15:24:53,328 INFO L450 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-23 15:24:53,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-23 15:24:53,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 15:24:53,329 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 65 states. [2018-07-23 15:24:53,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:53,898 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-07-23 15:24:53,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-23 15:24:53,899 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-07-23 15:24:53,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:53,900 INFO L225 Difference]: With dead ends: 133 [2018-07-23 15:24:53,900 INFO L226 Difference]: Without dead ends: 131 [2018-07-23 15:24:53,901 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-23 15:24:53,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-23 15:24:53,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-07-23 15:24:53,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-23 15:24:53,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-07-23 15:24:53,910 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2018-07-23 15:24:53,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:53,911 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-07-23 15:24:53,911 INFO L472 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-23 15:24:53,911 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-07-23 15:24:53,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-23 15:24:53,912 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:53,912 INFO L353 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2018-07-23 15:24:53,912 INFO L414 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:53,913 INFO L82 PathProgramCache]: Analyzing trace with hash 311419405, now seen corresponding path program 63 times [2018-07-23 15:24:53,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:54,378 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-23 15:24:54,379 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:54,379 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-23 15:24:54,381 INFO L450 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-23 15:24:54,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-23 15:24:54,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 15:24:54,386 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 66 states. [2018-07-23 15:24:54,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:54,964 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-23 15:24:54,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-23 15:24:54,965 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-07-23 15:24:54,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:54,966 INFO L225 Difference]: With dead ends: 135 [2018-07-23 15:24:54,966 INFO L226 Difference]: Without dead ends: 133 [2018-07-23 15:24:54,971 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-23 15:24:54,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-23 15:24:54,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-07-23 15:24:54,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-23 15:24:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-07-23 15:24:54,981 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2018-07-23 15:24:54,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:54,982 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-07-23 15:24:54,982 INFO L472 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-23 15:24:54,982 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-07-23 15:24:54,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-23 15:24:54,983 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:54,983 INFO L353 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2018-07-23 15:24:54,983 INFO L414 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:54,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1373610425, now seen corresponding path program 64 times [2018-07-23 15:24:54,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:55,445 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-23 15:24:55,445 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:55,445 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-23 15:24:55,446 INFO L450 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-23 15:24:55,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-23 15:24:55,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 15:24:55,447 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 67 states. [2018-07-23 15:24:55,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:55,894 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-07-23 15:24:55,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-23 15:24:55,895 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-07-23 15:24:55,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:55,896 INFO L225 Difference]: With dead ends: 137 [2018-07-23 15:24:55,896 INFO L226 Difference]: Without dead ends: 135 [2018-07-23 15:24:55,897 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-23 15:24:55,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-23 15:24:55,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-07-23 15:24:55,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-07-23 15:24:55,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-07-23 15:24:55,904 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2018-07-23 15:24:55,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:55,905 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-07-23 15:24:55,905 INFO L472 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-23 15:24:55,905 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-07-23 15:24:55,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-23 15:24:55,906 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:55,906 INFO L353 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2018-07-23 15:24:55,906 INFO L414 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:55,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1484606463, now seen corresponding path program 65 times [2018-07-23 15:24:55,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:56,307 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-23 15:24:56,307 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:56,307 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-23 15:24:56,308 INFO L450 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-23 15:24:56,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-23 15:24:56,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 15:24:56,308 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 68 states. [2018-07-23 15:24:56,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:56,722 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-07-23 15:24:56,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-23 15:24:56,722 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-07-23 15:24:56,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:56,723 INFO L225 Difference]: With dead ends: 139 [2018-07-23 15:24:56,723 INFO L226 Difference]: Without dead ends: 137 [2018-07-23 15:24:56,724 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-23 15:24:56,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-23 15:24:56,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-07-23 15:24:56,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-23 15:24:56,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-07-23 15:24:56,734 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2018-07-23 15:24:56,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:56,734 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-07-23 15:24:56,734 INFO L472 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-23 15:24:56,735 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-07-23 15:24:56,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-23 15:24:56,735 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:56,735 INFO L353 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2018-07-23 15:24:56,736 INFO L414 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:56,736 INFO L82 PathProgramCache]: Analyzing trace with hash -777616581, now seen corresponding path program 66 times [2018-07-23 15:24:56,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:57,105 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-23 15:24:57,106 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:57,106 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-23 15:24:57,106 INFO L450 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-23 15:24:57,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-23 15:24:57,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 15:24:57,107 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 69 states. [2018-07-23 15:24:57,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:57,529 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-07-23 15:24:57,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-23 15:24:57,529 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-07-23 15:24:57,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:57,530 INFO L225 Difference]: With dead ends: 141 [2018-07-23 15:24:57,530 INFO L226 Difference]: Without dead ends: 139 [2018-07-23 15:24:57,531 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-23 15:24:57,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-23 15:24:57,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-07-23 15:24:57,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-07-23 15:24:57,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-07-23 15:24:57,539 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2018-07-23 15:24:57,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:57,539 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-07-23 15:24:57,539 INFO L472 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-23 15:24:57,539 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-07-23 15:24:57,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-23 15:24:57,540 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:57,540 INFO L353 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2018-07-23 15:24:57,540 INFO L414 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:57,541 INFO L82 PathProgramCache]: Analyzing trace with hash 34827253, now seen corresponding path program 67 times [2018-07-23 15:24:57,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:58,013 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-23 15:24:58,013 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:58,014 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-23 15:24:58,014 INFO L450 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-23 15:24:58,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-23 15:24:58,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 15:24:58,015 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 70 states. [2018-07-23 15:24:58,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:58,488 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-07-23 15:24:58,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-23 15:24:58,489 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-07-23 15:24:58,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:58,490 INFO L225 Difference]: With dead ends: 143 [2018-07-23 15:24:58,490 INFO L226 Difference]: Without dead ends: 141 [2018-07-23 15:24:58,490 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-23 15:24:58,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-23 15:24:58,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-07-23 15:24:58,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-23 15:24:58,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-07-23 15:24:58,505 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2018-07-23 15:24:58,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:58,506 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-07-23 15:24:58,506 INFO L472 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-23 15:24:58,506 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-07-23 15:24:58,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-23 15:24:58,506 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:58,507 INFO L353 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2018-07-23 15:24:58,507 INFO L414 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:58,507 INFO L82 PathProgramCache]: Analyzing trace with hash -890696145, now seen corresponding path program 68 times [2018-07-23 15:24:58,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:58,979 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-23 15:24:58,979 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:58,980 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-23 15:24:58,980 INFO L450 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-23 15:24:58,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-23 15:24:58,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 15:24:58,981 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 71 states. [2018-07-23 15:24:59,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:24:59,399 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-07-23 15:24:59,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-23 15:24:59,399 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2018-07-23 15:24:59,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:24:59,400 INFO L225 Difference]: With dead ends: 145 [2018-07-23 15:24:59,400 INFO L226 Difference]: Without dead ends: 143 [2018-07-23 15:24:59,401 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-23 15:24:59,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-23 15:24:59,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-07-23 15:24:59,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-23 15:24:59,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-07-23 15:24:59,410 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2018-07-23 15:24:59,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:24:59,410 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-07-23 15:24:59,410 INFO L472 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-23 15:24:59,410 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-07-23 15:24:59,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-23 15:24:59,411 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:24:59,412 INFO L353 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1] [2018-07-23 15:24:59,412 INFO L414 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:24:59,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1260451351, now seen corresponding path program 69 times [2018-07-23 15:24:59,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:24:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:24:59,780 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-23 15:24:59,781 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:24:59,781 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-23 15:24:59,781 INFO L450 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-23 15:24:59,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-23 15:24:59,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 15:24:59,782 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 72 states. [2018-07-23 15:25:00,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:00,238 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-07-23 15:25:00,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-23 15:25:00,238 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-07-23 15:25:00,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:00,239 INFO L225 Difference]: With dead ends: 147 [2018-07-23 15:25:00,240 INFO L226 Difference]: Without dead ends: 145 [2018-07-23 15:25:00,240 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-23 15:25:00,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-23 15:25:00,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-07-23 15:25:00,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-23 15:25:00,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-07-23 15:25:00,248 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2018-07-23 15:25:00,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:00,249 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-07-23 15:25:00,249 INFO L472 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-23 15:25:00,249 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-07-23 15:25:00,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-23 15:25:00,250 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:00,250 INFO L353 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1] [2018-07-23 15:25:00,250 INFO L414 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:00,250 INFO L82 PathProgramCache]: Analyzing trace with hash -112918749, now seen corresponding path program 70 times [2018-07-23 15:25:00,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:00,714 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-23 15:25:00,714 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:00,714 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-23 15:25:00,715 INFO L450 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-23 15:25:00,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-23 15:25:00,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 15:25:00,716 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 73 states. [2018-07-23 15:25:01,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:01,169 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-07-23 15:25:01,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-23 15:25:01,170 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-07-23 15:25:01,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:01,171 INFO L225 Difference]: With dead ends: 149 [2018-07-23 15:25:01,171 INFO L226 Difference]: Without dead ends: 147 [2018-07-23 15:25:01,172 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-23 15:25:01,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-23 15:25:01,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-07-23 15:25:01,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-23 15:25:01,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-07-23 15:25:01,182 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2018-07-23 15:25:01,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:01,182 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-07-23 15:25:01,182 INFO L472 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-23 15:25:01,183 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-07-23 15:25:01,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-23 15:25:01,183 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:01,184 INFO L353 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1] [2018-07-23 15:25:01,184 INFO L414 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:01,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1140683299, now seen corresponding path program 71 times [2018-07-23 15:25:01,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:01,645 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-23 15:25:01,645 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:01,646 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-23 15:25:01,646 INFO L450 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-23 15:25:01,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-23 15:25:01,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 15:25:01,647 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 74 states. [2018-07-23 15:25:02,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:02,096 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-07-23 15:25:02,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-23 15:25:02,096 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-07-23 15:25:02,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:02,097 INFO L225 Difference]: With dead ends: 151 [2018-07-23 15:25:02,098 INFO L226 Difference]: Without dead ends: 149 [2018-07-23 15:25:02,098 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-23 15:25:02,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-23 15:25:02,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-07-23 15:25:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-23 15:25:02,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-07-23 15:25:02,104 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2018-07-23 15:25:02,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:02,104 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-07-23 15:25:02,104 INFO L472 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-23 15:25:02,105 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-07-23 15:25:02,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-23 15:25:02,105 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:02,105 INFO L353 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1] [2018-07-23 15:25:02,105 INFO L414 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:02,106 INFO L82 PathProgramCache]: Analyzing trace with hash -979937769, now seen corresponding path program 72 times [2018-07-23 15:25:02,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:02,532 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-23 15:25:02,532 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:02,532 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-23 15:25:02,533 INFO L450 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-23 15:25:02,533 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-23 15:25:02,533 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 15:25:02,533 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 75 states. [2018-07-23 15:25:03,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:03,032 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-07-23 15:25:03,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-23 15:25:03,033 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-07-23 15:25:03,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:03,034 INFO L225 Difference]: With dead ends: 153 [2018-07-23 15:25:03,034 INFO L226 Difference]: Without dead ends: 151 [2018-07-23 15:25:03,035 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-23 15:25:03,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-23 15:25:03,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-07-23 15:25:03,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-23 15:25:03,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-07-23 15:25:03,043 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2018-07-23 15:25:03,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:03,044 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-07-23 15:25:03,044 INFO L472 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-23 15:25:03,044 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-07-23 15:25:03,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-23 15:25:03,045 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:03,045 INFO L353 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1] [2018-07-23 15:25:03,045 INFO L414 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:03,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1122306095, now seen corresponding path program 73 times [2018-07-23 15:25:03,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:03,448 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-23 15:25:03,448 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:03,449 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-23 15:25:03,449 INFO L450 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-23 15:25:03,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-23 15:25:03,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 15:25:03,450 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 76 states. [2018-07-23 15:25:03,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:03,934 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-07-23 15:25:03,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-23 15:25:03,934 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-07-23 15:25:03,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:03,935 INFO L225 Difference]: With dead ends: 155 [2018-07-23 15:25:03,935 INFO L226 Difference]: Without dead ends: 153 [2018-07-23 15:25:03,936 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-23 15:25:03,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-23 15:25:03,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-07-23 15:25:03,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-23 15:25:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-07-23 15:25:03,943 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2018-07-23 15:25:03,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:03,943 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-07-23 15:25:03,943 INFO L472 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-23 15:25:03,944 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-07-23 15:25:03,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-23 15:25:03,944 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:03,944 INFO L353 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1] [2018-07-23 15:25:03,945 INFO L414 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:03,945 INFO L82 PathProgramCache]: Analyzing trace with hash -499313909, now seen corresponding path program 74 times [2018-07-23 15:25:03,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:04,350 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-23 15:25:04,351 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:04,351 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-23 15:25:04,351 INFO L450 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-23 15:25:04,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-23 15:25:04,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 15:25:04,352 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 77 states. [2018-07-23 15:25:04,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:04,835 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-07-23 15:25:04,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-23 15:25:04,835 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2018-07-23 15:25:04,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:04,836 INFO L225 Difference]: With dead ends: 157 [2018-07-23 15:25:04,836 INFO L226 Difference]: Without dead ends: 155 [2018-07-23 15:25:04,837 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-23 15:25:04,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-23 15:25:04,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-23 15:25:04,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-23 15:25:04,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-07-23 15:25:04,845 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2018-07-23 15:25:04,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:04,845 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-07-23 15:25:04,846 INFO L472 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-23 15:25:04,846 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-07-23 15:25:04,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-23 15:25:04,846 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:04,847 INFO L353 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1] [2018-07-23 15:25:04,847 INFO L414 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:04,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1195722693, now seen corresponding path program 75 times [2018-07-23 15:25:04,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:05,245 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-23 15:25:05,246 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:05,246 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-23 15:25:05,246 INFO L450 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-23 15:25:05,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-23 15:25:05,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 15:25:05,247 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 78 states. [2018-07-23 15:25:05,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:05,755 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-07-23 15:25:05,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-23 15:25:05,755 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-07-23 15:25:05,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:05,757 INFO L225 Difference]: With dead ends: 159 [2018-07-23 15:25:05,757 INFO L226 Difference]: Without dead ends: 157 [2018-07-23 15:25:05,757 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-23 15:25:05,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-23 15:25:05,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-07-23 15:25:05,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-07-23 15:25:05,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-07-23 15:25:05,766 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2018-07-23 15:25:05,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:05,766 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-07-23 15:25:05,766 INFO L472 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-23 15:25:05,766 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-07-23 15:25:05,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-23 15:25:05,767 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:05,767 INFO L353 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1] [2018-07-23 15:25:05,768 INFO L414 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:05,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1961675265, now seen corresponding path program 76 times [2018-07-23 15:25:05,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:06,308 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-23 15:25:06,308 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:06,308 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-23 15:25:06,309 INFO L450 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-23 15:25:06,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-23 15:25:06,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 15:25:06,310 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 79 states. [2018-07-23 15:25:06,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:06,786 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-07-23 15:25:06,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-23 15:25:06,787 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-07-23 15:25:06,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:06,788 INFO L225 Difference]: With dead ends: 161 [2018-07-23 15:25:06,788 INFO L226 Difference]: Without dead ends: 159 [2018-07-23 15:25:06,789 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-23 15:25:06,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-07-23 15:25:06,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-07-23 15:25:06,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-07-23 15:25:06,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-07-23 15:25:06,798 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2018-07-23 15:25:06,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:06,798 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-07-23 15:25:06,798 INFO L472 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-23 15:25:06,799 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-07-23 15:25:06,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-23 15:25:06,800 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:06,800 INFO L353 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1] [2018-07-23 15:25:06,800 INFO L414 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:06,800 INFO L82 PathProgramCache]: Analyzing trace with hash 320765369, now seen corresponding path program 77 times [2018-07-23 15:25:06,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:07,337 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-23 15:25:07,337 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:07,337 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-23 15:25:07,338 INFO L450 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-23 15:25:07,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-23 15:25:07,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 15:25:07,338 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 80 states. [2018-07-23 15:25:07,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:07,880 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-07-23 15:25:07,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-23 15:25:07,880 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-07-23 15:25:07,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:07,882 INFO L225 Difference]: With dead ends: 163 [2018-07-23 15:25:07,882 INFO L226 Difference]: Without dead ends: 161 [2018-07-23 15:25:07,882 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-23 15:25:07,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-07-23 15:25:07,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-07-23 15:25:07,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-23 15:25:07,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-07-23 15:25:07,891 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2018-07-23 15:25:07,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:07,892 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-07-23 15:25:07,892 INFO L472 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-23 15:25:07,892 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-07-23 15:25:07,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-23 15:25:07,893 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:07,893 INFO L353 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1] [2018-07-23 15:25:07,893 INFO L414 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:07,894 INFO L82 PathProgramCache]: Analyzing trace with hash -982073613, now seen corresponding path program 78 times [2018-07-23 15:25:07,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:08,266 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-23 15:25:08,266 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:08,267 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-23 15:25:08,267 INFO L450 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-23 15:25:08,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-23 15:25:08,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 15:25:08,267 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 81 states. [2018-07-23 15:25:08,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:08,846 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-07-23 15:25:08,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-23 15:25:08,847 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-07-23 15:25:08,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:08,848 INFO L225 Difference]: With dead ends: 165 [2018-07-23 15:25:08,848 INFO L226 Difference]: Without dead ends: 163 [2018-07-23 15:25:08,849 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-23 15:25:08,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-23 15:25:08,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-07-23 15:25:08,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-23 15:25:08,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-07-23 15:25:08,857 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2018-07-23 15:25:08,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:08,858 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-07-23 15:25:08,858 INFO L472 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-23 15:25:08,858 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-07-23 15:25:08,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-23 15:25:08,859 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:08,859 INFO L353 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1] [2018-07-23 15:25:08,859 INFO L414 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:08,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1120115117, now seen corresponding path program 79 times [2018-07-23 15:25:08,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:09,278 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-23 15:25:09,279 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:09,279 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-23 15:25:09,279 INFO L450 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-23 15:25:09,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-23 15:25:09,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 15:25:09,280 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 82 states. [2018-07-23 15:25:09,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:09,836 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-07-23 15:25:09,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-23 15:25:09,837 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-07-23 15:25:09,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:09,838 INFO L225 Difference]: With dead ends: 167 [2018-07-23 15:25:09,838 INFO L226 Difference]: Without dead ends: 165 [2018-07-23 15:25:09,839 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-23 15:25:09,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-07-23 15:25:09,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-07-23 15:25:09,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-07-23 15:25:09,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-07-23 15:25:09,847 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2018-07-23 15:25:09,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:09,847 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-07-23 15:25:09,847 INFO L472 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-23 15:25:09,847 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-07-23 15:25:09,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-23 15:25:09,848 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:09,848 INFO L353 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1] [2018-07-23 15:25:09,848 INFO L414 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:09,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1606111769, now seen corresponding path program 80 times [2018-07-23 15:25:09,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:10,308 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-23 15:25:10,308 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:10,308 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-23 15:25:10,309 INFO L450 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-23 15:25:10,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-23 15:25:10,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 15:25:10,309 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 83 states. [2018-07-23 15:25:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:10,872 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-07-23 15:25:10,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-23 15:25:10,872 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2018-07-23 15:25:10,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:10,873 INFO L225 Difference]: With dead ends: 169 [2018-07-23 15:25:10,873 INFO L226 Difference]: Without dead ends: 167 [2018-07-23 15:25:10,874 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-23 15:25:10,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-23 15:25:10,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-07-23 15:25:10,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-07-23 15:25:10,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-07-23 15:25:10,880 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2018-07-23 15:25:10,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:10,880 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-07-23 15:25:10,881 INFO L472 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-23 15:25:10,881 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-07-23 15:25:10,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-07-23 15:25:10,882 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:10,882 INFO L353 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1] [2018-07-23 15:25:10,882 INFO L414 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:10,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1580098655, now seen corresponding path program 81 times [2018-07-23 15:25:10,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:11,321 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-23 15:25:11,321 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:11,321 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-23 15:25:11,322 INFO L450 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-23 15:25:11,322 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-23 15:25:11,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 15:25:11,323 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 84 states. [2018-07-23 15:25:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:11,899 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-07-23 15:25:11,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-23 15:25:11,900 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-07-23 15:25:11,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:11,901 INFO L225 Difference]: With dead ends: 171 [2018-07-23 15:25:11,901 INFO L226 Difference]: Without dead ends: 169 [2018-07-23 15:25:11,901 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-23 15:25:11,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-07-23 15:25:11,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-07-23 15:25:11,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-07-23 15:25:11,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-07-23 15:25:11,909 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2018-07-23 15:25:11,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:11,909 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-07-23 15:25:11,909 INFO L472 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-23 15:25:11,909 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-07-23 15:25:11,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-07-23 15:25:11,910 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:11,910 INFO L353 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1] [2018-07-23 15:25:11,910 INFO L414 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:11,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1943667419, now seen corresponding path program 82 times [2018-07-23 15:25:11,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:12,370 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-23 15:25:12,370 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:12,371 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-23 15:25:12,371 INFO L450 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-23 15:25:12,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-23 15:25:12,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 15:25:12,372 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 85 states. [2018-07-23 15:25:12,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:12,976 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-07-23 15:25:12,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-23 15:25:12,976 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2018-07-23 15:25:12,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:12,977 INFO L225 Difference]: With dead ends: 173 [2018-07-23 15:25:12,977 INFO L226 Difference]: Without dead ends: 171 [2018-07-23 15:25:12,978 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-23 15:25:12,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-07-23 15:25:12,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-07-23 15:25:12,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-07-23 15:25:12,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-07-23 15:25:12,985 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2018-07-23 15:25:12,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:12,985 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-07-23 15:25:12,985 INFO L472 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-23 15:25:12,985 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-07-23 15:25:12,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-23 15:25:12,986 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:12,986 INFO L353 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1] [2018-07-23 15:25:12,986 INFO L414 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:12,987 INFO L82 PathProgramCache]: Analyzing trace with hash -446332011, now seen corresponding path program 83 times [2018-07-23 15:25:12,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:13,611 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-23 15:25:13,611 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:13,612 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-23 15:25:13,612 INFO L450 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-23 15:25:13,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-23 15:25:13,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 15:25:13,612 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 86 states. [2018-07-23 15:25:14,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:14,211 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-07-23 15:25:14,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-23 15:25:14,212 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-07-23 15:25:14,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:14,213 INFO L225 Difference]: With dead ends: 175 [2018-07-23 15:25:14,213 INFO L226 Difference]: Without dead ends: 173 [2018-07-23 15:25:14,213 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-23 15:25:14,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-07-23 15:25:14,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-07-23 15:25:14,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-23 15:25:14,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-07-23 15:25:14,219 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2018-07-23 15:25:14,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:14,220 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-07-23 15:25:14,220 INFO L472 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-23 15:25:14,220 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-07-23 15:25:14,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-23 15:25:14,221 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:14,221 INFO L353 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1] [2018-07-23 15:25:14,221 INFO L414 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:14,222 INFO L82 PathProgramCache]: Analyzing trace with hash 571719119, now seen corresponding path program 84 times [2018-07-23 15:25:14,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:14,668 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-23 15:25:14,669 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:14,669 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-23 15:25:14,669 INFO L450 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-23 15:25:14,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-23 15:25:14,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 15:25:14,670 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 87 states. [2018-07-23 15:25:15,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:15,316 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-07-23 15:25:15,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-23 15:25:15,316 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2018-07-23 15:25:15,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:15,317 INFO L225 Difference]: With dead ends: 177 [2018-07-23 15:25:15,317 INFO L226 Difference]: Without dead ends: 175 [2018-07-23 15:25:15,318 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-23 15:25:15,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-07-23 15:25:15,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-07-23 15:25:15,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-07-23 15:25:15,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-07-23 15:25:15,327 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2018-07-23 15:25:15,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:15,327 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-07-23 15:25:15,328 INFO L472 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-23 15:25:15,328 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-07-23 15:25:15,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-07-23 15:25:15,329 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:15,329 INFO L353 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1] [2018-07-23 15:25:15,329 INFO L414 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:15,329 INFO L82 PathProgramCache]: Analyzing trace with hash -333688439, now seen corresponding path program 85 times [2018-07-23 15:25:15,329 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:16,032 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-23 15:25:16,032 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:16,032 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-23 15:25:16,033 INFO L450 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-23 15:25:16,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-23 15:25:16,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 15:25:16,034 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 88 states. [2018-07-23 15:25:16,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:16,745 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-07-23 15:25:16,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-23 15:25:16,746 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-07-23 15:25:16,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:16,747 INFO L225 Difference]: With dead ends: 179 [2018-07-23 15:25:16,747 INFO L226 Difference]: Without dead ends: 177 [2018-07-23 15:25:16,748 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-23 15:25:16,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-07-23 15:25:16,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-07-23 15:25:16,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-07-23 15:25:16,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-07-23 15:25:16,756 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2018-07-23 15:25:16,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:16,756 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-07-23 15:25:16,756 INFO L472 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-23 15:25:16,756 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-07-23 15:25:16,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-23 15:25:16,757 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:16,757 INFO L353 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1] [2018-07-23 15:25:16,757 INFO L414 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:16,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1448009411, now seen corresponding path program 86 times [2018-07-23 15:25:16,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:17,309 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-23 15:25:17,310 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:17,310 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-23 15:25:17,310 INFO L450 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-23 15:25:17,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-23 15:25:17,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 15:25:17,311 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 89 states. [2018-07-23 15:25:17,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:17,895 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-07-23 15:25:17,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-23 15:25:17,895 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2018-07-23 15:25:17,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:17,896 INFO L225 Difference]: With dead ends: 181 [2018-07-23 15:25:17,896 INFO L226 Difference]: Without dead ends: 179 [2018-07-23 15:25:17,897 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-23 15:25:17,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-23 15:25:17,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-07-23 15:25:17,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-07-23 15:25:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-07-23 15:25:17,905 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2018-07-23 15:25:17,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:17,905 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-07-23 15:25:17,905 INFO L472 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-23 15:25:17,905 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-07-23 15:25:17,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-23 15:25:17,906 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:17,907 INFO L353 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1] [2018-07-23 15:25:17,907 INFO L414 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:17,907 INFO L82 PathProgramCache]: Analyzing trace with hash -32307843, now seen corresponding path program 87 times [2018-07-23 15:25:17,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:18,393 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-23 15:25:18,393 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:18,393 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-23 15:25:18,394 INFO L450 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-23 15:25:18,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-23 15:25:18,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 15:25:18,395 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 90 states. [2018-07-23 15:25:19,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:19,094 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-07-23 15:25:19,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-23 15:25:19,094 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-07-23 15:25:19,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:19,096 INFO L225 Difference]: With dead ends: 183 [2018-07-23 15:25:19,096 INFO L226 Difference]: Without dead ends: 181 [2018-07-23 15:25:19,097 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-23 15:25:19,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-07-23 15:25:19,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-07-23 15:25:19,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-23 15:25:19,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-07-23 15:25:19,105 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2018-07-23 15:25:19,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:19,106 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-07-23 15:25:19,106 INFO L472 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-23 15:25:19,106 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-07-23 15:25:19,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-23 15:25:19,107 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:19,107 INFO L353 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1] [2018-07-23 15:25:19,107 INFO L414 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:19,108 INFO L82 PathProgramCache]: Analyzing trace with hash -983013961, now seen corresponding path program 88 times [2018-07-23 15:25:19,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:19,635 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-23 15:25:19,636 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:19,636 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-23 15:25:19,636 INFO L450 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-23 15:25:19,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-23 15:25:19,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 15:25:19,637 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 91 states. [2018-07-23 15:25:20,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:20,354 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-07-23 15:25:20,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-23 15:25:20,354 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2018-07-23 15:25:20,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:20,355 INFO L225 Difference]: With dead ends: 185 [2018-07-23 15:25:20,355 INFO L226 Difference]: Without dead ends: 183 [2018-07-23 15:25:20,356 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-23 15:25:20,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-23 15:25:20,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-07-23 15:25:20,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-23 15:25:20,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-07-23 15:25:20,364 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2018-07-23 15:25:20,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:20,364 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-07-23 15:25:20,364 INFO L472 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-23 15:25:20,364 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-07-23 15:25:20,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-07-23 15:25:20,365 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:20,365 INFO L353 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1] [2018-07-23 15:25:20,366 INFO L414 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:20,366 INFO L82 PathProgramCache]: Analyzing trace with hash 216440689, now seen corresponding path program 89 times [2018-07-23 15:25:20,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:21,025 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-23 15:25:21,026 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:21,026 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-23 15:25:21,026 INFO L450 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-23 15:25:21,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-23 15:25:21,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 15:25:21,027 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 92 states. [2018-07-23 15:25:21,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:21,696 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-07-23 15:25:21,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-23 15:25:21,696 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2018-07-23 15:25:21,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:21,697 INFO L225 Difference]: With dead ends: 187 [2018-07-23 15:25:21,697 INFO L226 Difference]: Without dead ends: 185 [2018-07-23 15:25:21,698 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-23 15:25:21,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-23 15:25:21,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-07-23 15:25:21,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-23 15:25:21,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-07-23 15:25:21,706 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2018-07-23 15:25:21,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:21,707 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-07-23 15:25:21,707 INFO L472 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-23 15:25:21,707 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-07-23 15:25:21,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-23 15:25:21,708 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:21,708 INFO L353 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1] [2018-07-23 15:25:21,708 INFO L414 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:21,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1841124011, now seen corresponding path program 90 times [2018-07-23 15:25:21,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:22,226 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-23 15:25:22,226 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:22,227 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-23 15:25:22,227 INFO L450 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-23 15:25:22,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-23 15:25:22,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 15:25:22,228 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 93 states. [2018-07-23 15:25:22,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:22,884 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-07-23 15:25:22,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-23 15:25:22,885 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2018-07-23 15:25:22,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:22,886 INFO L225 Difference]: With dead ends: 189 [2018-07-23 15:25:22,886 INFO L226 Difference]: Without dead ends: 187 [2018-07-23 15:25:22,887 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-23 15:25:22,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-07-23 15:25:22,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-07-23 15:25:22,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-07-23 15:25:22,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-07-23 15:25:22,895 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2018-07-23 15:25:22,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:22,896 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-07-23 15:25:22,896 INFO L472 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-23 15:25:22,896 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-07-23 15:25:22,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-07-23 15:25:22,897 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:22,897 INFO L353 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1] [2018-07-23 15:25:22,897 INFO L414 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:22,897 INFO L82 PathProgramCache]: Analyzing trace with hash -206299291, now seen corresponding path program 91 times [2018-07-23 15:25:22,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:23,405 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-23 15:25:23,405 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:23,406 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-23 15:25:23,406 INFO L450 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-23 15:25:23,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-23 15:25:23,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 15:25:23,407 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 94 states. [2018-07-23 15:25:24,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:24,115 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-07-23 15:25:24,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-23 15:25:24,115 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2018-07-23 15:25:24,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:24,116 INFO L225 Difference]: With dead ends: 191 [2018-07-23 15:25:24,116 INFO L226 Difference]: Without dead ends: 189 [2018-07-23 15:25:24,117 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-23 15:25:24,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-07-23 15:25:24,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-07-23 15:25:24,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-07-23 15:25:24,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-07-23 15:25:24,122 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2018-07-23 15:25:24,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:24,122 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-07-23 15:25:24,122 INFO L472 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-23 15:25:24,122 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-07-23 15:25:24,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-07-23 15:25:24,123 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:24,123 INFO L353 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1] [2018-07-23 15:25:24,123 INFO L414 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:24,123 INFO L82 PathProgramCache]: Analyzing trace with hash -685070945, now seen corresponding path program 92 times [2018-07-23 15:25:24,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:24,643 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-23 15:25:24,643 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:24,644 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-23 15:25:24,644 INFO L450 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-23 15:25:24,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-23 15:25:24,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 15:25:24,645 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 95 states. [2018-07-23 15:25:25,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:25,506 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-07-23 15:25:25,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-23 15:25:25,506 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2018-07-23 15:25:25,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:25,507 INFO L225 Difference]: With dead ends: 193 [2018-07-23 15:25:25,507 INFO L226 Difference]: Without dead ends: 191 [2018-07-23 15:25:25,507 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-23 15:25:25,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-07-23 15:25:25,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-07-23 15:25:25,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-07-23 15:25:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-07-23 15:25:25,513 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2018-07-23 15:25:25,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:25,513 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-07-23 15:25:25,513 INFO L472 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-23 15:25:25,513 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-07-23 15:25:25,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-07-23 15:25:25,514 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:25,515 INFO L353 BasicCegarLoop]: trace histogram [94, 93, 1, 1, 1] [2018-07-23 15:25:25,515 INFO L414 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:25,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1223129767, now seen corresponding path program 93 times [2018-07-23 15:25:25,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:26,117 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-23 15:25:26,118 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:26,118 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-23 15:25:26,118 INFO L450 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-23 15:25:26,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-23 15:25:26,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 15:25:26,119 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 96 states. [2018-07-23 15:25:26,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:26,872 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-07-23 15:25:26,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-23 15:25:26,872 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2018-07-23 15:25:26,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:26,873 INFO L225 Difference]: With dead ends: 195 [2018-07-23 15:25:26,873 INFO L226 Difference]: Without dead ends: 193 [2018-07-23 15:25:26,874 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-23 15:25:26,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-07-23 15:25:26,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-07-23 15:25:26,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-07-23 15:25:26,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-07-23 15:25:26,880 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 190 [2018-07-23 15:25:26,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:26,880 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-07-23 15:25:26,880 INFO L472 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-23 15:25:26,881 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-07-23 15:25:26,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-07-23 15:25:26,881 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:26,881 INFO L353 BasicCegarLoop]: trace histogram [95, 94, 1, 1, 1] [2018-07-23 15:25:26,881 INFO L414 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:26,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1393385107, now seen corresponding path program 94 times [2018-07-23 15:25:26,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:27,489 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-23 15:25:27,489 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:27,489 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-23 15:25:27,490 INFO L450 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-23 15:25:27,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-23 15:25:27,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 15:25:27,491 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 97 states. [2018-07-23 15:25:28,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:28,324 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-07-23 15:25:28,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-23 15:25:28,324 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2018-07-23 15:25:28,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:28,325 INFO L225 Difference]: With dead ends: 197 [2018-07-23 15:25:28,326 INFO L226 Difference]: Without dead ends: 195 [2018-07-23 15:25:28,326 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-07-23 15:25:28,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-07-23 15:25:28,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-07-23 15:25:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-07-23 15:25:28,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-07-23 15:25:28,332 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 192 [2018-07-23 15:25:28,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:28,332 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-07-23 15:25:28,333 INFO L472 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-23 15:25:28,333 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-07-23 15:25:28,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-07-23 15:25:28,333 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:28,333 INFO L353 BasicCegarLoop]: trace histogram [96, 95, 1, 1, 1] [2018-07-23 15:25:28,334 INFO L414 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:28,334 INFO L82 PathProgramCache]: Analyzing trace with hash -986656435, now seen corresponding path program 95 times [2018-07-23 15:25:28,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:28,890 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-23 15:25:28,890 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:28,891 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-23 15:25:28,891 INFO L450 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-23 15:25:28,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-23 15:25:28,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 15:25:28,892 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 98 states. [2018-07-23 15:25:29,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:29,693 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-07-23 15:25:29,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-23 15:25:29,694 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2018-07-23 15:25:29,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:29,695 INFO L225 Difference]: With dead ends: 199 [2018-07-23 15:25:29,695 INFO L226 Difference]: Without dead ends: 197 [2018-07-23 15:25:29,696 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-07-23 15:25:29,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-07-23 15:25:29,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-07-23 15:25:29,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-07-23 15:25:29,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-07-23 15:25:29,701 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 194 [2018-07-23 15:25:29,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:29,702 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-07-23 15:25:29,702 INFO L472 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-23 15:25:29,702 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-07-23 15:25:29,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-07-23 15:25:29,703 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:29,703 INFO L353 BasicCegarLoop]: trace histogram [97, 96, 1, 1, 1] [2018-07-23 15:25:29,703 INFO L414 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:29,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1010990471, now seen corresponding path program 96 times [2018-07-23 15:25:29,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:30,223 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-23 15:25:30,223 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:30,223 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-23 15:25:30,223 INFO L450 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-23 15:25:30,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-23 15:25:30,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 15:25:30,224 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 99 states. [2018-07-23 15:25:31,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:31,023 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-07-23 15:25:31,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-23 15:25:31,024 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2018-07-23 15:25:31,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:31,025 INFO L225 Difference]: With dead ends: 201 [2018-07-23 15:25:31,025 INFO L226 Difference]: Without dead ends: 199 [2018-07-23 15:25:31,026 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-07-23 15:25:31,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-07-23 15:25:31,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-07-23 15:25:31,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-07-23 15:25:31,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-07-23 15:25:31,034 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 196 [2018-07-23 15:25:31,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:31,034 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-07-23 15:25:31,034 INFO L472 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-23 15:25:31,034 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-07-23 15:25:31,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-07-23 15:25:31,035 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:31,035 INFO L353 BasicCegarLoop]: trace histogram [98, 97, 1, 1, 1] [2018-07-23 15:25:31,036 INFO L414 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:31,036 INFO L82 PathProgramCache]: Analyzing trace with hash 899285825, now seen corresponding path program 97 times [2018-07-23 15:25:31,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:31,644 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-23 15:25:31,644 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:31,645 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-23 15:25:31,645 INFO L450 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-23 15:25:31,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-23 15:25:31,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 15:25:31,646 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 100 states. [2018-07-23 15:25:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:32,440 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-07-23 15:25:32,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-23 15:25:32,440 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2018-07-23 15:25:32,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:32,441 INFO L225 Difference]: With dead ends: 203 [2018-07-23 15:25:32,441 INFO L226 Difference]: Without dead ends: 201 [2018-07-23 15:25:32,442 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-07-23 15:25:32,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-07-23 15:25:32,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-07-23 15:25:32,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-07-23 15:25:32,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-07-23 15:25:32,448 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 198 [2018-07-23 15:25:32,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:32,448 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-07-23 15:25:32,448 INFO L472 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-23 15:25:32,448 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-07-23 15:25:32,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-07-23 15:25:32,449 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:32,449 INFO L353 BasicCegarLoop]: trace histogram [99, 98, 1, 1, 1] [2018-07-23 15:25:32,449 INFO L414 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:32,449 INFO L82 PathProgramCache]: Analyzing trace with hash 925303419, now seen corresponding path program 98 times [2018-07-23 15:25:32,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:33,005 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-23 15:25:33,006 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:33,006 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-23 15:25:33,006 INFO L450 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-23 15:25:33,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-23 15:25:33,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 15:25:33,007 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 101 states. [2018-07-23 15:25:33,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:33,833 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-07-23 15:25:33,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-23 15:25:33,834 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2018-07-23 15:25:33,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:33,835 INFO L225 Difference]: With dead ends: 205 [2018-07-23 15:25:33,835 INFO L226 Difference]: Without dead ends: 203 [2018-07-23 15:25:33,835 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-07-23 15:25:33,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-07-23 15:25:33,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-07-23 15:25:33,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-23 15:25:33,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-07-23 15:25:33,841 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 200 [2018-07-23 15:25:33,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:33,841 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-07-23 15:25:33,841 INFO L472 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-23 15:25:33,841 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-07-23 15:25:33,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-07-23 15:25:33,842 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:33,842 INFO L353 BasicCegarLoop]: trace histogram [100, 99, 1, 1, 1] [2018-07-23 15:25:33,842 INFO L414 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:33,843 INFO L82 PathProgramCache]: Analyzing trace with hash 158407477, now seen corresponding path program 99 times [2018-07-23 15:25:33,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:34,480 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-23 15:25:34,480 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:34,481 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-23 15:25:34,481 INFO L450 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-23 15:25:34,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-23 15:25:34,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 15:25:34,482 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 102 states. [2018-07-23 15:25:35,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:35,446 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-07-23 15:25:35,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-23 15:25:35,446 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2018-07-23 15:25:35,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:35,447 INFO L225 Difference]: With dead ends: 207 [2018-07-23 15:25:35,447 INFO L226 Difference]: Without dead ends: 205 [2018-07-23 15:25:35,448 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-07-23 15:25:35,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-07-23 15:25:35,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-07-23 15:25:35,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-07-23 15:25:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-07-23 15:25:35,454 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 202 [2018-07-23 15:25:35,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:35,454 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-07-23 15:25:35,454 INFO L472 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-23 15:25:35,455 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-07-23 15:25:35,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-07-23 15:25:35,455 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:35,455 INFO L353 BasicCegarLoop]: trace histogram [101, 100, 1, 1, 1] [2018-07-23 15:25:35,456 INFO L414 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:35,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1905782127, now seen corresponding path program 100 times [2018-07-23 15:25:35,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:36,078 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-23 15:25:36,079 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:36,079 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-23 15:25:36,079 INFO L450 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-23 15:25:36,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-23 15:25:36,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 15:25:36,080 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 103 states. [2018-07-23 15:25:36,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:36,933 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-07-23 15:25:36,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-23 15:25:36,933 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2018-07-23 15:25:36,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:36,934 INFO L225 Difference]: With dead ends: 209 [2018-07-23 15:25:36,934 INFO L226 Difference]: Without dead ends: 207 [2018-07-23 15:25:36,935 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-23 15:25:36,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-07-23 15:25:36,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-07-23 15:25:36,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-07-23 15:25:36,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-07-23 15:25:36,944 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 204 [2018-07-23 15:25:36,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:36,944 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-07-23 15:25:36,944 INFO L472 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-23 15:25:36,944 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-07-23 15:25:36,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-07-23 15:25:36,945 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:36,945 INFO L353 BasicCegarLoop]: trace histogram [102, 101, 1, 1, 1] [2018-07-23 15:25:36,946 INFO L414 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:36,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1800608041, now seen corresponding path program 101 times [2018-07-23 15:25:36,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:37,556 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-23 15:25:37,557 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:37,557 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-23 15:25:37,557 INFO L450 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-23 15:25:37,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-23 15:25:37,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-23 15:25:37,559 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 104 states. [2018-07-23 15:25:38,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:38,480 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-07-23 15:25:38,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-23 15:25:38,481 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2018-07-23 15:25:38,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:38,482 INFO L225 Difference]: With dead ends: 211 [2018-07-23 15:25:38,482 INFO L226 Difference]: Without dead ends: 209 [2018-07-23 15:25:38,483 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-23 15:25:38,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-07-23 15:25:38,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-07-23 15:25:38,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-07-23 15:25:38,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-07-23 15:25:38,492 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 206 [2018-07-23 15:25:38,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:38,492 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-07-23 15:25:38,492 INFO L472 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-23 15:25:38,492 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-07-23 15:25:38,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-07-23 15:25:38,493 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:38,493 INFO L353 BasicCegarLoop]: trace histogram [103, 102, 1, 1, 1] [2018-07-23 15:25:38,493 INFO L414 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:38,493 INFO L82 PathProgramCache]: Analyzing trace with hash -487440797, now seen corresponding path program 102 times [2018-07-23 15:25:38,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:39,211 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-23 15:25:39,211 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:39,211 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-07-23 15:25:39,212 INFO L450 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-23 15:25:39,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-23 15:25:39,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-07-23 15:25:39,213 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 105 states. [2018-07-23 15:25:40,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:40,109 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-07-23 15:25:40,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-07-23 15:25:40,110 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2018-07-23 15:25:40,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:40,110 INFO L225 Difference]: With dead ends: 213 [2018-07-23 15:25:40,110 INFO L226 Difference]: Without dead ends: 211 [2018-07-23 15:25:40,111 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-07-23 15:25:40,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-07-23 15:25:40,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-07-23 15:25:40,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-07-23 15:25:40,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-07-23 15:25:40,120 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 208 [2018-07-23 15:25:40,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:40,120 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-07-23 15:25:40,120 INFO L472 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-23 15:25:40,121 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-07-23 15:25:40,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-07-23 15:25:40,122 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:40,122 INFO L353 BasicCegarLoop]: trace histogram [104, 103, 1, 1, 1] [2018-07-23 15:25:40,122 INFO L414 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:40,122 INFO L82 PathProgramCache]: Analyzing trace with hash -279118563, now seen corresponding path program 103 times [2018-07-23 15:25:40,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:40,784 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-23 15:25:40,784 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:40,785 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-23 15:25:40,785 INFO L450 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-07-23 15:25:40,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-07-23 15:25:40,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-23 15:25:40,786 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 106 states. [2018-07-23 15:25:41,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:41,718 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-07-23 15:25:41,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-23 15:25:41,718 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2018-07-23 15:25:41,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:41,719 INFO L225 Difference]: With dead ends: 215 [2018-07-23 15:25:41,719 INFO L226 Difference]: Without dead ends: 213 [2018-07-23 15:25:41,720 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-23 15:25:41,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-07-23 15:25:41,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-07-23 15:25:41,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-07-23 15:25:41,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-07-23 15:25:41,729 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 210 [2018-07-23 15:25:41,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:41,730 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-07-23 15:25:41,730 INFO L472 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-07-23 15:25:41,730 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-07-23 15:25:41,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-07-23 15:25:41,731 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:41,731 INFO L353 BasicCegarLoop]: trace histogram [105, 104, 1, 1, 1] [2018-07-23 15:25:41,731 INFO L414 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:41,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1944914601, now seen corresponding path program 104 times [2018-07-23 15:25:41,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:42,449 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-23 15:25:42,450 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:42,450 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-07-23 15:25:42,450 INFO L450 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-07-23 15:25:42,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-07-23 15:25:42,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-23 15:25:42,452 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 107 states. [2018-07-23 15:25:43,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:43,525 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-07-23 15:25:43,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-07-23 15:25:43,525 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 212 [2018-07-23 15:25:43,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:43,526 INFO L225 Difference]: With dead ends: 217 [2018-07-23 15:25:43,526 INFO L226 Difference]: Without dead ends: 215 [2018-07-23 15:25:43,527 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-23 15:25:43,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-07-23 15:25:43,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-07-23 15:25:43,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-07-23 15:25:43,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-07-23 15:25:43,535 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 212 [2018-07-23 15:25:43,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:43,536 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-07-23 15:25:43,536 INFO L472 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-07-23 15:25:43,536 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-07-23 15:25:43,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-07-23 15:25:43,537 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:43,537 INFO L353 BasicCegarLoop]: trace histogram [106, 105, 1, 1, 1] [2018-07-23 15:25:43,537 INFO L414 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:43,537 INFO L82 PathProgramCache]: Analyzing trace with hash -752105711, now seen corresponding path program 105 times [2018-07-23 15:25:43,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:44,257 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-23 15:25:44,257 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:44,257 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-07-23 15:25:44,258 INFO L450 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-07-23 15:25:44,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-07-23 15:25:44,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-23 15:25:44,259 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 108 states. [2018-07-23 15:25:45,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:45,227 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-07-23 15:25:45,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-23 15:25:45,227 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 214 [2018-07-23 15:25:45,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:45,228 INFO L225 Difference]: With dead ends: 219 [2018-07-23 15:25:45,228 INFO L226 Difference]: Without dead ends: 217 [2018-07-23 15:25:45,229 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-23 15:25:45,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-07-23 15:25:45,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-07-23 15:25:45,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-07-23 15:25:45,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-07-23 15:25:45,237 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 214 [2018-07-23 15:25:45,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:45,237 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-07-23 15:25:45,237 INFO L472 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-07-23 15:25:45,238 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-07-23 15:25:45,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-07-23 15:25:45,238 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:45,238 INFO L353 BasicCegarLoop]: trace histogram [107, 106, 1, 1, 1] [2018-07-23 15:25:45,238 INFO L414 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:45,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1219030453, now seen corresponding path program 106 times [2018-07-23 15:25:45,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:45,956 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-23 15:25:45,956 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:45,957 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-07-23 15:25:45,957 INFO L450 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-07-23 15:25:45,957 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-07-23 15:25:45,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-23 15:25:45,958 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 109 states. [2018-07-23 15:25:46,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:46,943 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-07-23 15:25:46,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-07-23 15:25:46,943 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 216 [2018-07-23 15:25:46,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:46,944 INFO L225 Difference]: With dead ends: 221 [2018-07-23 15:25:46,944 INFO L226 Difference]: Without dead ends: 219 [2018-07-23 15:25:46,945 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-23 15:25:46,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-07-23 15:25:46,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-07-23 15:25:46,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-07-23 15:25:46,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-07-23 15:25:46,951 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 216 [2018-07-23 15:25:46,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:46,951 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-07-23 15:25:46,951 INFO L472 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-07-23 15:25:46,951 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-07-23 15:25:46,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-07-23 15:25:46,952 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:46,952 INFO L353 BasicCegarLoop]: trace histogram [108, 107, 1, 1, 1] [2018-07-23 15:25:46,952 INFO L414 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:46,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1037858565, now seen corresponding path program 107 times [2018-07-23 15:25:46,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:47,730 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-23 15:25:47,730 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:47,730 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-07-23 15:25:47,731 INFO L450 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-07-23 15:25:47,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-07-23 15:25:47,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-23 15:25:47,732 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 110 states. [2018-07-23 15:25:48,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:48,681 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-07-23 15:25:48,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-07-23 15:25:48,682 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 218 [2018-07-23 15:25:48,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:48,682 INFO L225 Difference]: With dead ends: 223 [2018-07-23 15:25:48,682 INFO L226 Difference]: Without dead ends: 221 [2018-07-23 15:25:48,683 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-23 15:25:48,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-07-23 15:25:48,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-07-23 15:25:48,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-07-23 15:25:48,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-07-23 15:25:48,689 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 218 [2018-07-23 15:25:48,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:48,689 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-07-23 15:25:48,689 INFO L472 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-07-23 15:25:48,690 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-07-23 15:25:48,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-07-23 15:25:48,690 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:48,690 INFO L353 BasicCegarLoop]: trace histogram [109, 108, 1, 1, 1] [2018-07-23 15:25:48,691 INFO L414 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:48,691 INFO L82 PathProgramCache]: Analyzing trace with hash 949720383, now seen corresponding path program 108 times [2018-07-23 15:25:48,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:49,662 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-23 15:25:49,662 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:49,662 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-07-23 15:25:49,662 INFO L450 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-07-23 15:25:49,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-07-23 15:25:49,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-23 15:25:49,664 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 111 states. [2018-07-23 15:25:50,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:50,729 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-07-23 15:25:50,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-23 15:25:50,730 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 220 [2018-07-23 15:25:50,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:50,730 INFO L225 Difference]: With dead ends: 225 [2018-07-23 15:25:50,730 INFO L226 Difference]: Without dead ends: 223 [2018-07-23 15:25:50,732 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-23 15:25:50,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-07-23 15:25:50,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-07-23 15:25:50,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-07-23 15:25:50,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-07-23 15:25:50,740 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 220 [2018-07-23 15:25:50,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:50,740 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-07-23 15:25:50,740 INFO L472 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-07-23 15:25:50,741 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-07-23 15:25:50,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-07-23 15:25:50,742 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:50,742 INFO L353 BasicCegarLoop]: trace histogram [110, 109, 1, 1, 1] [2018-07-23 15:25:50,742 INFO L414 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:50,742 INFO L82 PathProgramCache]: Analyzing trace with hash -2146693895, now seen corresponding path program 109 times [2018-07-23 15:25:50,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:51,554 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-23 15:25:51,554 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:51,554 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-07-23 15:25:51,555 INFO L450 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-07-23 15:25:51,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-07-23 15:25:51,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-23 15:25:51,556 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 112 states. [2018-07-23 15:25:52,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:52,569 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-07-23 15:25:52,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-23 15:25:52,569 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 222 [2018-07-23 15:25:52,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:52,570 INFO L225 Difference]: With dead ends: 227 [2018-07-23 15:25:52,570 INFO L226 Difference]: Without dead ends: 225 [2018-07-23 15:25:52,571 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-23 15:25:52,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-07-23 15:25:52,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-07-23 15:25:52,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-07-23 15:25:52,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-07-23 15:25:52,579 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 222 [2018-07-23 15:25:52,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:52,580 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-07-23 15:25:52,580 INFO L472 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-07-23 15:25:52,580 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-07-23 15:25:52,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-07-23 15:25:52,581 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:52,581 INFO L353 BasicCegarLoop]: trace histogram [111, 110, 1, 1, 1] [2018-07-23 15:25:52,581 INFO L414 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:52,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1388478925, now seen corresponding path program 110 times [2018-07-23 15:25:52,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:53,276 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-23 15:25:53,276 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:53,276 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-07-23 15:25:53,277 INFO L450 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-07-23 15:25:53,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-07-23 15:25:53,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-23 15:25:53,278 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 113 states. [2018-07-23 15:25:54,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:54,350 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-07-23 15:25:54,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-23 15:25:54,350 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 224 [2018-07-23 15:25:54,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:54,351 INFO L225 Difference]: With dead ends: 229 [2018-07-23 15:25:54,351 INFO L226 Difference]: Without dead ends: 227 [2018-07-23 15:25:54,352 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-23 15:25:54,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-07-23 15:25:54,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-07-23 15:25:54,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-07-23 15:25:54,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-07-23 15:25:54,361 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 224 [2018-07-23 15:25:54,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:54,361 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-07-23 15:25:54,361 INFO L472 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-07-23 15:25:54,361 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-07-23 15:25:54,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-07-23 15:25:54,362 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:54,362 INFO L353 BasicCegarLoop]: trace histogram [112, 111, 1, 1, 1] [2018-07-23 15:25:54,362 INFO L414 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:54,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1406634221, now seen corresponding path program 111 times [2018-07-23 15:25:54,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:55,287 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-23 15:25:55,287 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:55,288 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-07-23 15:25:55,288 INFO L450 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-07-23 15:25:55,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-07-23 15:25:55,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-23 15:25:55,289 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 114 states. [2018-07-23 15:25:56,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:56,323 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-07-23 15:25:56,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-07-23 15:25:56,324 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 226 [2018-07-23 15:25:56,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:56,324 INFO L225 Difference]: With dead ends: 231 [2018-07-23 15:25:56,324 INFO L226 Difference]: Without dead ends: 229 [2018-07-23 15:25:56,325 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-23 15:25:56,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-07-23 15:25:56,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-07-23 15:25:56,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-07-23 15:25:56,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-07-23 15:25:56,331 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 226 [2018-07-23 15:25:56,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:56,331 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-07-23 15:25:56,331 INFO L472 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-07-23 15:25:56,332 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-07-23 15:25:56,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-07-23 15:25:56,332 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:56,332 INFO L353 BasicCegarLoop]: trace histogram [113, 112, 1, 1, 1] [2018-07-23 15:25:56,332 INFO L414 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:56,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1139159769, now seen corresponding path program 112 times [2018-07-23 15:25:56,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:57,124 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-23 15:25:57,125 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:57,125 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-07-23 15:25:57,125 INFO L450 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-07-23 15:25:57,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-07-23 15:25:57,126 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-23 15:25:57,126 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 115 states. [2018-07-23 15:25:58,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:25:58,221 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-07-23 15:25:58,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-07-23 15:25:58,221 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 228 [2018-07-23 15:25:58,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:25:58,221 INFO L225 Difference]: With dead ends: 233 [2018-07-23 15:25:58,222 INFO L226 Difference]: Without dead ends: 231 [2018-07-23 15:25:58,222 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-23 15:25:58,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-07-23 15:25:58,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-07-23 15:25:58,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-07-23 15:25:58,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-07-23 15:25:58,231 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 228 [2018-07-23 15:25:58,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:25:58,231 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-07-23 15:25:58,232 INFO L472 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-07-23 15:25:58,232 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-07-23 15:25:58,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-07-23 15:25:58,233 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:25:58,233 INFO L353 BasicCegarLoop]: trace histogram [114, 113, 1, 1, 1] [2018-07-23 15:25:58,233 INFO L414 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:25:58,233 INFO L82 PathProgramCache]: Analyzing trace with hash 484174561, now seen corresponding path program 113 times [2018-07-23 15:25:58,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:25:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:25:59,042 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-23 15:25:59,042 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:25:59,042 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-07-23 15:25:59,042 INFO L450 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-07-23 15:25:59,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-07-23 15:25:59,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-23 15:25:59,043 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 116 states. [2018-07-23 15:26:00,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:26:00,099 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-07-23 15:26:00,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-23 15:26:00,099 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 230 [2018-07-23 15:26:00,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:26:00,099 INFO L225 Difference]: With dead ends: 235 [2018-07-23 15:26:00,100 INFO L226 Difference]: Without dead ends: 233 [2018-07-23 15:26:00,100 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-23 15:26:00,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-07-23 15:26:00,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-07-23 15:26:00,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-07-23 15:26:00,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-07-23 15:26:00,109 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 230 [2018-07-23 15:26:00,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:26:00,110 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-07-23 15:26:00,110 INFO L472 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-07-23 15:26:00,110 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-07-23 15:26:00,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-07-23 15:26:00,111 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:26:00,111 INFO L353 BasicCegarLoop]: trace histogram [115, 114, 1, 1, 1] [2018-07-23 15:26:00,111 INFO L414 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:26:00,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1435337243, now seen corresponding path program 114 times [2018-07-23 15:26:00,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:26:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:26:00,985 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-23 15:26:00,985 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:26:00,985 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-07-23 15:26:00,986 INFO L450 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-07-23 15:26:00,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-07-23 15:26:00,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-23 15:26:00,987 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 117 states. [2018-07-23 15:26:02,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:26:02,134 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-07-23 15:26:02,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-07-23 15:26:02,134 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 232 [2018-07-23 15:26:02,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:26:02,135 INFO L225 Difference]: With dead ends: 237 [2018-07-23 15:26:02,135 INFO L226 Difference]: Without dead ends: 235 [2018-07-23 15:26:02,136 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-23 15:26:02,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-07-23 15:26:02,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-07-23 15:26:02,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-07-23 15:26:02,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-07-23 15:26:02,142 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 232 [2018-07-23 15:26:02,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:26:02,142 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-07-23 15:26:02,142 INFO L472 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-07-23 15:26:02,142 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-07-23 15:26:02,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-07-23 15:26:02,143 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:26:02,143 INFO L353 BasicCegarLoop]: trace histogram [116, 115, 1, 1, 1] [2018-07-23 15:26:02,143 INFO L414 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:26:02,143 INFO L82 PathProgramCache]: Analyzing trace with hash 674640597, now seen corresponding path program 115 times [2018-07-23 15:26:02,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:26:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:26:02,967 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-23 15:26:02,967 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:26:02,967 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-07-23 15:26:02,968 INFO L450 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-07-23 15:26:02,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-07-23 15:26:02,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-23 15:26:02,969 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 118 states. [2018-07-23 15:26:04,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:26:04,086 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-07-23 15:26:04,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-23 15:26:04,086 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 234 [2018-07-23 15:26:04,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:26:04,086 INFO L225 Difference]: With dead ends: 239 [2018-07-23 15:26:04,087 INFO L226 Difference]: Without dead ends: 237 [2018-07-23 15:26:04,087 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-23 15:26:04,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-07-23 15:26:04,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-07-23 15:26:04,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-07-23 15:26:04,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-07-23 15:26:04,093 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 234 [2018-07-23 15:26:04,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:26:04,093 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-07-23 15:26:04,093 INFO L472 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-07-23 15:26:04,093 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-07-23 15:26:04,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-07-23 15:26:04,094 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:26:04,094 INFO L353 BasicCegarLoop]: trace histogram [117, 116, 1, 1, 1] [2018-07-23 15:26:04,095 INFO L414 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:26:04,095 INFO L82 PathProgramCache]: Analyzing trace with hash -210395889, now seen corresponding path program 116 times [2018-07-23 15:26:04,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:26:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:26:04,935 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-23 15:26:04,935 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:26:04,935 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-07-23 15:26:04,935 INFO L450 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-07-23 15:26:04,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-07-23 15:26:04,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-07-23 15:26:04,936 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 119 states. [2018-07-23 15:26:06,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:26:06,105 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-07-23 15:26:06,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-07-23 15:26:06,105 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 236 [2018-07-23 15:26:06,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:26:06,106 INFO L225 Difference]: With dead ends: 241 [2018-07-23 15:26:06,106 INFO L226 Difference]: Without dead ends: 239 [2018-07-23 15:26:06,107 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-07-23 15:26:06,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-07-23 15:26:06,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-07-23 15:26:06,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-07-23 15:26:06,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-07-23 15:26:06,116 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 236 [2018-07-23 15:26:06,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:26:06,116 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-07-23 15:26:06,116 INFO L472 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-07-23 15:26:06,116 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-07-23 15:26:06,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-07-23 15:26:06,117 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:26:06,117 INFO L353 BasicCegarLoop]: trace histogram [118, 117, 1, 1, 1] [2018-07-23 15:26:06,117 INFO L414 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:26:06,117 INFO L82 PathProgramCache]: Analyzing trace with hash -326934327, now seen corresponding path program 117 times [2018-07-23 15:26:06,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:26:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:26:06,992 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-23 15:26:06,993 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:26:06,993 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-07-23 15:26:06,993 INFO L450 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-07-23 15:26:06,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-07-23 15:26:06,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-07-23 15:26:06,994 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 120 states. [2018-07-23 15:26:08,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:26:08,218 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-07-23 15:26:08,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-07-23 15:26:08,218 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 238 [2018-07-23 15:26:08,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:26:08,219 INFO L225 Difference]: With dead ends: 243 [2018-07-23 15:26:08,219 INFO L226 Difference]: Without dead ends: 241 [2018-07-23 15:26:08,220 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-07-23 15:26:08,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-07-23 15:26:08,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-07-23 15:26:08,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-07-23 15:26:08,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-07-23 15:26:08,229 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 238 [2018-07-23 15:26:08,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:26:08,230 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-07-23 15:26:08,230 INFO L472 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-07-23 15:26:08,230 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-07-23 15:26:08,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-07-23 15:26:08,231 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:26:08,231 INFO L353 BasicCegarLoop]: trace histogram [119, 118, 1, 1, 1] [2018-07-23 15:26:08,231 INFO L414 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:26:08,231 INFO L82 PathProgramCache]: Analyzing trace with hash -651223549, now seen corresponding path program 118 times [2018-07-23 15:26:08,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:26:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:26:09,134 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-23 15:26:09,135 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:26:09,135 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-07-23 15:26:09,135 INFO L450 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-07-23 15:26:09,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-07-23 15:26:09,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-07-23 15:26:09,136 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 121 states. [2018-07-23 15:26:10,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:26:10,352 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-07-23 15:26:10,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-07-23 15:26:10,353 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 240 [2018-07-23 15:26:10,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:26:10,354 INFO L225 Difference]: With dead ends: 245 [2018-07-23 15:26:10,354 INFO L226 Difference]: Without dead ends: 243 [2018-07-23 15:26:10,355 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-07-23 15:26:10,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-07-23 15:26:10,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-07-23 15:26:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-07-23 15:26:10,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-07-23 15:26:10,363 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 240 [2018-07-23 15:26:10,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:26:10,363 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-07-23 15:26:10,363 INFO L472 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-07-23 15:26:10,363 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-07-23 15:26:10,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-07-23 15:26:10,364 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:26:10,364 INFO L353 BasicCegarLoop]: trace histogram [120, 119, 1, 1, 1] [2018-07-23 15:26:10,364 INFO L414 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:26:10,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1239446717, now seen corresponding path program 119 times [2018-07-23 15:26:10,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:26:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:26:11,245 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-23 15:26:11,245 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:26:11,245 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-07-23 15:26:11,246 INFO L450 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-07-23 15:26:11,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-07-23 15:26:11,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-07-23 15:26:11,247 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 122 states. [2018-07-23 15:26:12,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:26:12,539 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-07-23 15:26:12,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-07-23 15:26:12,539 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 242 [2018-07-23 15:26:12,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:26:12,540 INFO L225 Difference]: With dead ends: 247 [2018-07-23 15:26:12,540 INFO L226 Difference]: Without dead ends: 245 [2018-07-23 15:26:12,541 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-07-23 15:26:12,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-07-23 15:26:12,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-07-23 15:26:12,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-07-23 15:26:12,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-07-23 15:26:12,549 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 242 [2018-07-23 15:26:12,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:26:12,550 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-07-23 15:26:12,550 INFO L472 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-07-23 15:26:12,550 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-07-23 15:26:12,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-07-23 15:26:12,551 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:26:12,551 INFO L353 BasicCegarLoop]: trace histogram [121, 120, 1, 1, 1] [2018-07-23 15:26:12,551 INFO L414 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:26:12,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1402406135, now seen corresponding path program 120 times [2018-07-23 15:26:12,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:26:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:26:13,436 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-23 15:26:13,437 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:26:13,437 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-07-23 15:26:13,437 INFO L450 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-07-23 15:26:13,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-07-23 15:26:13,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-07-23 15:26:13,438 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 123 states. [2018-07-23 15:26:14,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:26:14,710 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-07-23 15:26:14,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-07-23 15:26:14,711 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 244 [2018-07-23 15:26:14,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:26:14,711 INFO L225 Difference]: With dead ends: 249 [2018-07-23 15:26:14,711 INFO L226 Difference]: Without dead ends: 247 [2018-07-23 15:26:14,712 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-07-23 15:26:14,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-07-23 15:26:14,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-07-23 15:26:14,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-07-23 15:26:14,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-07-23 15:26:14,719 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 244 [2018-07-23 15:26:14,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:26:14,719 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-07-23 15:26:14,719 INFO L472 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-07-23 15:26:14,719 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-07-23 15:26:14,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-07-23 15:26:14,720 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:26:14,720 INFO L353 BasicCegarLoop]: trace histogram [122, 121, 1, 1, 1] [2018-07-23 15:26:14,720 INFO L414 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:26:14,720 INFO L82 PathProgramCache]: Analyzing trace with hash -907383119, now seen corresponding path program 121 times [2018-07-23 15:26:14,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:26:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:26:15,671 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-23 15:26:15,672 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:26:15,672 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-07-23 15:26:15,672 INFO L450 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-07-23 15:26:15,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-07-23 15:26:15,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-07-23 15:26:15,674 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 124 states. [2018-07-23 15:26:16,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:26:16,983 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-07-23 15:26:16,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-07-23 15:26:16,983 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 246 [2018-07-23 15:26:16,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:26:16,984 INFO L225 Difference]: With dead ends: 251 [2018-07-23 15:26:16,984 INFO L226 Difference]: Without dead ends: 249 [2018-07-23 15:26:16,984 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-07-23 15:26:16,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-07-23 15:26:16,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-07-23 15:26:16,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-07-23 15:26:16,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-07-23 15:26:16,993 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 246 [2018-07-23 15:26:16,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:26:16,993 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-07-23 15:26:16,993 INFO L472 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-07-23 15:26:16,993 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-07-23 15:26:16,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-07-23 15:26:16,995 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:26:16,995 INFO L353 BasicCegarLoop]: trace histogram [123, 122, 1, 1, 1] [2018-07-23 15:26:16,995 INFO L414 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:26:16,995 INFO L82 PathProgramCache]: Analyzing trace with hash -116764181, now seen corresponding path program 122 times [2018-07-23 15:26:16,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:26:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:26:17,927 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-23 15:26:17,927 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:26:17,927 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-07-23 15:26:17,928 INFO L450 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-07-23 15:26:17,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-07-23 15:26:17,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-07-23 15:26:17,929 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 125 states. [2018-07-23 15:26:19,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:26:19,174 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-07-23 15:26:19,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-07-23 15:26:19,174 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 248 [2018-07-23 15:26:19,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:26:19,175 INFO L225 Difference]: With dead ends: 253 [2018-07-23 15:26:19,175 INFO L226 Difference]: Without dead ends: 251 [2018-07-23 15:26:19,176 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-07-23 15:26:19,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-07-23 15:26:19,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-07-23 15:26:19,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-07-23 15:26:19,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-07-23 15:26:19,183 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 248 [2018-07-23 15:26:19,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:26:19,183 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-07-23 15:26:19,183 INFO L472 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-07-23 15:26:19,183 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-07-23 15:26:19,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-07-23 15:26:19,184 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:26:19,184 INFO L353 BasicCegarLoop]: trace histogram [124, 123, 1, 1, 1] [2018-07-23 15:26:19,185 INFO L414 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:26:19,185 INFO L82 PathProgramCache]: Analyzing trace with hash -541176155, now seen corresponding path program 123 times [2018-07-23 15:26:19,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:26:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:26:20,114 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-23 15:26:20,115 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:26:20,115 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-07-23 15:26:20,115 INFO L450 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-07-23 15:26:20,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-07-23 15:26:20,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-07-23 15:26:20,116 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 126 states. [2018-07-23 15:26:21,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:26:21,441 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-07-23 15:26:21,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-07-23 15:26:21,441 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 250 [2018-07-23 15:26:21,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:26:21,442 INFO L225 Difference]: With dead ends: 255 [2018-07-23 15:26:21,442 INFO L226 Difference]: Without dead ends: 253 [2018-07-23 15:26:21,442 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-07-23 15:26:21,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-07-23 15:26:21,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-07-23 15:26:21,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-07-23 15:26:21,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-07-23 15:26:21,449 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 250 [2018-07-23 15:26:21,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:26:21,449 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-07-23 15:26:21,450 INFO L472 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-07-23 15:26:21,450 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-07-23 15:26:21,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-07-23 15:26:21,451 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:26:21,451 INFO L353 BasicCegarLoop]: trace histogram [125, 124, 1, 1, 1] [2018-07-23 15:26:21,451 INFO L414 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:26:21,451 INFO L82 PathProgramCache]: Analyzing trace with hash -379190049, now seen corresponding path program 124 times [2018-07-23 15:26:21,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:26:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:26:22,347 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-23 15:26:22,347 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:26:22,348 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-07-23 15:26:22,348 INFO L450 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-07-23 15:26:22,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-07-23 15:26:22,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-07-23 15:26:22,349 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 127 states. [2018-07-23 15:26:23,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:26:23,668 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-07-23 15:26:23,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-07-23 15:26:23,668 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 252 [2018-07-23 15:26:23,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:26:23,669 INFO L225 Difference]: With dead ends: 257 [2018-07-23 15:26:23,669 INFO L226 Difference]: Without dead ends: 255 [2018-07-23 15:26:23,671 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-07-23 15:26:23,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-07-23 15:26:23,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-07-23 15:26:23,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-07-23 15:26:23,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-07-23 15:26:23,677 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 252 [2018-07-23 15:26:23,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:26:23,677 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-07-23 15:26:23,677 INFO L472 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-07-23 15:26:23,677 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-07-23 15:26:23,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-07-23 15:26:23,678 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:26:23,678 INFO L353 BasicCegarLoop]: trace histogram [126, 125, 1, 1, 1] [2018-07-23 15:26:23,679 INFO L414 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:26:23,679 INFO L82 PathProgramCache]: Analyzing trace with hash 670635161, now seen corresponding path program 125 times [2018-07-23 15:26:23,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:26:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:26:24,673 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-23 15:26:24,674 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:26:24,674 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-07-23 15:26:24,674 INFO L450 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-07-23 15:26:24,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-07-23 15:26:24,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-07-23 15:26:24,675 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 128 states. [2018-07-23 15:26:26,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:26:26,023 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-07-23 15:26:26,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-07-23 15:26:26,023 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 254 [2018-07-23 15:26:26,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:26:26,024 INFO L225 Difference]: With dead ends: 259 [2018-07-23 15:26:26,024 INFO L226 Difference]: Without dead ends: 257 [2018-07-23 15:26:26,025 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-07-23 15:26:26,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-07-23 15:26:26,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2018-07-23 15:26:26,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-07-23 15:26:26,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-07-23 15:26:26,033 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 254 [2018-07-23 15:26:26,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:26:26,033 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-07-23 15:26:26,033 INFO L472 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-07-23 15:26:26,033 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-07-23 15:26:26,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-07-23 15:26:26,034 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:26:26,035 INFO L353 BasicCegarLoop]: trace histogram [127, 126, 1, 1, 1] [2018-07-23 15:26:26,035 INFO L414 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:26:26,035 INFO L82 PathProgramCache]: Analyzing trace with hash 235347411, now seen corresponding path program 126 times [2018-07-23 15:26:26,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:26:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:26:27,012 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-23 15:26:27,012 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:26:27,012 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-07-23 15:26:27,013 INFO L450 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-07-23 15:26:27,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-07-23 15:26:27,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-07-23 15:26:27,014 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 129 states. [2018-07-23 15:26:28,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:26:28,419 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-07-23 15:26:28,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-07-23 15:26:28,419 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 256 [2018-07-23 15:26:28,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:26:28,420 INFO L225 Difference]: With dead ends: 261 [2018-07-23 15:26:28,420 INFO L226 Difference]: Without dead ends: 259 [2018-07-23 15:26:28,422 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-07-23 15:26:28,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-07-23 15:26:28,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-07-23 15:26:28,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-07-23 15:26:28,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2018-07-23 15:26:28,429 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 256 [2018-07-23 15:26:28,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:26:28,429 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2018-07-23 15:26:28,429 INFO L472 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-07-23 15:26:28,429 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2018-07-23 15:26:28,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-07-23 15:26:28,430 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:26:28,430 INFO L353 BasicCegarLoop]: trace histogram [128, 127, 1, 1, 1] [2018-07-23 15:26:28,430 INFO L414 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:26:28,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1464352627, now seen corresponding path program 127 times [2018-07-23 15:26:28,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:26:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:26:29,604 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-23 15:26:29,604 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:26:29,604 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-07-23 15:26:29,605 INFO L450 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-07-23 15:26:29,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-07-23 15:26:29,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-07-23 15:26:29,606 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 130 states. [2018-07-23 15:26:30,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:26:30,962 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-07-23 15:26:30,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-07-23 15:26:30,962 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 258 [2018-07-23 15:26:30,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:26:30,963 INFO L225 Difference]: With dead ends: 263 [2018-07-23 15:26:30,963 INFO L226 Difference]: Without dead ends: 261 [2018-07-23 15:26:30,965 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-07-23 15:26:30,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-07-23 15:26:30,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2018-07-23 15:26:30,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-07-23 15:26:30,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-07-23 15:26:30,972 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 258 [2018-07-23 15:26:30,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:26:30,972 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-07-23 15:26:30,972 INFO L472 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-07-23 15:26:30,973 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-07-23 15:26:30,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-07-23 15:26:30,973 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:26:30,973 INFO L353 BasicCegarLoop]: trace histogram [129, 128, 1, 1, 1] [2018-07-23 15:26:30,974 INFO L414 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:26:30,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1506450631, now seen corresponding path program 128 times [2018-07-23 15:26:30,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:26:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:26:31,994 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-23 15:26:31,995 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:26:31,995 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-07-23 15:26:31,995 INFO L450 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-07-23 15:26:31,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-07-23 15:26:31,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-07-23 15:26:31,997 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 131 states. [2018-07-23 15:26:33,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:26:33,476 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-07-23 15:26:33,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-07-23 15:26:33,476 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 260 [2018-07-23 15:26:33,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:26:33,477 INFO L225 Difference]: With dead ends: 265 [2018-07-23 15:26:33,477 INFO L226 Difference]: Without dead ends: 263 [2018-07-23 15:26:33,478 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-07-23 15:26:33,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-07-23 15:26:33,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-07-23 15:26:33,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-07-23 15:26:33,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-07-23 15:26:33,484 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 260 [2018-07-23 15:26:33,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:26:33,485 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-07-23 15:26:33,485 INFO L472 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-07-23 15:26:33,485 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-07-23 15:26:33,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-07-23 15:26:33,486 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:26:33,486 INFO L353 BasicCegarLoop]: trace histogram [130, 129, 1, 1, 1] [2018-07-23 15:26:33,486 INFO L414 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:26:33,487 INFO L82 PathProgramCache]: Analyzing trace with hash 295129729, now seen corresponding path program 129 times [2018-07-23 15:26:33,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:26:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:26:34,541 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-23 15:26:34,542 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:26:34,542 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-07-23 15:26:34,542 INFO L450 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-07-23 15:26:34,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-07-23 15:26:34,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-07-23 15:26:34,543 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 132 states. [2018-07-23 15:26:36,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:26:36,008 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-07-23 15:26:36,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-07-23 15:26:36,008 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 262 [2018-07-23 15:26:36,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:26:36,009 INFO L225 Difference]: With dead ends: 267 [2018-07-23 15:26:36,009 INFO L226 Difference]: Without dead ends: 265 [2018-07-23 15:26:36,011 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-07-23 15:26:36,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-07-23 15:26:36,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2018-07-23 15:26:36,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-07-23 15:26:36,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-07-23 15:26:36,018 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 262 [2018-07-23 15:26:36,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:26:36,018 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-07-23 15:26:36,018 INFO L472 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-07-23 15:26:36,018 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-07-23 15:26:36,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-07-23 15:26:36,019 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:26:36,019 INFO L353 BasicCegarLoop]: trace histogram [131, 130, 1, 1, 1] [2018-07-23 15:26:36,020 INFO L414 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:26:36,020 INFO L82 PathProgramCache]: Analyzing trace with hash 151880123, now seen corresponding path program 130 times [2018-07-23 15:26:36,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:26:36,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:26:37,166 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-23 15:26:37,167 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:26:37,167 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-07-23 15:26:37,167 INFO L450 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-07-23 15:26:37,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-07-23 15:26:37,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-07-23 15:26:37,168 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 133 states. [2018-07-23 15:26:38,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:26:38,592 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-07-23 15:26:38,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-07-23 15:26:38,592 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 264 [2018-07-23 15:26:38,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:26:38,593 INFO L225 Difference]: With dead ends: 269 [2018-07-23 15:26:38,593 INFO L226 Difference]: Without dead ends: 267 [2018-07-23 15:26:38,594 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-07-23 15:26:38,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-07-23 15:26:38,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-07-23 15:26:38,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-07-23 15:26:38,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-07-23 15:26:38,600 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 264 [2018-07-23 15:26:38,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:26:38,601 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-07-23 15:26:38,601 INFO L472 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-07-23 15:26:38,601 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-07-23 15:26:38,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-07-23 15:26:38,601 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:26:38,602 INFO L353 BasicCegarLoop]: trace histogram [132, 131, 1, 1, 1] [2018-07-23 15:26:38,602 INFO L414 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:26:38,602 INFO L82 PathProgramCache]: Analyzing trace with hash -72037771, now seen corresponding path program 131 times [2018-07-23 15:26:38,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:26:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:26:39,683 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-23 15:26:39,684 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:26:39,684 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-07-23 15:26:39,684 INFO L450 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-07-23 15:26:39,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-07-23 15:26:39,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-07-23 15:26:39,686 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 134 states. [2018-07-23 15:26:41,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:26:41,212 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-07-23 15:26:41,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-07-23 15:26:41,213 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 266 [2018-07-23 15:26:41,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:26:41,213 INFO L225 Difference]: With dead ends: 271 [2018-07-23 15:26:41,213 INFO L226 Difference]: Without dead ends: 269 [2018-07-23 15:26:41,215 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-07-23 15:26:41,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-07-23 15:26:41,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-07-23 15:26:41,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-07-23 15:26:41,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-07-23 15:26:41,221 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 266 [2018-07-23 15:26:41,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:26:41,222 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-07-23 15:26:41,222 INFO L472 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-07-23 15:26:41,222 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-07-23 15:26:41,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-07-23 15:26:41,223 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:26:41,223 INFO L353 BasicCegarLoop]: trace histogram [133, 132, 1, 1, 1] [2018-07-23 15:26:41,223 INFO L414 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:26:41,223 INFO L82 PathProgramCache]: Analyzing trace with hash -508769105, now seen corresponding path program 132 times [2018-07-23 15:26:41,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:26:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:26:42,367 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-23 15:26:42,368 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:26:42,368 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-07-23 15:26:42,368 INFO L450 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-07-23 15:26:42,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-07-23 15:26:42,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-07-23 15:26:42,369 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 135 states. [2018-07-23 15:26:43,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:26:43,881 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-07-23 15:26:43,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-07-23 15:26:43,882 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 268 [2018-07-23 15:26:43,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:26:43,882 INFO L225 Difference]: With dead ends: 273 [2018-07-23 15:26:43,883 INFO L226 Difference]: Without dead ends: 271 [2018-07-23 15:26:43,884 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-07-23 15:26:43,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-07-23 15:26:43,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-07-23 15:26:43,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-07-23 15:26:43,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-07-23 15:26:43,891 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 268 [2018-07-23 15:26:43,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:26:43,891 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-07-23 15:26:43,891 INFO L472 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-07-23 15:26:43,891 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-07-23 15:26:43,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-07-23 15:26:43,892 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:26:43,892 INFO L353 BasicCegarLoop]: trace histogram [134, 133, 1, 1, 1] [2018-07-23 15:26:43,892 INFO L414 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:26:43,892 INFO L82 PathProgramCache]: Analyzing trace with hash 699213929, now seen corresponding path program 133 times [2018-07-23 15:26:43,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:26:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:26:45,021 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-23 15:26:45,021 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:26:45,021 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-07-23 15:26:45,022 INFO L450 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-07-23 15:26:45,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-07-23 15:26:45,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-07-23 15:26:45,023 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 136 states. [2018-07-23 15:26:46,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:26:46,487 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-07-23 15:26:46,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-07-23 15:26:46,487 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 270 [2018-07-23 15:26:46,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:26:46,488 INFO L225 Difference]: With dead ends: 275 [2018-07-23 15:26:46,488 INFO L226 Difference]: Without dead ends: 273 [2018-07-23 15:26:46,489 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-07-23 15:26:46,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-07-23 15:26:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-07-23 15:26:46,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-07-23 15:26:46,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-07-23 15:26:46,495 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 270 [2018-07-23 15:26:46,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:26:46,495 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-07-23 15:26:46,495 INFO L472 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-07-23 15:26:46,495 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-07-23 15:26:46,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-07-23 15:26:46,496 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:26:46,496 INFO L353 BasicCegarLoop]: trace histogram [135, 134, 1, 1, 1] [2018-07-23 15:26:46,496 INFO L414 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:26:46,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1929739683, now seen corresponding path program 134 times [2018-07-23 15:26:46,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:26:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:26:47,715 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-23 15:26:47,715 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:26:47,715 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-07-23 15:26:47,716 INFO L450 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-07-23 15:26:47,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-07-23 15:26:47,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-07-23 15:26:47,717 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 137 states. [2018-07-23 15:26:49,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:26:49,284 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2018-07-23 15:26:49,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-07-23 15:26:49,284 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 272 [2018-07-23 15:26:49,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:26:49,285 INFO L225 Difference]: With dead ends: 277 [2018-07-23 15:26:49,285 INFO L226 Difference]: Without dead ends: 275 [2018-07-23 15:26:49,287 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-07-23 15:26:49,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-07-23 15:26:49,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-07-23 15:26:49,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-07-23 15:26:49,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-07-23 15:26:49,298 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 272 [2018-07-23 15:26:49,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:26:49,299 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-07-23 15:26:49,299 INFO L472 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-07-23 15:26:49,299 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-07-23 15:26:49,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-07-23 15:26:49,300 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:26:49,300 INFO L353 BasicCegarLoop]: trace histogram [136, 135, 1, 1, 1] [2018-07-23 15:26:49,300 INFO L414 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:26:49,300 INFO L82 PathProgramCache]: Analyzing trace with hash -945984419, now seen corresponding path program 135 times [2018-07-23 15:26:49,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:26:49,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:26:50,833 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-23 15:26:50,834 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:26:50,834 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-07-23 15:26:50,834 INFO L450 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-07-23 15:26:50,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-07-23 15:26:50,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-07-23 15:26:50,836 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 138 states. [2018-07-23 15:26:52,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:26:52,416 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-07-23 15:26:52,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-07-23 15:26:52,417 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 274 [2018-07-23 15:26:52,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:26:52,417 INFO L225 Difference]: With dead ends: 279 [2018-07-23 15:26:52,417 INFO L226 Difference]: Without dead ends: 277 [2018-07-23 15:26:52,419 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-07-23 15:26:52,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-07-23 15:26:52,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-07-23 15:26:52,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-07-23 15:26:52,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-07-23 15:26:52,426 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 274 [2018-07-23 15:26:52,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:26:52,426 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-07-23 15:26:52,426 INFO L472 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-07-23 15:26:52,426 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-07-23 15:26:52,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-07-23 15:26:52,427 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:26:52,427 INFO L353 BasicCegarLoop]: trace histogram [137, 136, 1, 1, 1] [2018-07-23 15:26:52,427 INFO L414 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:26:52,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1442092183, now seen corresponding path program 136 times [2018-07-23 15:26:52,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:26:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:26:53,597 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-23 15:26:53,597 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:26:53,598 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-07-23 15:26:53,598 INFO L450 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-07-23 15:26:53,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-07-23 15:26:53,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=18907, Unknown=0, NotChecked=0, Total=19182 [2018-07-23 15:26:53,599 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 139 states. [2018-07-23 15:26:55,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:26:55,240 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-07-23 15:26:55,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-07-23 15:26:55,241 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 276 [2018-07-23 15:26:55,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:26:55,241 INFO L225 Difference]: With dead ends: 281 [2018-07-23 15:26:55,241 INFO L226 Difference]: Without dead ends: 279 [2018-07-23 15:26:55,242 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=275, Invalid=18907, Unknown=0, NotChecked=0, Total=19182 [2018-07-23 15:26:55,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-07-23 15:26:55,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-07-23 15:26:55,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-07-23 15:26:55,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 279 transitions. [2018-07-23 15:26:55,252 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 279 transitions. Word has length 276 [2018-07-23 15:26:55,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:26:55,253 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 279 transitions. [2018-07-23 15:26:55,253 INFO L472 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-07-23 15:26:55,253 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 279 transitions. [2018-07-23 15:26:55,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-07-23 15:26:55,254 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:26:55,254 INFO L353 BasicCegarLoop]: trace histogram [138, 137, 1, 1, 1] [2018-07-23 15:26:55,254 INFO L414 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:26:55,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1423796655, now seen corresponding path program 137 times [2018-07-23 15:26:55,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:26:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:26:56,438 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-23 15:26:56,438 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:26:56,438 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-07-23 15:26:56,438 INFO L450 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-07-23 15:26:56,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-07-23 15:26:56,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-07-23 15:26:56,440 INFO L87 Difference]: Start difference. First operand 279 states and 279 transitions. Second operand 140 states. [2018-07-23 15:26:58,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:26:58,069 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-07-23 15:26:58,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-07-23 15:26:58,069 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 278 [2018-07-23 15:26:58,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:26:58,070 INFO L225 Difference]: With dead ends: 283 [2018-07-23 15:26:58,070 INFO L226 Difference]: Without dead ends: 281 [2018-07-23 15:26:58,071 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-07-23 15:26:58,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-07-23 15:26:58,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-07-23 15:26:58,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-07-23 15:26:58,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-07-23 15:26:58,078 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 278 [2018-07-23 15:26:58,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:26:58,079 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-07-23 15:26:58,079 INFO L472 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-07-23 15:26:58,079 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-07-23 15:26:58,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-07-23 15:26:58,079 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:26:58,080 INFO L353 BasicCegarLoop]: trace histogram [139, 138, 1, 1, 1] [2018-07-23 15:26:58,080 INFO L414 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:26:58,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1826034059, now seen corresponding path program 138 times [2018-07-23 15:26:58,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:26:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:26:59,297 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-23 15:26:59,297 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:26:59,297 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-07-23 15:26:59,298 INFO L450 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-07-23 15:26:59,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-07-23 15:26:59,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=19461, Unknown=0, NotChecked=0, Total=19740 [2018-07-23 15:26:59,299 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 141 states. [2018-07-23 15:27:00,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:27:00,958 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-07-23 15:27:00,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-07-23 15:27:00,958 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 280 [2018-07-23 15:27:00,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:27:00,959 INFO L225 Difference]: With dead ends: 285 [2018-07-23 15:27:00,959 INFO L226 Difference]: Without dead ends: 283 [2018-07-23 15:27:00,960 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=279, Invalid=19461, Unknown=0, NotChecked=0, Total=19740 [2018-07-23 15:27:00,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-07-23 15:27:00,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-07-23 15:27:00,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-07-23 15:27:00,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-07-23 15:27:00,968 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 280 [2018-07-23 15:27:00,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:27:00,968 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-07-23 15:27:00,968 INFO L472 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-07-23 15:27:00,968 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-07-23 15:27:00,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-07-23 15:27:00,969 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:27:00,969 INFO L353 BasicCegarLoop]: trace histogram [140, 139, 1, 1, 1] [2018-07-23 15:27:00,969 INFO L414 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:27:00,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1822841275, now seen corresponding path program 139 times [2018-07-23 15:27:00,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:27:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:27:02,170 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-23 15:27:02,171 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:27:02,171 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-07-23 15:27:02,171 INFO L450 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-07-23 15:27:02,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-07-23 15:27:02,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-07-23 15:27:02,172 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 142 states. [2018-07-23 15:27:03,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:27:03,818 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-07-23 15:27:03,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-07-23 15:27:03,818 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 282 [2018-07-23 15:27:03,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:27:03,819 INFO L225 Difference]: With dead ends: 287 [2018-07-23 15:27:03,819 INFO L226 Difference]: Without dead ends: 285 [2018-07-23 15:27:03,820 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-07-23 15:27:03,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-07-23 15:27:03,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-07-23 15:27:03,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-07-23 15:27:03,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-07-23 15:27:03,826 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 282 [2018-07-23 15:27:03,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:27:03,826 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-07-23 15:27:03,826 INFO L472 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-07-23 15:27:03,826 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-07-23 15:27:03,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-07-23 15:27:03,827 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:27:03,827 INFO L353 BasicCegarLoop]: trace histogram [141, 140, 1, 1, 1] [2018-07-23 15:27:03,827 INFO L414 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:27:03,827 INFO L82 PathProgramCache]: Analyzing trace with hash 596243583, now seen corresponding path program 140 times [2018-07-23 15:27:03,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:27:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:27:05,035 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-23 15:27:05,036 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:27:05,036 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-07-23 15:27:05,036 INFO L450 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-07-23 15:27:05,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-07-23 15:27:05,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-07-23 15:27:05,037 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 143 states. [2018-07-23 15:27:06,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:27:06,811 INFO L93 Difference]: Finished difference Result 289 states and 289 transitions. [2018-07-23 15:27:06,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-07-23 15:27:06,811 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 284 [2018-07-23 15:27:06,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:27:06,812 INFO L225 Difference]: With dead ends: 289 [2018-07-23 15:27:06,812 INFO L226 Difference]: Without dead ends: 287 [2018-07-23 15:27:06,812 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-07-23 15:27:06,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-07-23 15:27:06,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-07-23 15:27:06,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-07-23 15:27:06,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-07-23 15:27:06,821 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 284 [2018-07-23 15:27:06,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:27:06,821 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-07-23 15:27:06,821 INFO L472 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-07-23 15:27:06,821 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-07-23 15:27:06,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-07-23 15:27:06,822 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:27:06,822 INFO L353 BasicCegarLoop]: trace histogram [142, 141, 1, 1, 1] [2018-07-23 15:27:06,822 INFO L414 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:27:06,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1759484985, now seen corresponding path program 141 times [2018-07-23 15:27:06,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:27:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:27:08,371 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-23 15:27:08,371 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:27:08,371 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-07-23 15:27:08,371 INFO L450 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-07-23 15:27:08,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-07-23 15:27:08,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=20307, Unknown=0, NotChecked=0, Total=20592 [2018-07-23 15:27:08,373 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 144 states. [2018-07-23 15:27:10,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:27:10,110 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-07-23 15:27:10,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-07-23 15:27:10,110 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 286 [2018-07-23 15:27:10,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:27:10,111 INFO L225 Difference]: With dead ends: 291 [2018-07-23 15:27:10,111 INFO L226 Difference]: Without dead ends: 289 [2018-07-23 15:27:10,112 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=285, Invalid=20307, Unknown=0, NotChecked=0, Total=20592 [2018-07-23 15:27:10,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-07-23 15:27:10,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2018-07-23 15:27:10,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-07-23 15:27:10,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-07-23 15:27:10,119 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 286 [2018-07-23 15:27:10,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:27:10,120 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-07-23 15:27:10,120 INFO L472 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-07-23 15:27:10,120 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-07-23 15:27:10,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-07-23 15:27:10,121 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:27:10,121 INFO L353 BasicCegarLoop]: trace histogram [143, 142, 1, 1, 1] [2018-07-23 15:27:10,121 INFO L414 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:27:10,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1351991949, now seen corresponding path program 142 times [2018-07-23 15:27:10,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:27:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:27:11,508 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-23 15:27:11,508 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:27:11,508 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-07-23 15:27:11,508 INFO L450 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-07-23 15:27:11,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-07-23 15:27:11,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=20593, Unknown=0, NotChecked=0, Total=20880 [2018-07-23 15:27:11,510 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 145 states. [2018-07-23 15:27:13,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:27:13,276 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-07-23 15:27:13,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-07-23 15:27:13,276 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 288 [2018-07-23 15:27:13,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:27:13,277 INFO L225 Difference]: With dead ends: 293 [2018-07-23 15:27:13,277 INFO L226 Difference]: Without dead ends: 291 [2018-07-23 15:27:13,278 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=287, Invalid=20593, Unknown=0, NotChecked=0, Total=20880 [2018-07-23 15:27:13,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-07-23 15:27:13,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2018-07-23 15:27:13,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-07-23 15:27:13,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-07-23 15:27:13,285 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 288 [2018-07-23 15:27:13,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:27:13,285 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-07-23 15:27:13,285 INFO L472 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-07-23 15:27:13,286 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-07-23 15:27:13,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-07-23 15:27:13,286 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:27:13,286 INFO L353 BasicCegarLoop]: trace histogram [144, 143, 1, 1, 1] [2018-07-23 15:27:13,287 INFO L414 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:27:13,287 INFO L82 PathProgramCache]: Analyzing trace with hash 2110879789, now seen corresponding path program 143 times [2018-07-23 15:27:13,287 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:27:13,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:27:14,616 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-23 15:27:14,616 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:27:14,617 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-07-23 15:27:14,617 INFO L450 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-07-23 15:27:14,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-07-23 15:27:14,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=20881, Unknown=0, NotChecked=0, Total=21170 [2018-07-23 15:27:14,618 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 146 states. [2018-07-23 15:27:16,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:27:16,366 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-07-23 15:27:16,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-07-23 15:27:16,367 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 290 [2018-07-23 15:27:16,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:27:16,367 INFO L225 Difference]: With dead ends: 295 [2018-07-23 15:27:16,367 INFO L226 Difference]: Without dead ends: 293 [2018-07-23 15:27:16,368 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=289, Invalid=20881, Unknown=0, NotChecked=0, Total=21170 [2018-07-23 15:27:16,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-07-23 15:27:16,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-07-23 15:27:16,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-07-23 15:27:16,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-07-23 15:27:16,375 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 290 [2018-07-23 15:27:16,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:27:16,376 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-07-23 15:27:16,376 INFO L472 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-07-23 15:27:16,376 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-07-23 15:27:16,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-07-23 15:27:16,376 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:27:16,377 INFO L353 BasicCegarLoop]: trace histogram [145, 144, 1, 1, 1] [2018-07-23 15:27:16,377 INFO L414 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:27:16,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1330965607, now seen corresponding path program 144 times [2018-07-23 15:27:16,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:27:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:27:17,583 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-23 15:27:17,584 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:27:17,584 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-07-23 15:27:17,584 INFO L450 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-07-23 15:27:17,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-07-23 15:27:17,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=21171, Unknown=0, NotChecked=0, Total=21462 [2018-07-23 15:27:17,586 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 147 states. [2018-07-23 15:27:19,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:27:19,493 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2018-07-23 15:27:19,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-07-23 15:27:19,493 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 292 [2018-07-23 15:27:19,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:27:19,494 INFO L225 Difference]: With dead ends: 297 [2018-07-23 15:27:19,494 INFO L226 Difference]: Without dead ends: 295 [2018-07-23 15:27:19,495 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=291, Invalid=21171, Unknown=0, NotChecked=0, Total=21462 [2018-07-23 15:27:19,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-07-23 15:27:19,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-07-23 15:27:19,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-07-23 15:27:19,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2018-07-23 15:27:19,502 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 292 [2018-07-23 15:27:19,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:27:19,502 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2018-07-23 15:27:19,502 INFO L472 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-07-23 15:27:19,503 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2018-07-23 15:27:19,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-07-23 15:27:19,503 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:27:19,503 INFO L353 BasicCegarLoop]: trace histogram [146, 145, 1, 1, 1] [2018-07-23 15:27:19,504 INFO L414 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:27:19,504 INFO L82 PathProgramCache]: Analyzing trace with hash -842253791, now seen corresponding path program 145 times [2018-07-23 15:27:19,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:27:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:27:20,813 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-23 15:27:20,813 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:27:20,813 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-07-23 15:27:20,814 INFO L450 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-07-23 15:27:20,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-07-23 15:27:20,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=21463, Unknown=0, NotChecked=0, Total=21756 [2018-07-23 15:27:20,815 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 148 states. [2018-07-23 15:27:22,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:27:22,685 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-07-23 15:27:22,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-07-23 15:27:22,686 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 294 [2018-07-23 15:27:22,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:27:22,686 INFO L225 Difference]: With dead ends: 299 [2018-07-23 15:27:22,686 INFO L226 Difference]: Without dead ends: 297 [2018-07-23 15:27:22,688 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=293, Invalid=21463, Unknown=0, NotChecked=0, Total=21756 [2018-07-23 15:27:22,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-07-23 15:27:22,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2018-07-23 15:27:22,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-07-23 15:27:22,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-07-23 15:27:22,695 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 294 [2018-07-23 15:27:22,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:27:22,696 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-07-23 15:27:22,696 INFO L472 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-07-23 15:27:22,696 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-07-23 15:27:22,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-07-23 15:27:22,697 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:27:22,697 INFO L353 BasicCegarLoop]: trace histogram [147, 146, 1, 1, 1] [2018-07-23 15:27:22,697 INFO L414 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:27:22,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1951989413, now seen corresponding path program 146 times [2018-07-23 15:27:22,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:27:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:27:24,151 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-23 15:27:24,151 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:27:24,151 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-07-23 15:27:24,152 INFO L450 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-07-23 15:27:24,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-07-23 15:27:24,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=21757, Unknown=0, NotChecked=0, Total=22052 [2018-07-23 15:27:24,154 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 149 states. [2018-07-23 15:27:26,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:27:26,037 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2018-07-23 15:27:26,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-07-23 15:27:26,037 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 296 [2018-07-23 15:27:26,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:27:26,038 INFO L225 Difference]: With dead ends: 301 [2018-07-23 15:27:26,038 INFO L226 Difference]: Without dead ends: 299 [2018-07-23 15:27:26,041 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=295, Invalid=21757, Unknown=0, NotChecked=0, Total=22052 [2018-07-23 15:27:26,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-07-23 15:27:26,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2018-07-23 15:27:26,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-07-23 15:27:26,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2018-07-23 15:27:26,053 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 296 [2018-07-23 15:27:26,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:27:26,053 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2018-07-23 15:27:26,053 INFO L472 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-07-23 15:27:26,053 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2018-07-23 15:27:26,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-07-23 15:27:26,055 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:27:26,055 INFO L353 BasicCegarLoop]: trace histogram [148, 147, 1, 1, 1] [2018-07-23 15:27:26,055 INFO L414 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:27:26,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1038934549, now seen corresponding path program 147 times [2018-07-23 15:27:26,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:27:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:27:27,854 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-23 15:27:27,854 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:27:27,854 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-07-23 15:27:27,854 INFO L450 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-07-23 15:27:27,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-07-23 15:27:27,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=22053, Unknown=0, NotChecked=0, Total=22350 [2018-07-23 15:27:27,855 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 150 states. [2018-07-23 15:27:29,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:27:29,701 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-07-23 15:27:29,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-07-23 15:27:29,702 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 298 [2018-07-23 15:27:29,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:27:29,702 INFO L225 Difference]: With dead ends: 303 [2018-07-23 15:27:29,702 INFO L226 Difference]: Without dead ends: 301 [2018-07-23 15:27:29,704 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=297, Invalid=22053, Unknown=0, NotChecked=0, Total=22350 [2018-07-23 15:27:29,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-07-23 15:27:29,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-07-23 15:27:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-07-23 15:27:29,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-07-23 15:27:29,711 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 298 [2018-07-23 15:27:29,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:27:29,711 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-07-23 15:27:29,711 INFO L472 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-07-23 15:27:29,711 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-07-23 15:27:29,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-07-23 15:27:29,712 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:27:29,712 INFO L353 BasicCegarLoop]: trace histogram [149, 148, 1, 1, 1] [2018-07-23 15:27:29,712 INFO L414 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:27:29,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1983741007, now seen corresponding path program 148 times [2018-07-23 15:27:29,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:27:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:27:31,039 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-23 15:27:31,039 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:27:31,039 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-07-23 15:27:31,040 INFO L450 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-07-23 15:27:31,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-07-23 15:27:31,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=22351, Unknown=0, NotChecked=0, Total=22650 [2018-07-23 15:27:31,041 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 151 states. [2018-07-23 15:27:32,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:27:32,996 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-07-23 15:27:32,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-07-23 15:27:32,996 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 300 [2018-07-23 15:27:32,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:27:32,997 INFO L225 Difference]: With dead ends: 305 [2018-07-23 15:27:32,997 INFO L226 Difference]: Without dead ends: 303 [2018-07-23 15:27:32,998 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=299, Invalid=22351, Unknown=0, NotChecked=0, Total=22650 [2018-07-23 15:27:32,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-07-23 15:27:33,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-07-23 15:27:33,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-07-23 15:27:33,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2018-07-23 15:27:33,005 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 300 [2018-07-23 15:27:33,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:27:33,006 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2018-07-23 15:27:33,006 INFO L472 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-07-23 15:27:33,006 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2018-07-23 15:27:33,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-07-23 15:27:33,007 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:27:33,007 INFO L353 BasicCegarLoop]: trace histogram [150, 149, 1, 1, 1] [2018-07-23 15:27:33,007 INFO L414 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:27:33,007 INFO L82 PathProgramCache]: Analyzing trace with hash -590319607, now seen corresponding path program 149 times [2018-07-23 15:27:33,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:27:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:27:34,384 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-23 15:27:34,385 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:27:34,385 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-07-23 15:27:34,385 INFO L450 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-07-23 15:27:34,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-07-23 15:27:34,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=22651, Unknown=0, NotChecked=0, Total=22952 [2018-07-23 15:27:34,386 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 152 states. [2018-07-23 15:27:36,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:27:36,420 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-07-23 15:27:36,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-07-23 15:27:36,421 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 302 [2018-07-23 15:27:36,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:27:36,421 INFO L225 Difference]: With dead ends: 307 [2018-07-23 15:27:36,422 INFO L226 Difference]: Without dead ends: 305 [2018-07-23 15:27:36,422 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=301, Invalid=22651, Unknown=0, NotChecked=0, Total=22952 [2018-07-23 15:27:36,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-07-23 15:27:36,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2018-07-23 15:27:36,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-07-23 15:27:36,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-07-23 15:27:36,432 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 302 [2018-07-23 15:27:36,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:27:36,432 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-07-23 15:27:36,432 INFO L472 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-07-23 15:27:36,432 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-07-23 15:27:36,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-07-23 15:27:36,433 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:27:36,433 INFO L353 BasicCegarLoop]: trace histogram [151, 150, 1, 1, 1] [2018-07-23 15:27:36,433 INFO L414 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:27:36,433 INFO L82 PathProgramCache]: Analyzing trace with hash -361407165, now seen corresponding path program 150 times [2018-07-23 15:27:36,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:27:36,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:27:37,715 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-23 15:27:37,715 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:27:37,715 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-07-23 15:27:37,716 INFO L450 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-07-23 15:27:37,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-07-23 15:27:37,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=22953, Unknown=0, NotChecked=0, Total=23256 [2018-07-23 15:27:37,717 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 153 states. [2018-07-23 15:27:39,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:27:39,841 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2018-07-23 15:27:39,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-07-23 15:27:39,842 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 304 [2018-07-23 15:27:39,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:27:39,842 INFO L225 Difference]: With dead ends: 309 [2018-07-23 15:27:39,842 INFO L226 Difference]: Without dead ends: 307 [2018-07-23 15:27:39,843 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=303, Invalid=22953, Unknown=0, NotChecked=0, Total=23256 [2018-07-23 15:27:39,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-07-23 15:27:39,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-07-23 15:27:39,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-07-23 15:27:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2018-07-23 15:27:39,851 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 304 [2018-07-23 15:27:39,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:27:39,851 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2018-07-23 15:27:39,851 INFO L472 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-07-23 15:27:39,851 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2018-07-23 15:27:39,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-07-23 15:27:39,852 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:27:39,852 INFO L353 BasicCegarLoop]: trace histogram [152, 151, 1, 1, 1] [2018-07-23 15:27:39,852 INFO L414 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:27:39,852 INFO L82 PathProgramCache]: Analyzing trace with hash 580117501, now seen corresponding path program 151 times [2018-07-23 15:27:39,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:27:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:27:41,213 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-23 15:27:41,213 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:27:41,213 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-07-23 15:27:41,213 INFO L450 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-07-23 15:27:41,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-07-23 15:27:41,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=23257, Unknown=0, NotChecked=0, Total=23562 [2018-07-23 15:27:41,215 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 154 states. [2018-07-23 15:27:43,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:27:43,302 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-07-23 15:27:43,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-07-23 15:27:43,303 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 306 [2018-07-23 15:27:43,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:27:43,304 INFO L225 Difference]: With dead ends: 311 [2018-07-23 15:27:43,304 INFO L226 Difference]: Without dead ends: 309 [2018-07-23 15:27:43,306 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=305, Invalid=23257, Unknown=0, NotChecked=0, Total=23562 [2018-07-23 15:27:43,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-07-23 15:27:43,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2018-07-23 15:27:43,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-07-23 15:27:43,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2018-07-23 15:27:43,318 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 306 [2018-07-23 15:27:43,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:27:43,318 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2018-07-23 15:27:43,318 INFO L472 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-07-23 15:27:43,318 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2018-07-23 15:27:43,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-07-23 15:27:43,319 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:27:43,320 INFO L353 BasicCegarLoop]: trace histogram [153, 152, 1, 1, 1] [2018-07-23 15:27:43,320 INFO L414 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:27:43,320 INFO L82 PathProgramCache]: Analyzing trace with hash -852777929, now seen corresponding path program 152 times [2018-07-23 15:27:43,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:27:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:27:45,345 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-23 15:27:45,346 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:27:45,346 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2018-07-23 15:27:45,346 INFO L450 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-07-23 15:27:45,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-07-23 15:27:45,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=23563, Unknown=0, NotChecked=0, Total=23870 [2018-07-23 15:27:45,347 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 155 states. [2018-07-23 15:27:47,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:27:47,490 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2018-07-23 15:27:47,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-07-23 15:27:47,490 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 308 [2018-07-23 15:27:47,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:27:47,491 INFO L225 Difference]: With dead ends: 313 [2018-07-23 15:27:47,491 INFO L226 Difference]: Without dead ends: 311 [2018-07-23 15:27:47,493 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=307, Invalid=23563, Unknown=0, NotChecked=0, Total=23870 [2018-07-23 15:27:47,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-07-23 15:27:47,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2018-07-23 15:27:47,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-07-23 15:27:47,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-07-23 15:27:47,502 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 308 [2018-07-23 15:27:47,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:27:47,502 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-07-23 15:27:47,502 INFO L472 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-07-23 15:27:47,502 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-07-23 15:27:47,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-07-23 15:27:47,503 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:27:47,503 INFO L353 BasicCegarLoop]: trace histogram [154, 153, 1, 1, 1] [2018-07-23 15:27:47,503 INFO L414 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:27:47,504 INFO L82 PathProgramCache]: Analyzing trace with hash 819215857, now seen corresponding path program 153 times [2018-07-23 15:27:47,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:27:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:27:49,120 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-23 15:27:49,121 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:27:49,121 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-07-23 15:27:49,121 INFO L450 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-07-23 15:27:49,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-07-23 15:27:49,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=23871, Unknown=0, NotChecked=0, Total=24180 [2018-07-23 15:27:49,123 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 156 states. [2018-07-23 15:27:51,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:27:51,238 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2018-07-23 15:27:51,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-07-23 15:27:51,238 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 310 [2018-07-23 15:27:51,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:27:51,239 INFO L225 Difference]: With dead ends: 315 [2018-07-23 15:27:51,239 INFO L226 Difference]: Without dead ends: 313 [2018-07-23 15:27:51,240 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=309, Invalid=23871, Unknown=0, NotChecked=0, Total=24180 [2018-07-23 15:27:51,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-07-23 15:27:51,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2018-07-23 15:27:51,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-07-23 15:27:51,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2018-07-23 15:27:51,248 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 310 [2018-07-23 15:27:51,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:27:51,248 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2018-07-23 15:27:51,248 INFO L472 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-07-23 15:27:51,249 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2018-07-23 15:27:51,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-07-23 15:27:51,249 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:27:51,249 INFO L353 BasicCegarLoop]: trace histogram [155, 154, 1, 1, 1] [2018-07-23 15:27:51,250 INFO L414 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:27:51,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1287475499, now seen corresponding path program 154 times [2018-07-23 15:27:51,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:27:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:27:52,872 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-23 15:27:52,873 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:27:52,873 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2018-07-23 15:27:52,873 INFO L450 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-07-23 15:27:52,873 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-07-23 15:27:52,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=24181, Unknown=0, NotChecked=0, Total=24492 [2018-07-23 15:27:52,875 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 157 states. [2018-07-23 15:27:54,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:27:54,967 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2018-07-23 15:27:54,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-07-23 15:27:54,967 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 312 [2018-07-23 15:27:54,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:27:54,968 INFO L225 Difference]: With dead ends: 317 [2018-07-23 15:27:54,968 INFO L226 Difference]: Without dead ends: 315 [2018-07-23 15:27:54,969 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=311, Invalid=24181, Unknown=0, NotChecked=0, Total=24492 [2018-07-23 15:27:54,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-07-23 15:27:54,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2018-07-23 15:27:54,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-07-23 15:27:54,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 315 transitions. [2018-07-23 15:27:54,982 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 315 transitions. Word has length 312 [2018-07-23 15:27:54,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:27:54,982 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 315 transitions. [2018-07-23 15:27:54,982 INFO L472 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-07-23 15:27:54,982 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 315 transitions. [2018-07-23 15:27:54,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-07-23 15:27:54,984 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:27:54,984 INFO L353 BasicCegarLoop]: trace histogram [156, 155, 1, 1, 1] [2018-07-23 15:27:54,984 INFO L414 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:27:54,984 INFO L82 PathProgramCache]: Analyzing trace with hash 313425381, now seen corresponding path program 155 times [2018-07-23 15:27:54,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:27:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:27:56,771 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-23 15:27:56,771 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:27:56,771 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2018-07-23 15:27:56,772 INFO L450 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-07-23 15:27:56,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-07-23 15:27:56,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=24493, Unknown=0, NotChecked=0, Total=24806 [2018-07-23 15:27:56,772 INFO L87 Difference]: Start difference. First operand 315 states and 315 transitions. Second operand 158 states. [2018-07-23 15:27:58,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:27:58,862 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2018-07-23 15:27:58,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-07-23 15:27:58,862 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 314 [2018-07-23 15:27:58,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:27:58,863 INFO L225 Difference]: With dead ends: 319 [2018-07-23 15:27:58,863 INFO L226 Difference]: Without dead ends: 317 [2018-07-23 15:27:58,864 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=313, Invalid=24493, Unknown=0, NotChecked=0, Total=24806 [2018-07-23 15:27:58,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-07-23 15:27:58,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2018-07-23 15:27:58,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-07-23 15:27:58,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2018-07-23 15:27:58,872 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 314 [2018-07-23 15:27:58,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:27:58,872 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2018-07-23 15:27:58,872 INFO L472 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-07-23 15:27:58,872 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2018-07-23 15:27:58,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-07-23 15:27:58,873 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:27:58,873 INFO L353 BasicCegarLoop]: trace histogram [157, 156, 1, 1, 1] [2018-07-23 15:27:58,873 INFO L414 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:27:58,873 INFO L82 PathProgramCache]: Analyzing trace with hash 554132511, now seen corresponding path program 156 times [2018-07-23 15:27:58,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:27:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:00,482 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-23 15:28:00,483 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:28:00,483 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2018-07-23 15:28:00,483 INFO L450 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-07-23 15:28:00,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-07-23 15:28:00,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=24807, Unknown=0, NotChecked=0, Total=25122 [2018-07-23 15:28:00,485 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 159 states. [2018-07-23 15:28:02,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:02,699 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2018-07-23 15:28:02,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-07-23 15:28:02,699 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 316 [2018-07-23 15:28:02,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:02,700 INFO L225 Difference]: With dead ends: 321 [2018-07-23 15:28:02,700 INFO L226 Difference]: Without dead ends: 319 [2018-07-23 15:28:02,701 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=315, Invalid=24807, Unknown=0, NotChecked=0, Total=25122 [2018-07-23 15:28:02,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-07-23 15:28:02,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2018-07-23 15:28:02,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-07-23 15:28:02,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 319 transitions. [2018-07-23 15:28:02,709 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 319 transitions. Word has length 316 [2018-07-23 15:28:02,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:02,709 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 319 transitions. [2018-07-23 15:28:02,709 INFO L472 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-07-23 15:28:02,709 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 319 transitions. [2018-07-23 15:28:02,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-07-23 15:28:02,710 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:02,710 INFO L353 BasicCegarLoop]: trace histogram [158, 157, 1, 1, 1] [2018-07-23 15:28:02,710 INFO L414 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:02,711 INFO L82 PathProgramCache]: Analyzing trace with hash -54549543, now seen corresponding path program 157 times [2018-07-23 15:28:02,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:04,298 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-23 15:28:04,298 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:28:04,298 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-07-23 15:28:04,299 INFO L450 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-07-23 15:28:04,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-07-23 15:28:04,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=25123, Unknown=0, NotChecked=0, Total=25440 [2018-07-23 15:28:04,300 INFO L87 Difference]: Start difference. First operand 319 states and 319 transitions. Second operand 160 states. [2018-07-23 15:28:06,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:06,516 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-07-23 15:28:06,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-07-23 15:28:06,516 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 318 [2018-07-23 15:28:06,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:06,517 INFO L225 Difference]: With dead ends: 323 [2018-07-23 15:28:06,517 INFO L226 Difference]: Without dead ends: 321 [2018-07-23 15:28:06,518 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=317, Invalid=25123, Unknown=0, NotChecked=0, Total=25440 [2018-07-23 15:28:06,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-07-23 15:28:06,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2018-07-23 15:28:06,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-07-23 15:28:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2018-07-23 15:28:06,526 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 318 [2018-07-23 15:28:06,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:06,526 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2018-07-23 15:28:06,526 INFO L472 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-07-23 15:28:06,526 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2018-07-23 15:28:06,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-07-23 15:28:06,527 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:06,527 INFO L353 BasicCegarLoop]: trace histogram [159, 158, 1, 1, 1] [2018-07-23 15:28:06,527 INFO L414 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:06,527 INFO L82 PathProgramCache]: Analyzing trace with hash -882451181, now seen corresponding path program 158 times [2018-07-23 15:28:06,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:08,109 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-23 15:28:08,109 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:28:08,109 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2018-07-23 15:28:08,109 INFO L450 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-07-23 15:28:08,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-07-23 15:28:08,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=25441, Unknown=0, NotChecked=0, Total=25760 [2018-07-23 15:28:08,111 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 161 states. [2018-07-23 15:28:10,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:10,408 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2018-07-23 15:28:10,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-07-23 15:28:10,408 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 320 [2018-07-23 15:28:10,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:10,409 INFO L225 Difference]: With dead ends: 325 [2018-07-23 15:28:10,409 INFO L226 Difference]: Without dead ends: 323 [2018-07-23 15:28:10,410 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=319, Invalid=25441, Unknown=0, NotChecked=0, Total=25760 [2018-07-23 15:28:10,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-07-23 15:28:10,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2018-07-23 15:28:10,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-07-23 15:28:10,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2018-07-23 15:28:10,417 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 320 [2018-07-23 15:28:10,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:10,418 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2018-07-23 15:28:10,418 INFO L472 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-07-23 15:28:10,418 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2018-07-23 15:28:10,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-07-23 15:28:10,419 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:10,419 INFO L353 BasicCegarLoop]: trace histogram [160, 159, 1, 1, 1] [2018-07-23 15:28:10,419 INFO L414 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:10,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1926975539, now seen corresponding path program 159 times [2018-07-23 15:28:10,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:12,028 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-23 15:28:12,028 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:28:12,028 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2018-07-23 15:28:12,028 INFO L450 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-07-23 15:28:12,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-07-23 15:28:12,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=25761, Unknown=0, NotChecked=0, Total=26082 [2018-07-23 15:28:12,030 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 162 states. [2018-07-23 15:28:14,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:14,366 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2018-07-23 15:28:14,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-07-23 15:28:14,366 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 322 [2018-07-23 15:28:14,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:14,367 INFO L225 Difference]: With dead ends: 327 [2018-07-23 15:28:14,367 INFO L226 Difference]: Without dead ends: 325 [2018-07-23 15:28:14,368 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=321, Invalid=25761, Unknown=0, NotChecked=0, Total=26082 [2018-07-23 15:28:14,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-07-23 15:28:14,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2018-07-23 15:28:14,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-07-23 15:28:14,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2018-07-23 15:28:14,376 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 322 [2018-07-23 15:28:14,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:14,376 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2018-07-23 15:28:14,376 INFO L472 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-07-23 15:28:14,376 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2018-07-23 15:28:14,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-07-23 15:28:14,377 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:14,377 INFO L353 BasicCegarLoop]: trace histogram [161, 160, 1, 1, 1] [2018-07-23 15:28:14,377 INFO L414 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:14,378 INFO L82 PathProgramCache]: Analyzing trace with hash -692536313, now seen corresponding path program 160 times [2018-07-23 15:28:14,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:16,039 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-23 15:28:16,040 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:28:16,040 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2018-07-23 15:28:16,040 INFO L450 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-07-23 15:28:16,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-07-23 15:28:16,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=26083, Unknown=0, NotChecked=0, Total=26406 [2018-07-23 15:28:16,042 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 163 states. [2018-07-23 15:28:18,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-23 15:28:18,414 INFO L93 Difference]: Finished difference Result 329 states and 329 transitions. [2018-07-23 15:28:18,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-07-23 15:28:18,414 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 324 [2018-07-23 15:28:18,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-23 15:28:18,415 INFO L225 Difference]: With dead ends: 329 [2018-07-23 15:28:18,415 INFO L226 Difference]: Without dead ends: 327 [2018-07-23 15:28:18,416 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=323, Invalid=26083, Unknown=0, NotChecked=0, Total=26406 [2018-07-23 15:28:18,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-07-23 15:28:18,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2018-07-23 15:28:18,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-07-23 15:28:18,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 327 transitions. [2018-07-23 15:28:18,425 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 327 transitions. Word has length 324 [2018-07-23 15:28:18,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-23 15:28:18,425 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 327 transitions. [2018-07-23 15:28:18,425 INFO L472 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-07-23 15:28:18,425 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 327 transitions. [2018-07-23 15:28:18,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-07-23 15:28:18,426 INFO L345 BasicCegarLoop]: Found error trace [2018-07-23 15:28:18,426 INFO L353 BasicCegarLoop]: trace histogram [162, 161, 1, 1, 1] [2018-07-23 15:28:18,426 INFO L414 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr0AssertViolationASSERT]=== [2018-07-23 15:28:18,426 INFO L82 PathProgramCache]: Analyzing trace with hash 192586177, now seen corresponding path program 161 times [2018-07-23 15:28:18,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-23 15:28:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-23 15:28:20,000 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-23 15:28:20,000 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-23 15:28:20,000 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-07-23 15:28:20,000 INFO L450 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-07-23 15:28:20,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-07-23 15:28:20,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=26407, Unknown=0, NotChecked=0, Total=26732 [2018-07-23 15:28:20,002 INFO L87 Difference]: Start difference. First operand 327 states and 327 transitions. Second operand 164 states. Received shutdown request... [2018-07-23 15:28:22,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-07-23 15:28:22,240 WARN L540 AbstractCegarLoop]: Verification canceled [2018-07-23 15:28:22,248 WARN L202 ceAbstractionStarter]: Timeout [2018-07-23 15:28:22,248 INFO L202 PluginConnector]: Adding new model functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 03:28:22 BoogieIcfgContainer [2018-07-23 15:28:22,248 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-23 15:28:22,249 INFO L168 Benchmark]: Toolchain (without parser) took 241993.52 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 2.7 GB in the end (delta: -1.2 GB). Peak memory consumption was 740.5 MB. Max. memory is 7.1 GB. [2018-07-23 15:28:22,251 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 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-23 15:28:22,252 INFO L168 Benchmark]: Boogie Preprocessor took 48.64 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-23 15:28:22,252 INFO L168 Benchmark]: RCFGBuilder took 272.65 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-23 15:28:22,252 INFO L168 Benchmark]: TraceAbstraction took 241667.38 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 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 729.9 MB. Max. memory is 7.1 GB. [2018-07-23 15:28:22,255 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.16 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 48.64 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 272.65 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 241667.38 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 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 729.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 41). Cancelled while BasicCegarLoop was constructing difference of abstraction (327states) and interpolant automaton (currently 156 states, 164 states before enhancement), while ReachableStatesComputation was computing reachable states (307 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 241.5s OverallTime, 162 OverallIterations, 162 TraceHistogramMax, 135.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13678 SDtfs, 0 SDslu, 1428715 SDs, 0 SdLazy, 1454955 SolverSat, 0 SolverUnsat, 155 SolverUnknown, 0 SolverNotchecked, 93.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13365 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 13203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 67.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=327occurred in iteration=161, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 161 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 5.8s SatisfiabilityAnalysisTime, 90.0s InterpolantComputationTime, 26730 NumberOfCodeBlocks, 26730 NumberOfCodeBlocksAsserted, 162 NumberOfCheckSat, 26568 ConstructedInterpolants, 0 QuantifiedInterpolants, 40260510 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 162 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1417122 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/functions1.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-07-23_15-28-22-269.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/functions1.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-23_15-28-22-269.csv Completed graceful shutdown