java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/afnp2014.c.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 08:41:43,092 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 08:41:43,095 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 08:41:43,113 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 08:41:43,114 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 08:41:43,115 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 08:41:43,117 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 08:41:43,119 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 08:41:43,121 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 08:41:43,122 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 08:41:43,123 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 08:41:43,123 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 08:41:43,124 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 08:41:43,125 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 08:41:43,126 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 08:41:43,127 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 08:41:43,128 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 08:41:43,130 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 08:41:43,132 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 08:41:43,134 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 08:41:43,135 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 08:41:43,136 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 08:41:43,139 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 08:41:43,139 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 08:41:43,139 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 08:41:43,140 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 08:41:43,141 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 08:41:43,142 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 08:41:43,143 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 08:41:43,144 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 08:41:43,145 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 08:41:43,145 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 08:41:43,146 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 08:41:43,146 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 08:41:43,147 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 08:41:43,148 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 08:41:43,148 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 08:41:43,162 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 08:41:43,163 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 08:41:43,164 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 08:41:43,164 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 08:41:43,164 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 08:41:43,164 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 08:41:43,165 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 08:41:43,165 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 08:41:43,216 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 08:41:43,236 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 08:41:43,240 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 08:41:43,242 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 08:41:43,242 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 08:41:43,243 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/afnp2014.c.i_3.bpl [2018-07-25 08:41:43,243 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/afnp2014.c.i_3.bpl' [2018-07-25 08:41:43,293 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 08:41:43,294 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 08:41:43,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 08:41:43,296 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 08:41:43,296 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 08:41:43,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:41:43" (1/1) ... [2018-07-25 08:41:43,328 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:41:43" (1/1) ... [2018-07-25 08:41:43,337 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 08:41:43,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 08:41:43,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 08:41:43,338 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 08:41:43,350 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:41:43" (1/1) ... [2018-07-25 08:41:43,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:41:43" (1/1) ... [2018-07-25 08:41:43,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:41:43" (1/1) ... [2018-07-25 08:41:43,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:41:43" (1/1) ... [2018-07-25 08:41:43,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:41:43" (1/1) ... [2018-07-25 08:41:43,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:41:43" (1/1) ... [2018-07-25 08:41:43,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:41:43" (1/1) ... [2018-07-25 08:41:43,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 08:41:43,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 08:41:43,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 08:41:43,363 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 08:41:43,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:41:43" (1/1) ... [2018-07-25 08:41:43,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 08:41:43,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 08:41:43,646 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 08:41:43,647 INFO L202 PluginConnector]: Adding new model afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:41:43 BoogieIcfgContainer [2018-07-25 08:41:43,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 08:41:43,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 08:41:43,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 08:41:43,652 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 08:41:43,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 08:41:43" (1/2) ... [2018-07-25 08:41:43,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9a9cba and model type afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 08:41:43, skipping insertion in model container [2018-07-25 08:41:43,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 08:41:43" (2/2) ... [2018-07-25 08:41:43,658 INFO L112 eAbstractionObserver]: Analyzing ICFG afnp2014.c.i_3.bpl [2018-07-25 08:41:43,669 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 08:41:43,678 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 08:41:43,726 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 08:41:43,726 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 08:41:43,727 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 08:41:43,727 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 08:41:43,727 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 08:41:43,727 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 08:41:43,727 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 08:41:43,728 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 08:41:43,728 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 08:41:43,743 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-25 08:41:43,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 08:41:43,751 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:43,752 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 08:41:43,754 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:43,760 INFO L82 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2018-07-25 08:41:43,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:43,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:43,849 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 08:41:43,849 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 08:41:43,853 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 08:41:43,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 08:41:43,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:41:43,869 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-07-25 08:41:43,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:43,911 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-07-25 08:41:43,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 08:41:43,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-07-25 08:41:43,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:43,934 INFO L225 Difference]: With dead ends: 10 [2018-07-25 08:41:43,934 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 08:41:43,939 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 08:41:43,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 08:41:43,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 08:41:43,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 08:41:43,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 08:41:43,981 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-25 08:41:43,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:43,982 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 08:41:43,982 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 08:41:43,983 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 08:41:43,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 08:41:43,983 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:43,984 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-25 08:41:43,984 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:43,985 INFO L82 PathProgramCache]: Analyzing trace with hash 889531649, now seen corresponding path program 1 times [2018-07-25 08:41:43,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:44,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:44,033 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:44,034 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 08:41:44,036 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 08:41:44,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 08:41:44,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 08:41:44,037 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-07-25 08:41:44,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:44,081 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 08:41:44,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 08:41:44,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-07-25 08:41:44,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:44,084 INFO L225 Difference]: With dead ends: 11 [2018-07-25 08:41:44,085 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 08:41:44,086 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:41:44,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 08:41:44,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 08:41:44,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 08:41:44,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 08:41:44,091 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-25 08:41:44,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:44,091 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 08:41:44,092 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 08:41:44,092 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 08:41:44,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 08:41:44,092 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:44,093 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-25 08:41:44,093 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:44,094 INFO L82 PathProgramCache]: Analyzing trace with hash 141355773, now seen corresponding path program 2 times [2018-07-25 08:41:44,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:44,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:44,157 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:44,158 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 08:41:44,158 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 08:41:44,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 08:41:44,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 08:41:44,159 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-07-25 08:41:44,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:44,207 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 08:41:44,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 08:41:44,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-07-25 08:41:44,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:44,208 INFO L225 Difference]: With dead ends: 13 [2018-07-25 08:41:44,209 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 08:41:44,209 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:41:44,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 08:41:44,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 08:41:44,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 08:41:44,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 08:41:44,214 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-25 08:41:44,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:44,214 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 08:41:44,214 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 08:41:44,214 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 08:41:44,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 08:41:44,215 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:44,215 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-25 08:41:44,216 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:44,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1596122631, now seen corresponding path program 3 times [2018-07-25 08:41:44,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:44,290 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:44,290 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:44,292 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 08:41:44,293 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 08:41:44,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 08:41:44,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 08:41:44,294 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-07-25 08:41:44,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:44,356 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 08:41:44,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 08:41:44,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-07-25 08:41:44,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:44,358 INFO L225 Difference]: With dead ends: 15 [2018-07-25 08:41:44,358 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 08:41:44,359 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:41:44,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 08:41:44,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 08:41:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 08:41:44,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 08:41:44,364 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-07-25 08:41:44,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:44,365 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 08:41:44,365 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 08:41:44,365 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 08:41:44,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 08:41:44,366 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:44,366 INFO L354 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-07-25 08:41:44,366 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:44,367 INFO L82 PathProgramCache]: Analyzing trace with hash -570590731, now seen corresponding path program 4 times [2018-07-25 08:41:44,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:44,451 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:44,452 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:44,452 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 08:41:44,453 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 08:41:44,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 08:41:44,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:41:44,457 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-07-25 08:41:44,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:44,542 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 08:41:44,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 08:41:44,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-07-25 08:41:44,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:44,543 INFO L225 Difference]: With dead ends: 17 [2018-07-25 08:41:44,543 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 08:41:44,544 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 08:41:44,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 08:41:44,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 08:41:44,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 08:41:44,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 08:41:44,551 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-07-25 08:41:44,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:44,551 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 08:41:44,551 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 08:41:44,551 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 08:41:44,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 08:41:44,552 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:44,552 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-25 08:41:44,553 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:44,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1418054385, now seen corresponding path program 5 times [2018-07-25 08:41:44,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:44,642 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:44,647 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:44,647 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 08:41:44,648 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 08:41:44,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 08:41:44,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:41:44,649 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-07-25 08:41:44,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:44,746 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-25 08:41:44,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 08:41:44,746 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-25 08:41:44,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:44,747 INFO L225 Difference]: With dead ends: 19 [2018-07-25 08:41:44,747 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 08:41:44,748 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 08:41:44,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 08:41:44,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 08:41:44,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 08:41:44,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-25 08:41:44,761 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-07-25 08:41:44,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:44,762 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-25 08:41:44,762 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 08:41:44,762 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-25 08:41:44,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 08:41:44,763 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:44,765 INFO L354 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-07-25 08:41:44,766 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:44,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1245564141, now seen corresponding path program 6 times [2018-07-25 08:41:44,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:44,850 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:44,850 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:44,851 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 08:41:44,851 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 08:41:44,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 08:41:44,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:41:44,853 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-07-25 08:41:44,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:44,959 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-25 08:41:44,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 08:41:44,959 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-25 08:41:44,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:44,960 INFO L225 Difference]: With dead ends: 21 [2018-07-25 08:41:44,960 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 08:41:44,961 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 08:41:44,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 08:41:44,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 08:41:44,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 08:41:44,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-25 08:41:44,968 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-07-25 08:41:44,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:44,969 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-25 08:41:44,969 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 08:41:44,969 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-25 08:41:44,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 08:41:44,970 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:44,970 INFO L354 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-07-25 08:41:44,970 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:44,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1308803095, now seen corresponding path program 7 times [2018-07-25 08:41:44,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:45,052 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:45,053 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:45,053 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 08:41:45,054 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 08:41:45,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 08:41:45,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:41:45,055 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-07-25 08:41:45,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:45,139 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-25 08:41:45,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 08:41:45,139 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-25 08:41:45,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:45,143 INFO L225 Difference]: With dead ends: 23 [2018-07-25 08:41:45,143 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 08:41:45,144 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 08:41:45,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 08:41:45,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 08:41:45,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 08:41:45,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-25 08:41:45,151 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-07-25 08:41:45,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:45,154 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-25 08:41:45,154 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 08:41:45,155 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-25 08:41:45,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 08:41:45,155 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:45,156 INFO L354 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-07-25 08:41:45,156 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:45,156 INFO L82 PathProgramCache]: Analyzing trace with hash 665576421, now seen corresponding path program 8 times [2018-07-25 08:41:45,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:45,226 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:45,226 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:45,227 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 08:41:45,227 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 08:41:45,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 08:41:45,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:41:45,228 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-07-25 08:41:45,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:45,315 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-25 08:41:45,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 08:41:45,316 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 08:41:45,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:45,317 INFO L225 Difference]: With dead ends: 25 [2018-07-25 08:41:45,317 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 08:41:45,318 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 08:41:45,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 08:41:45,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 08:41:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 08:41:45,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-25 08:41:45,334 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-07-25 08:41:45,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:45,335 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-25 08:41:45,335 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 08:41:45,335 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-25 08:41:45,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 08:41:45,338 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:45,338 INFO L354 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-07-25 08:41:45,338 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:45,339 INFO L82 PathProgramCache]: Analyzing trace with hash -331253535, now seen corresponding path program 9 times [2018-07-25 08:41:45,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:45,423 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:45,424 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:45,424 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 08:41:45,424 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 08:41:45,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 08:41:45,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:41:45,427 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2018-07-25 08:41:45,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:45,534 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-25 08:41:45,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 08:41:45,535 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-07-25 08:41:45,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:45,536 INFO L225 Difference]: With dead ends: 27 [2018-07-25 08:41:45,536 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 08:41:45,537 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 08:41:45,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 08:41:45,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 08:41:45,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 08:41:45,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-25 08:41:45,548 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-07-25 08:41:45,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:45,550 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-25 08:41:45,550 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 08:41:45,550 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-25 08:41:45,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 08:41:45,551 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:45,551 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-07-25 08:41:45,551 INFO L415 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:45,551 INFO L82 PathProgramCache]: Analyzing trace with hash -507134243, now seen corresponding path program 10 times [2018-07-25 08:41:45,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:45,638 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:45,639 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:45,639 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 08:41:45,640 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 08:41:45,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 08:41:45,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:41:45,641 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2018-07-25 08:41:45,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:45,736 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-25 08:41:45,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 08:41:45,737 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-07-25 08:41:45,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:45,738 INFO L225 Difference]: With dead ends: 29 [2018-07-25 08:41:45,741 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 08:41:45,742 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-25 08:41:45,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 08:41:45,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 08:41:45,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 08:41:45,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-25 08:41:45,755 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-07-25 08:41:45,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:45,756 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-25 08:41:45,756 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 08:41:45,757 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-25 08:41:45,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 08:41:45,757 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:45,758 INFO L354 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-07-25 08:41:45,758 INFO L415 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:45,758 INFO L82 PathProgramCache]: Analyzing trace with hash -2024770087, now seen corresponding path program 11 times [2018-07-25 08:41:45,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:45,854 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:45,855 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:45,855 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 08:41:45,856 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 08:41:45,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 08:41:45,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:41:45,860 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-07-25 08:41:45,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:45,988 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-25 08:41:45,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 08:41:45,989 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-07-25 08:41:45,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:45,990 INFO L225 Difference]: With dead ends: 31 [2018-07-25 08:41:45,990 INFO L226 Difference]: Without dead ends: 29 [2018-07-25 08:41:45,990 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-25 08:41:45,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-25 08:41:46,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-25 08:41:46,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 08:41:46,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-25 08:41:46,002 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-07-25 08:41:46,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:46,002 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-25 08:41:46,002 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 08:41:46,003 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-25 08:41:46,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 08:41:46,004 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:46,004 INFO L354 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-07-25 08:41:46,004 INFO L415 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:46,005 INFO L82 PathProgramCache]: Analyzing trace with hash -183935531, now seen corresponding path program 12 times [2018-07-25 08:41:46,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:46,102 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:46,102 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 08:41:46,102 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 08:41:46,103 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 08:41:46,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:41:46,103 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-07-25 08:41:46,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:46,227 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-25 08:41:46,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 08:41:46,228 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-07-25 08:41:46,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:46,228 INFO L225 Difference]: With dead ends: 33 [2018-07-25 08:41:46,229 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 08:41:46,229 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-25 08:41:46,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 08:41:46,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-25 08:41:46,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 08:41:46,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-25 08:41:46,240 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-07-25 08:41:46,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:46,240 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-25 08:41:46,240 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 08:41:46,241 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-25 08:41:46,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 08:41:46,244 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:46,244 INFO L354 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-07-25 08:41:46,244 INFO L415 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:46,244 INFO L82 PathProgramCache]: Analyzing trace with hash -668453167, now seen corresponding path program 13 times [2018-07-25 08:41:46,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:46,341 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:46,341 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:46,341 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 08:41:46,342 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 08:41:46,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 08:41:46,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:41:46,343 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-07-25 08:41:46,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:46,478 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-25 08:41:46,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 08:41:46,479 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-07-25 08:41:46,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:46,480 INFO L225 Difference]: With dead ends: 35 [2018-07-25 08:41:46,480 INFO L226 Difference]: Without dead ends: 33 [2018-07-25 08:41:46,481 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-25 08:41:46,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-25 08:41:46,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-25 08:41:46,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-25 08:41:46,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-25 08:41:46,491 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-07-25 08:41:46,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:46,491 INFO L472 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-25 08:41:46,491 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 08:41:46,492 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-25 08:41:46,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-25 08:41:46,493 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:46,493 INFO L354 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-07-25 08:41:46,493 INFO L415 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:46,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1861533901, now seen corresponding path program 14 times [2018-07-25 08:41:46,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:46,616 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:46,616 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:46,616 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 08:41:46,617 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 08:41:46,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 08:41:46,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:41:46,618 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2018-07-25 08:41:46,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:46,775 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-25 08:41:46,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 08:41:46,776 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-07-25 08:41:46,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:46,776 INFO L225 Difference]: With dead ends: 37 [2018-07-25 08:41:46,777 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 08:41:46,777 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-25 08:41:46,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 08:41:46,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 08:41:46,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 08:41:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-25 08:41:46,794 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-07-25 08:41:46,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:46,794 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-25 08:41:46,794 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 08:41:46,795 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-25 08:41:46,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 08:41:46,796 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:46,796 INFO L354 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-07-25 08:41:46,798 INFO L415 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:46,799 INFO L82 PathProgramCache]: Analyzing trace with hash -2067350583, now seen corresponding path program 15 times [2018-07-25 08:41:46,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:46,935 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:46,935 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:46,935 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 08:41:46,936 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 08:41:46,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 08:41:46,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:41:46,939 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2018-07-25 08:41:47,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:47,107 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-25 08:41:47,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 08:41:47,107 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-07-25 08:41:47,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:47,108 INFO L225 Difference]: With dead ends: 39 [2018-07-25 08:41:47,108 INFO L226 Difference]: Without dead ends: 37 [2018-07-25 08:41:47,109 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-25 08:41:47,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-25 08:41:47,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-25 08:41:47,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 08:41:47,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-25 08:41:47,121 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-07-25 08:41:47,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:47,122 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-25 08:41:47,122 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 08:41:47,122 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-25 08:41:47,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 08:41:47,123 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:47,123 INFO L354 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-07-25 08:41:47,124 INFO L415 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:47,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1845880773, now seen corresponding path program 16 times [2018-07-25 08:41:47,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:47,252 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:47,253 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:47,253 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 08:41:47,253 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 08:41:47,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 08:41:47,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:41:47,254 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 19 states. [2018-07-25 08:41:47,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:47,447 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-25 08:41:47,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 08:41:47,448 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-07-25 08:41:47,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:47,449 INFO L225 Difference]: With dead ends: 41 [2018-07-25 08:41:47,449 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 08:41:47,450 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-25 08:41:47,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 08:41:47,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-25 08:41:47,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-25 08:41:47,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-25 08:41:47,464 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-07-25 08:41:47,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:47,464 INFO L472 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-25 08:41:47,465 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 08:41:47,465 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-25 08:41:47,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-25 08:41:47,466 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:47,466 INFO L354 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-07-25 08:41:47,466 INFO L415 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:47,466 INFO L82 PathProgramCache]: Analyzing trace with hash 69862593, now seen corresponding path program 17 times [2018-07-25 08:41:47,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:47,611 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:47,611 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:47,612 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 08:41:47,612 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 08:41:47,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 08:41:47,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:41:47,613 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 20 states. [2018-07-25 08:41:47,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:47,815 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-25 08:41:47,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 08:41:47,816 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-07-25 08:41:47,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:47,817 INFO L225 Difference]: With dead ends: 43 [2018-07-25 08:41:47,817 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 08:41:47,818 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-25 08:41:47,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 08:41:47,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-25 08:41:47,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 08:41:47,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-25 08:41:47,831 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-07-25 08:41:47,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:47,832 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-25 08:41:47,832 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 08:41:47,832 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-25 08:41:47,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 08:41:47,833 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:47,833 INFO L354 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-07-25 08:41:47,834 INFO L415 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:47,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1581591875, now seen corresponding path program 18 times [2018-07-25 08:41:47,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:48,043 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:48,043 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:48,043 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 08:41:48,044 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 08:41:48,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 08:41:48,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:41:48,045 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2018-07-25 08:41:48,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:48,259 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-25 08:41:48,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 08:41:48,259 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-07-25 08:41:48,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:48,260 INFO L225 Difference]: With dead ends: 45 [2018-07-25 08:41:48,260 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 08:41:48,261 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-25 08:41:48,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 08:41:48,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-25 08:41:48,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 08:41:48,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-25 08:41:48,274 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-07-25 08:41:48,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:48,275 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-25 08:41:48,275 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 08:41:48,275 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-25 08:41:48,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 08:41:48,276 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:48,276 INFO L354 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-07-25 08:41:48,276 INFO L415 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:48,277 INFO L82 PathProgramCache]: Analyzing trace with hash 508563897, now seen corresponding path program 19 times [2018-07-25 08:41:48,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:48,439 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:48,440 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:48,440 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 08:41:48,440 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 08:41:48,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 08:41:48,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-25 08:41:48,442 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2018-07-25 08:41:48,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:48,670 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-25 08:41:48,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 08:41:48,670 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-07-25 08:41:48,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:48,671 INFO L225 Difference]: With dead ends: 47 [2018-07-25 08:41:48,671 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 08:41:48,672 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-25 08:41:48,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 08:41:48,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 08:41:48,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 08:41:48,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-25 08:41:48,686 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-07-25 08:41:48,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:48,687 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-25 08:41:48,687 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 08:41:48,687 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-25 08:41:48,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 08:41:48,687 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:48,688 INFO L354 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-07-25 08:41:48,688 INFO L415 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:48,688 INFO L82 PathProgramCache]: Analyzing trace with hash -896433739, now seen corresponding path program 20 times [2018-07-25 08:41:48,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:48,844 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:48,844 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:48,844 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 08:41:48,845 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 08:41:48,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 08:41:48,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:41:48,846 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 23 states. [2018-07-25 08:41:49,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:49,119 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-25 08:41:49,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 08:41:49,120 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-07-25 08:41:49,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:49,121 INFO L225 Difference]: With dead ends: 49 [2018-07-25 08:41:49,121 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 08:41:49,122 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-25 08:41:49,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 08:41:49,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-25 08:41:49,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 08:41:49,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-25 08:41:49,138 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-07-25 08:41:49,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:49,138 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-25 08:41:49,138 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 08:41:49,139 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-25 08:41:49,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 08:41:49,139 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:49,139 INFO L354 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-07-25 08:41:49,140 INFO L415 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:49,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1815536305, now seen corresponding path program 21 times [2018-07-25 08:41:49,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:49,331 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:49,332 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:49,332 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 08:41:49,333 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 08:41:49,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 08:41:49,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:41:49,334 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 24 states. [2018-07-25 08:41:49,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:49,598 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-25 08:41:49,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 08:41:49,598 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-07-25 08:41:49,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:49,600 INFO L225 Difference]: With dead ends: 51 [2018-07-25 08:41:49,601 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 08:41:49,602 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-25 08:41:49,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 08:41:49,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-25 08:41:49,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-25 08:41:49,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-25 08:41:49,619 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-07-25 08:41:49,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:49,619 INFO L472 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-25 08:41:49,619 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 08:41:49,620 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-25 08:41:49,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 08:41:49,620 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:49,620 INFO L354 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-07-25 08:41:49,621 INFO L415 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:49,621 INFO L82 PathProgramCache]: Analyzing trace with hash 973599917, now seen corresponding path program 22 times [2018-07-25 08:41:49,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:49,796 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:49,797 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:49,797 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-25 08:41:49,797 INFO L451 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-25 08:41:49,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-25 08:41:49,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:41:49,799 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 25 states. [2018-07-25 08:41:50,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:50,061 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-25 08:41:50,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 08:41:50,061 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-07-25 08:41:50,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:50,062 INFO L225 Difference]: With dead ends: 53 [2018-07-25 08:41:50,062 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 08:41:50,063 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-25 08:41:50,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 08:41:50,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-25 08:41:50,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 08:41:50,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-25 08:41:50,078 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-07-25 08:41:50,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:50,078 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-25 08:41:50,078 INFO L473 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-25 08:41:50,078 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-25 08:41:50,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 08:41:50,079 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:50,079 INFO L354 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-07-25 08:41:50,079 INFO L415 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:50,080 INFO L82 PathProgramCache]: Analyzing trace with hash -673417303, now seen corresponding path program 23 times [2018-07-25 08:41:50,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:50,254 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:50,254 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:50,255 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 08:41:50,255 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 08:41:50,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 08:41:50,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:41:50,256 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 26 states. [2018-07-25 08:41:50,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:50,544 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-25 08:41:50,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 08:41:50,545 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-07-25 08:41:50,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:50,546 INFO L225 Difference]: With dead ends: 55 [2018-07-25 08:41:50,546 INFO L226 Difference]: Without dead ends: 53 [2018-07-25 08:41:50,546 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-25 08:41:50,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-25 08:41:50,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-25 08:41:50,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-25 08:41:50,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-25 08:41:50,563 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-07-25 08:41:50,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:50,563 INFO L472 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-25 08:41:50,563 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 08:41:50,564 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-25 08:41:50,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-25 08:41:50,564 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:50,564 INFO L354 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-07-25 08:41:50,565 INFO L415 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:50,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1385966501, now seen corresponding path program 24 times [2018-07-25 08:41:50,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:50,773 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:50,773 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:50,773 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-25 08:41:50,774 INFO L451 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-25 08:41:50,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-25 08:41:50,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:41:50,775 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 27 states. [2018-07-25 08:41:51,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:51,117 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-25 08:41:51,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 08:41:51,117 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-07-25 08:41:51,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:51,118 INFO L225 Difference]: With dead ends: 57 [2018-07-25 08:41:51,118 INFO L226 Difference]: Without dead ends: 55 [2018-07-25 08:41:51,119 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-25 08:41:51,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-25 08:41:51,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-25 08:41:51,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-25 08:41:51,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-25 08:41:51,146 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-07-25 08:41:51,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:51,147 INFO L472 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-25 08:41:51,147 INFO L473 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-25 08:41:51,147 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-25 08:41:51,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-25 08:41:51,148 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:51,148 INFO L354 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-07-25 08:41:51,149 INFO L415 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:51,149 INFO L82 PathProgramCache]: Analyzing trace with hash 473878689, now seen corresponding path program 25 times [2018-07-25 08:41:51,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:51,398 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:51,398 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:51,399 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 08:41:51,399 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 08:41:51,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 08:41:51,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:41:51,400 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 28 states. [2018-07-25 08:41:51,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:51,706 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-25 08:41:51,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 08:41:51,706 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-07-25 08:41:51,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:51,707 INFO L225 Difference]: With dead ends: 59 [2018-07-25 08:41:51,707 INFO L226 Difference]: Without dead ends: 57 [2018-07-25 08:41:51,708 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-25 08:41:51,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-25 08:41:51,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-25 08:41:51,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-25 08:41:51,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-25 08:41:51,726 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-07-25 08:41:51,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:51,726 INFO L472 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-25 08:41:51,726 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 08:41:51,726 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-25 08:41:51,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-25 08:41:51,727 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:51,727 INFO L354 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-07-25 08:41:51,727 INFO L415 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:51,728 INFO L82 PathProgramCache]: Analyzing trace with hash 130819741, now seen corresponding path program 26 times [2018-07-25 08:41:51,728 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:51,915 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:51,915 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:51,916 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-25 08:41:51,916 INFO L451 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-25 08:41:51,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-25 08:41:51,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:41:51,917 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 29 states. [2018-07-25 08:41:52,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:52,250 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-25 08:41:52,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 08:41:52,250 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-07-25 08:41:52,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:52,251 INFO L225 Difference]: With dead ends: 61 [2018-07-25 08:41:52,251 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 08:41:52,252 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-25 08:41:52,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 08:41:52,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-25 08:41:52,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-25 08:41:52,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-25 08:41:52,269 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-07-25 08:41:52,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:52,270 INFO L472 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-25 08:41:52,270 INFO L473 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-25 08:41:52,270 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-25 08:41:52,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-25 08:41:52,271 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:52,271 INFO L354 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-07-25 08:41:52,271 INFO L415 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:52,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1163652505, now seen corresponding path program 27 times [2018-07-25 08:41:52,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:52,471 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:52,471 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:52,472 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 08:41:52,472 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 08:41:52,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 08:41:52,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:41:52,473 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 30 states. [2018-07-25 08:41:52,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:52,806 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-25 08:41:52,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 08:41:52,807 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-07-25 08:41:52,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:52,808 INFO L225 Difference]: With dead ends: 63 [2018-07-25 08:41:52,808 INFO L226 Difference]: Without dead ends: 61 [2018-07-25 08:41:52,809 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-25 08:41:52,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-25 08:41:52,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-25 08:41:52,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-25 08:41:52,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-25 08:41:52,826 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-07-25 08:41:52,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:52,827 INFO L472 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-25 08:41:52,827 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 08:41:52,827 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-25 08:41:52,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-25 08:41:52,828 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:52,828 INFO L354 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-07-25 08:41:52,828 INFO L415 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:52,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1578493333, now seen corresponding path program 28 times [2018-07-25 08:41:52,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:53,034 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:53,034 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:53,035 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-25 08:41:53,035 INFO L451 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-25 08:41:53,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-25 08:41:53,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:41:53,036 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 31 states. [2018-07-25 08:41:53,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:53,373 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-25 08:41:53,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 08:41:53,373 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-07-25 08:41:53,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:53,374 INFO L225 Difference]: With dead ends: 65 [2018-07-25 08:41:53,374 INFO L226 Difference]: Without dead ends: 63 [2018-07-25 08:41:53,375 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-25 08:41:53,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-25 08:41:53,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-25 08:41:53,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-25 08:41:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-25 08:41:53,397 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-07-25 08:41:53,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:53,397 INFO L472 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-25 08:41:53,398 INFO L473 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-25 08:41:53,398 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-25 08:41:53,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-25 08:41:53,398 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:53,399 INFO L354 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-07-25 08:41:53,400 INFO L415 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:53,400 INFO L82 PathProgramCache]: Analyzing trace with hash 808570513, now seen corresponding path program 29 times [2018-07-25 08:41:53,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:53,638 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:53,639 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:53,639 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 08:41:53,639 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 08:41:53,639 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 08:41:53,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-25 08:41:53,640 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 32 states. [2018-07-25 08:41:54,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:54,003 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-25 08:41:54,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 08:41:54,003 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-07-25 08:41:54,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:54,004 INFO L225 Difference]: With dead ends: 67 [2018-07-25 08:41:54,004 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 08:41:54,005 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-25 08:41:54,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 08:41:54,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 08:41:54,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 08:41:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-25 08:41:54,029 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-07-25 08:41:54,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:54,029 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-25 08:41:54,029 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 08:41:54,030 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-25 08:41:54,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-25 08:41:54,030 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:54,030 INFO L354 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2018-07-25 08:41:54,031 INFO L415 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:54,031 INFO L82 PathProgramCache]: Analyzing trace with hash -352884595, now seen corresponding path program 30 times [2018-07-25 08:41:54,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:54,335 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:54,336 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:54,336 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-25 08:41:54,337 INFO L451 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-25 08:41:54,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-25 08:41:54,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 08:41:54,338 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 33 states. [2018-07-25 08:41:54,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:54,781 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-25 08:41:54,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 08:41:54,781 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-07-25 08:41:54,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:54,782 INFO L225 Difference]: With dead ends: 69 [2018-07-25 08:41:54,782 INFO L226 Difference]: Without dead ends: 67 [2018-07-25 08:41:54,783 INFO L574 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-25 08:41:54,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-25 08:41:54,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-25 08:41:54,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-25 08:41:54,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-25 08:41:54,800 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-07-25 08:41:54,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:54,801 INFO L472 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-25 08:41:54,801 INFO L473 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-25 08:41:54,801 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-25 08:41:54,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-25 08:41:54,802 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:54,802 INFO L354 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2018-07-25 08:41:54,802 INFO L415 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:54,802 INFO L82 PathProgramCache]: Analyzing trace with hash 180253577, now seen corresponding path program 31 times [2018-07-25 08:41:54,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:55,025 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:55,025 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:55,026 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 08:41:55,026 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 08:41:55,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 08:41:55,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 08:41:55,027 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 34 states. [2018-07-25 08:41:55,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:55,404 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-25 08:41:55,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 08:41:55,404 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-07-25 08:41:55,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:55,405 INFO L225 Difference]: With dead ends: 71 [2018-07-25 08:41:55,405 INFO L226 Difference]: Without dead ends: 69 [2018-07-25 08:41:55,406 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 08:41:55,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-25 08:41:55,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-25 08:41:55,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-25 08:41:55,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-25 08:41:55,430 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-07-25 08:41:55,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:55,430 INFO L472 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-25 08:41:55,430 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 08:41:55,430 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-25 08:41:55,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-25 08:41:55,431 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:55,431 INFO L354 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2018-07-25 08:41:55,432 INFO L415 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:55,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1424928645, now seen corresponding path program 32 times [2018-07-25 08:41:55,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:55,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:55,701 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:55,702 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-25 08:41:55,702 INFO L451 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-25 08:41:55,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-25 08:41:55,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:41:55,706 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 35 states. [2018-07-25 08:41:56,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:56,120 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-25 08:41:56,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 08:41:56,121 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-07-25 08:41:56,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:56,121 INFO L225 Difference]: With dead ends: 73 [2018-07-25 08:41:56,121 INFO L226 Difference]: Without dead ends: 71 [2018-07-25 08:41:56,123 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 08:41:56,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-25 08:41:56,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-25 08:41:56,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-25 08:41:56,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-25 08:41:56,148 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-07-25 08:41:56,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:56,148 INFO L472 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-25 08:41:56,148 INFO L473 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-25 08:41:56,149 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-25 08:41:56,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-25 08:41:56,149 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:56,150 INFO L354 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2018-07-25 08:41:56,150 INFO L415 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:56,151 INFO L82 PathProgramCache]: Analyzing trace with hash -738206591, now seen corresponding path program 33 times [2018-07-25 08:41:56,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:56,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:56,407 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:56,408 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 08:41:56,408 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 08:41:56,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 08:41:56,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 08:41:56,409 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 36 states. [2018-07-25 08:41:56,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:56,835 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-25 08:41:56,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 08:41:56,835 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-07-25 08:41:56,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:56,836 INFO L225 Difference]: With dead ends: 75 [2018-07-25 08:41:56,836 INFO L226 Difference]: Without dead ends: 73 [2018-07-25 08:41:56,837 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 08:41:56,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-25 08:41:56,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-25 08:41:56,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-25 08:41:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-25 08:41:56,858 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-07-25 08:41:56,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:56,859 INFO L472 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-25 08:41:56,859 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 08:41:56,859 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-25 08:41:56,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-25 08:41:56,859 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:56,860 INFO L354 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2018-07-25 08:41:56,860 INFO L415 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:56,860 INFO L82 PathProgramCache]: Analyzing trace with hash -746997123, now seen corresponding path program 34 times [2018-07-25 08:41:56,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:57,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:57,108 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:57,108 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-25 08:41:57,108 INFO L451 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-25 08:41:57,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-25 08:41:57,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 08:41:57,109 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 37 states. [2018-07-25 08:41:57,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:57,527 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-25 08:41:57,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 08:41:57,528 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-07-25 08:41:57,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:57,529 INFO L225 Difference]: With dead ends: 77 [2018-07-25 08:41:57,529 INFO L226 Difference]: Without dead ends: 75 [2018-07-25 08:41:57,530 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 08:41:57,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-25 08:41:57,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-25 08:41:57,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-25 08:41:57,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-25 08:41:57,553 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-07-25 08:41:57,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:57,553 INFO L472 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-25 08:41:57,553 INFO L473 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-25 08:41:57,553 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-25 08:41:57,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-25 08:41:57,554 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:57,554 INFO L354 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2018-07-25 08:41:57,554 INFO L415 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:57,555 INFO L82 PathProgramCache]: Analyzing trace with hash -604763783, now seen corresponding path program 35 times [2018-07-25 08:41:57,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:57,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:57,847 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:57,848 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 08:41:57,848 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 08:41:57,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 08:41:57,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 08:41:57,850 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 38 states. [2018-07-25 08:41:58,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:58,393 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-25 08:41:58,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 08:41:58,394 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-07-25 08:41:58,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:58,394 INFO L225 Difference]: With dead ends: 79 [2018-07-25 08:41:58,395 INFO L226 Difference]: Without dead ends: 77 [2018-07-25 08:41:58,396 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 08:41:58,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-25 08:41:58,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-25 08:41:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-25 08:41:58,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-25 08:41:58,416 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-07-25 08:41:58,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:58,417 INFO L472 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-25 08:41:58,417 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 08:41:58,417 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-25 08:41:58,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-25 08:41:58,418 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:58,418 INFO L354 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2018-07-25 08:41:58,418 INFO L415 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:58,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1357477515, now seen corresponding path program 36 times [2018-07-25 08:41:58,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:58,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:58,664 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:58,664 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-25 08:41:58,665 INFO L451 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-25 08:41:58,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-25 08:41:58,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 08:41:58,666 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 39 states. [2018-07-25 08:41:59,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:59,100 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-25 08:41:59,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 08:41:59,101 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-07-25 08:41:59,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:59,102 INFO L225 Difference]: With dead ends: 81 [2018-07-25 08:41:59,102 INFO L226 Difference]: Without dead ends: 79 [2018-07-25 08:41:59,103 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 08:41:59,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-25 08:41:59,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-25 08:41:59,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-25 08:41:59,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-25 08:41:59,125 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-07-25 08:41:59,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:59,125 INFO L472 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-25 08:41:59,126 INFO L473 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-25 08:41:59,126 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-25 08:41:59,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-25 08:41:59,128 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:59,128 INFO L354 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2018-07-25 08:41:59,129 INFO L415 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:59,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1134099057, now seen corresponding path program 37 times [2018-07-25 08:41:59,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:41:59,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:41:59,382 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:41:59,382 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 08:41:59,382 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 08:41:59,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 08:41:59,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 08:41:59,384 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 40 states. [2018-07-25 08:41:59,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:41:59,836 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-25 08:41:59,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 08:41:59,837 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-07-25 08:41:59,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:41:59,837 INFO L225 Difference]: With dead ends: 83 [2018-07-25 08:41:59,838 INFO L226 Difference]: Without dead ends: 81 [2018-07-25 08:41:59,839 INFO L574 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-25 08:41:59,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-25 08:41:59,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-25 08:41:59,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-25 08:41:59,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-25 08:41:59,860 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-07-25 08:41:59,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:41:59,860 INFO L472 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-25 08:41:59,860 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 08:41:59,860 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-25 08:41:59,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-25 08:41:59,861 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:41:59,861 INFO L354 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2018-07-25 08:41:59,861 INFO L415 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:41:59,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1052566419, now seen corresponding path program 38 times [2018-07-25 08:41:59,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:41:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:00,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:00,110 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:00,110 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-25 08:42:00,110 INFO L451 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-25 08:42:00,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-25 08:42:00,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 08:42:00,112 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 41 states. [2018-07-25 08:42:00,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:00,583 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-25 08:42:00,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 08:42:00,583 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-07-25 08:42:00,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:00,584 INFO L225 Difference]: With dead ends: 85 [2018-07-25 08:42:00,584 INFO L226 Difference]: Without dead ends: 83 [2018-07-25 08:42:00,586 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 08:42:00,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-25 08:42:00,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-25 08:42:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 08:42:00,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-25 08:42:00,608 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-07-25 08:42:00,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:00,608 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-25 08:42:00,608 INFO L473 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-25 08:42:00,608 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-25 08:42:00,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-25 08:42:00,609 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:00,609 INFO L354 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2018-07-25 08:42:00,610 INFO L415 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:00,610 INFO L82 PathProgramCache]: Analyzing trace with hash 2095886185, now seen corresponding path program 39 times [2018-07-25 08:42:00,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:00,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:00,874 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:00,874 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 08:42:00,874 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 08:42:00,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 08:42:00,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 08:42:00,876 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 42 states. [2018-07-25 08:42:01,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:01,369 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-25 08:42:01,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 08:42:01,370 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-07-25 08:42:01,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:01,371 INFO L225 Difference]: With dead ends: 87 [2018-07-25 08:42:01,371 INFO L226 Difference]: Without dead ends: 85 [2018-07-25 08:42:01,372 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 08:42:01,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-25 08:42:01,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-25 08:42:01,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 08:42:01,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-25 08:42:01,396 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-07-25 08:42:01,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:01,397 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-25 08:42:01,397 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 08:42:01,397 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-25 08:42:01,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-25 08:42:01,398 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:01,398 INFO L354 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2018-07-25 08:42:01,398 INFO L415 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:01,398 INFO L82 PathProgramCache]: Analyzing trace with hash -193105051, now seen corresponding path program 40 times [2018-07-25 08:42:01,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:01,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:01,655 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:01,655 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-25 08:42:01,656 INFO L451 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-25 08:42:01,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-25 08:42:01,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 08:42:01,657 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 43 states. [2018-07-25 08:42:02,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:02,122 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-25 08:42:02,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 08:42:02,122 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-07-25 08:42:02,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:02,123 INFO L225 Difference]: With dead ends: 89 [2018-07-25 08:42:02,124 INFO L226 Difference]: Without dead ends: 87 [2018-07-25 08:42:02,125 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 08:42:02,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-25 08:42:02,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-25 08:42:02,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 08:42:02,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-25 08:42:02,149 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-07-25 08:42:02,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:02,149 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-25 08:42:02,149 INFO L473 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-25 08:42:02,149 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-25 08:42:02,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-25 08:42:02,150 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:02,150 INFO L354 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2018-07-25 08:42:02,151 INFO L415 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:02,151 INFO L82 PathProgramCache]: Analyzing trace with hash -890427295, now seen corresponding path program 41 times [2018-07-25 08:42:02,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:02,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:02,440 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:02,441 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 08:42:02,441 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 08:42:02,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 08:42:02,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 08:42:02,442 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 44 states. [2018-07-25 08:42:02,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:02,829 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-25 08:42:02,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-25 08:42:02,830 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-07-25 08:42:02,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:02,831 INFO L225 Difference]: With dead ends: 91 [2018-07-25 08:42:02,831 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 08:42:02,832 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 08:42:02,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 08:42:02,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-25 08:42:02,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 08:42:02,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-25 08:42:02,854 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-07-25 08:42:02,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:02,855 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-25 08:42:02,855 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 08:42:02,855 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-25 08:42:02,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-25 08:42:02,856 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:02,856 INFO L354 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2018-07-25 08:42:02,856 INFO L415 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:02,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1002205603, now seen corresponding path program 42 times [2018-07-25 08:42:02,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:03,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:03,109 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:03,109 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-25 08:42:03,109 INFO L451 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-25 08:42:03,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-25 08:42:03,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 08:42:03,111 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 45 states. [2018-07-25 08:42:03,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:03,583 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-25 08:42:03,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 08:42:03,583 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-07-25 08:42:03,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:03,584 INFO L225 Difference]: With dead ends: 93 [2018-07-25 08:42:03,585 INFO L226 Difference]: Without dead ends: 91 [2018-07-25 08:42:03,586 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 08:42:03,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-25 08:42:03,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-25 08:42:03,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-25 08:42:03,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-25 08:42:03,607 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-07-25 08:42:03,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:03,608 INFO L472 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-25 08:42:03,608 INFO L473 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-25 08:42:03,608 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-25 08:42:03,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-25 08:42:03,609 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:03,609 INFO L354 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2018-07-25 08:42:03,609 INFO L415 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:03,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1046977191, now seen corresponding path program 43 times [2018-07-25 08:42:03,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:03,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:03,941 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:03,942 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-25 08:42:03,942 INFO L451 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-25 08:42:03,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-25 08:42:03,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 08:42:03,944 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 46 states. [2018-07-25 08:42:04,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:04,534 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-25 08:42:04,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 08:42:04,534 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-07-25 08:42:04,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:04,535 INFO L225 Difference]: With dead ends: 95 [2018-07-25 08:42:04,535 INFO L226 Difference]: Without dead ends: 93 [2018-07-25 08:42:04,536 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 08:42:04,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-25 08:42:04,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-25 08:42:04,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-25 08:42:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-25 08:42:04,559 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-07-25 08:42:04,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:04,559 INFO L472 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-25 08:42:04,559 INFO L473 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-25 08:42:04,559 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-25 08:42:04,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-25 08:42:04,560 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:04,560 INFO L354 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2018-07-25 08:42:04,560 INFO L415 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:04,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1122800299, now seen corresponding path program 44 times [2018-07-25 08:42:04,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:04,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:04,851 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:04,852 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-25 08:42:04,852 INFO L451 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-25 08:42:04,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-25 08:42:04,853 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 08:42:04,853 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 47 states. [2018-07-25 08:42:05,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:05,288 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-25 08:42:05,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-25 08:42:05,288 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-07-25 08:42:05,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:05,289 INFO L225 Difference]: With dead ends: 97 [2018-07-25 08:42:05,289 INFO L226 Difference]: Without dead ends: 95 [2018-07-25 08:42:05,290 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 08:42:05,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-25 08:42:05,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-25 08:42:05,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-25 08:42:05,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-25 08:42:05,316 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-07-25 08:42:05,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:05,316 INFO L472 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-25 08:42:05,316 INFO L473 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-25 08:42:05,316 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-25 08:42:05,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-25 08:42:05,317 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:05,317 INFO L354 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2018-07-25 08:42:05,318 INFO L415 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:05,318 INFO L82 PathProgramCache]: Analyzing trace with hash -974363055, now seen corresponding path program 45 times [2018-07-25 08:42:05,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:05,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:05,623 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:05,623 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-25 08:42:05,623 INFO L451 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-25 08:42:05,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-25 08:42:05,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 08:42:05,624 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 48 states. [2018-07-25 08:42:06,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:06,201 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-25 08:42:06,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-25 08:42:06,201 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-07-25 08:42:06,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:06,202 INFO L225 Difference]: With dead ends: 99 [2018-07-25 08:42:06,202 INFO L226 Difference]: Without dead ends: 97 [2018-07-25 08:42:06,203 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 08:42:06,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-25 08:42:06,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-25 08:42:06,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-25 08:42:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-25 08:42:06,229 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-07-25 08:42:06,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:06,229 INFO L472 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-25 08:42:06,230 INFO L473 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-25 08:42:06,230 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-25 08:42:06,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-25 08:42:06,231 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:06,231 INFO L354 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2018-07-25 08:42:06,231 INFO L415 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:06,231 INFO L82 PathProgramCache]: Analyzing trace with hash -60092339, now seen corresponding path program 46 times [2018-07-25 08:42:06,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:06,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:06,569 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:06,569 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-25 08:42:06,570 INFO L451 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-25 08:42:06,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-25 08:42:06,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 08:42:06,571 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 49 states. [2018-07-25 08:42:07,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:07,082 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-25 08:42:07,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-25 08:42:07,082 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-07-25 08:42:07,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:07,083 INFO L225 Difference]: With dead ends: 101 [2018-07-25 08:42:07,083 INFO L226 Difference]: Without dead ends: 99 [2018-07-25 08:42:07,084 INFO L574 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-25 08:42:07,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-25 08:42:07,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-25 08:42:07,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-25 08:42:07,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-25 08:42:07,109 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-07-25 08:42:07,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:07,109 INFO L472 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-25 08:42:07,109 INFO L473 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-25 08:42:07,109 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-25 08:42:07,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-25 08:42:07,110 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:07,110 INFO L354 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2018-07-25 08:42:07,111 INFO L415 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:07,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1914229943, now seen corresponding path program 47 times [2018-07-25 08:42:07,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:07,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:07,453 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:07,453 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-25 08:42:07,454 INFO L451 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-25 08:42:07,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-25 08:42:07,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 08:42:07,455 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 50 states. [2018-07-25 08:42:08,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:08,069 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-25 08:42:08,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-25 08:42:08,070 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-07-25 08:42:08,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:08,071 INFO L225 Difference]: With dead ends: 103 [2018-07-25 08:42:08,071 INFO L226 Difference]: Without dead ends: 101 [2018-07-25 08:42:08,072 INFO L574 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-25 08:42:08,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-25 08:42:08,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-25 08:42:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-25 08:42:08,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-25 08:42:08,102 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-07-25 08:42:08,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:08,102 INFO L472 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-25 08:42:08,102 INFO L473 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-25 08:42:08,102 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-25 08:42:08,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-25 08:42:08,103 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:08,103 INFO L354 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2018-07-25 08:42:08,103 INFO L415 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:08,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1329039547, now seen corresponding path program 48 times [2018-07-25 08:42:08,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:08,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:08,417 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:08,417 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-25 08:42:08,418 INFO L451 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-25 08:42:08,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-25 08:42:08,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 08:42:08,419 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 51 states. [2018-07-25 08:42:08,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:08,862 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-25 08:42:08,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-25 08:42:08,863 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-07-25 08:42:08,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:08,864 INFO L225 Difference]: With dead ends: 105 [2018-07-25 08:42:08,864 INFO L226 Difference]: Without dead ends: 103 [2018-07-25 08:42:08,865 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 08:42:08,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-25 08:42:08,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-25 08:42:08,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-25 08:42:08,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-25 08:42:08,889 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-07-25 08:42:08,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:08,889 INFO L472 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-25 08:42:08,889 INFO L473 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-25 08:42:08,889 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-25 08:42:08,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-25 08:42:08,891 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:08,891 INFO L354 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2018-07-25 08:42:08,891 INFO L415 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:08,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1601784767, now seen corresponding path program 49 times [2018-07-25 08:42:08,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:09,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:09,260 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:09,260 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-25 08:42:09,261 INFO L451 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-25 08:42:09,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-25 08:42:09,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 08:42:09,262 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 52 states. [2018-07-25 08:42:09,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:09,874 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-25 08:42:09,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-25 08:42:09,874 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-07-25 08:42:09,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:09,875 INFO L225 Difference]: With dead ends: 107 [2018-07-25 08:42:09,875 INFO L226 Difference]: Without dead ends: 105 [2018-07-25 08:42:09,876 INFO L574 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-25 08:42:09,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-25 08:42:09,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-25 08:42:09,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-25 08:42:09,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-25 08:42:09,902 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-07-25 08:42:09,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:09,902 INFO L472 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-25 08:42:09,903 INFO L473 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-25 08:42:09,903 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-25 08:42:09,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-25 08:42:09,903 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:09,903 INFO L354 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2018-07-25 08:42:09,904 INFO L415 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:09,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1716936131, now seen corresponding path program 50 times [2018-07-25 08:42:09,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:10,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:10,254 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:10,254 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-25 08:42:10,254 INFO L451 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-25 08:42:10,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-25 08:42:10,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 08:42:10,255 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 53 states. [2018-07-25 08:42:10,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:10,779 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-07-25 08:42:10,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-25 08:42:10,780 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-07-25 08:42:10,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:10,780 INFO L225 Difference]: With dead ends: 109 [2018-07-25 08:42:10,780 INFO L226 Difference]: Without dead ends: 107 [2018-07-25 08:42:10,781 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 08:42:10,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-25 08:42:10,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-07-25 08:42:10,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-25 08:42:10,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-07-25 08:42:10,807 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-07-25 08:42:10,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:10,807 INFO L472 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-07-25 08:42:10,807 INFO L473 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-25 08:42:10,807 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-07-25 08:42:10,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-25 08:42:10,808 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:10,808 INFO L354 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2018-07-25 08:42:10,808 INFO L415 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:10,808 INFO L82 PathProgramCache]: Analyzing trace with hash -708247239, now seen corresponding path program 51 times [2018-07-25 08:42:10,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:11,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:11,183 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:11,184 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-25 08:42:11,184 INFO L451 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-25 08:42:11,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-25 08:42:11,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 08:42:11,185 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 54 states. [2018-07-25 08:42:11,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:11,710 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-07-25 08:42:11,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-25 08:42:11,711 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-07-25 08:42:11,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:11,711 INFO L225 Difference]: With dead ends: 111 [2018-07-25 08:42:11,711 INFO L226 Difference]: Without dead ends: 109 [2018-07-25 08:42:11,712 INFO L574 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-25 08:42:11,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-25 08:42:11,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-07-25 08:42:11,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-25 08:42:11,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-07-25 08:42:11,739 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-07-25 08:42:11,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:11,739 INFO L472 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-07-25 08:42:11,739 INFO L473 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-25 08:42:11,739 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-07-25 08:42:11,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-25 08:42:11,740 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:11,740 INFO L354 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2018-07-25 08:42:11,740 INFO L415 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:11,740 INFO L82 PathProgramCache]: Analyzing trace with hash -2020830923, now seen corresponding path program 52 times [2018-07-25 08:42:11,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:12,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:12,064 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:12,064 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-25 08:42:12,064 INFO L451 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-25 08:42:12,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-25 08:42:12,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 08:42:12,065 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 55 states. [2018-07-25 08:42:12,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:12,556 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-07-25 08:42:12,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-25 08:42:12,556 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-07-25 08:42:12,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:12,557 INFO L225 Difference]: With dead ends: 113 [2018-07-25 08:42:12,557 INFO L226 Difference]: Without dead ends: 111 [2018-07-25 08:42:12,557 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 08:42:12,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-25 08:42:12,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-07-25 08:42:12,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-25 08:42:12,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-07-25 08:42:12,583 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2018-07-25 08:42:12,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:12,584 INFO L472 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-07-25 08:42:12,584 INFO L473 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-25 08:42:12,584 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-07-25 08:42:12,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-25 08:42:12,584 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:12,584 INFO L354 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2018-07-25 08:42:12,584 INFO L415 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:12,585 INFO L82 PathProgramCache]: Analyzing trace with hash -693366223, now seen corresponding path program 53 times [2018-07-25 08:42:12,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:12,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:12,876 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:12,876 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-25 08:42:12,877 INFO L451 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-25 08:42:12,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-25 08:42:12,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 08:42:12,877 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 56 states. [2018-07-25 08:42:13,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:13,432 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-07-25 08:42:13,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-25 08:42:13,432 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-07-25 08:42:13,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:13,433 INFO L225 Difference]: With dead ends: 115 [2018-07-25 08:42:13,433 INFO L226 Difference]: Without dead ends: 113 [2018-07-25 08:42:13,434 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 08:42:13,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-25 08:42:13,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-07-25 08:42:13,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-25 08:42:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-07-25 08:42:13,464 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2018-07-25 08:42:13,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:13,465 INFO L472 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-07-25 08:42:13,465 INFO L473 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-25 08:42:13,465 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-07-25 08:42:13,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-25 08:42:13,465 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:13,466 INFO L354 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2018-07-25 08:42:13,466 INFO L415 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:13,466 INFO L82 PathProgramCache]: Analyzing trace with hash -605076435, now seen corresponding path program 54 times [2018-07-25 08:42:13,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:13,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:13,758 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:13,758 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-25 08:42:13,759 INFO L451 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-25 08:42:13,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-25 08:42:13,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 08:42:13,759 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 57 states. [2018-07-25 08:42:14,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:14,295 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-07-25 08:42:14,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-25 08:42:14,295 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-07-25 08:42:14,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:14,297 INFO L225 Difference]: With dead ends: 117 [2018-07-25 08:42:14,297 INFO L226 Difference]: Without dead ends: 115 [2018-07-25 08:42:14,297 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 08:42:14,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-25 08:42:14,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-07-25 08:42:14,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-25 08:42:14,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-07-25 08:42:14,321 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2018-07-25 08:42:14,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:14,322 INFO L472 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-07-25 08:42:14,322 INFO L473 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-25 08:42:14,322 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-07-25 08:42:14,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-25 08:42:14,322 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:14,322 INFO L354 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2018-07-25 08:42:14,323 INFO L415 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:14,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1657936087, now seen corresponding path program 55 times [2018-07-25 08:42:14,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:14,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:14,771 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:14,771 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-25 08:42:14,771 INFO L451 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-25 08:42:14,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-25 08:42:14,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 08:42:14,772 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 58 states. [2018-07-25 08:42:15,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:15,584 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-07-25 08:42:15,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-25 08:42:15,585 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-07-25 08:42:15,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:15,586 INFO L225 Difference]: With dead ends: 119 [2018-07-25 08:42:15,586 INFO L226 Difference]: Without dead ends: 117 [2018-07-25 08:42:15,587 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 08:42:15,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-07-25 08:42:15,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-07-25 08:42:15,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-25 08:42:15,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-07-25 08:42:15,630 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2018-07-25 08:42:15,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:15,630 INFO L472 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-07-25 08:42:15,630 INFO L473 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-25 08:42:15,630 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-07-25 08:42:15,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-25 08:42:15,631 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:15,631 INFO L354 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2018-07-25 08:42:15,632 INFO L415 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:15,633 INFO L82 PathProgramCache]: Analyzing trace with hash 156220197, now seen corresponding path program 56 times [2018-07-25 08:42:15,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:16,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:16,007 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:16,007 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-25 08:42:16,007 INFO L451 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-25 08:42:16,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-25 08:42:16,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 08:42:16,008 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 59 states. [2018-07-25 08:42:16,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:16,663 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-07-25 08:42:16,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-25 08:42:16,664 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2018-07-25 08:42:16,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:16,665 INFO L225 Difference]: With dead ends: 121 [2018-07-25 08:42:16,665 INFO L226 Difference]: Without dead ends: 119 [2018-07-25 08:42:16,665 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 08:42:16,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-25 08:42:16,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-25 08:42:16,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-25 08:42:16,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-07-25 08:42:16,690 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2018-07-25 08:42:16,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:16,691 INFO L472 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-07-25 08:42:16,691 INFO L473 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-25 08:42:16,691 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-07-25 08:42:16,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-25 08:42:16,691 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:16,692 INFO L354 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2018-07-25 08:42:16,692 INFO L415 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:16,692 INFO L82 PathProgramCache]: Analyzing trace with hash -196313055, now seen corresponding path program 57 times [2018-07-25 08:42:16,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:17,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:17,002 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:17,002 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-25 08:42:17,002 INFO L451 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-25 08:42:17,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-25 08:42:17,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 08:42:17,003 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 60 states. [2018-07-25 08:42:17,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:17,588 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-07-25 08:42:17,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-25 08:42:17,588 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-07-25 08:42:17,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:17,589 INFO L225 Difference]: With dead ends: 123 [2018-07-25 08:42:17,589 INFO L226 Difference]: Without dead ends: 121 [2018-07-25 08:42:17,589 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 08:42:17,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-25 08:42:17,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-07-25 08:42:17,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 08:42:17,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-07-25 08:42:17,616 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2018-07-25 08:42:17,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:17,616 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-07-25 08:42:17,616 INFO L473 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-25 08:42:17,616 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-07-25 08:42:17,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-25 08:42:17,617 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:17,617 INFO L354 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2018-07-25 08:42:17,617 INFO L415 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:17,617 INFO L82 PathProgramCache]: Analyzing trace with hash 321648157, now seen corresponding path program 58 times [2018-07-25 08:42:17,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:17,955 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:17,955 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-25 08:42:17,956 INFO L451 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-25 08:42:17,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-25 08:42:17,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 08:42:17,956 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 61 states. [2018-07-25 08:42:18,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:18,587 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-07-25 08:42:18,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-25 08:42:18,588 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-07-25 08:42:18,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:18,589 INFO L225 Difference]: With dead ends: 125 [2018-07-25 08:42:18,589 INFO L226 Difference]: Without dead ends: 123 [2018-07-25 08:42:18,590 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 08:42:18,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-25 08:42:18,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-07-25 08:42:18,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-07-25 08:42:18,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-07-25 08:42:18,617 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2018-07-25 08:42:18,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:18,617 INFO L472 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-07-25 08:42:18,618 INFO L473 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-25 08:42:18,618 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-07-25 08:42:18,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-25 08:42:18,618 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:18,618 INFO L354 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2018-07-25 08:42:18,619 INFO L415 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:18,619 INFO L82 PathProgramCache]: Analyzing trace with hash -133833447, now seen corresponding path program 59 times [2018-07-25 08:42:18,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:18,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:18,979 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:18,979 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-25 08:42:18,979 INFO L451 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-25 08:42:18,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-25 08:42:18,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 08:42:18,980 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 62 states. [2018-07-25 08:42:19,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:19,571 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-07-25 08:42:19,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 08:42:19,572 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-07-25 08:42:19,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:19,572 INFO L225 Difference]: With dead ends: 127 [2018-07-25 08:42:19,572 INFO L226 Difference]: Without dead ends: 125 [2018-07-25 08:42:19,573 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 08:42:19,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-25 08:42:19,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-07-25 08:42:19,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-25 08:42:19,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-07-25 08:42:19,606 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2018-07-25 08:42:19,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:19,607 INFO L472 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-07-25 08:42:19,607 INFO L473 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-25 08:42:19,607 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-07-25 08:42:19,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-25 08:42:19,608 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:19,608 INFO L354 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2018-07-25 08:42:19,608 INFO L415 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:19,608 INFO L82 PathProgramCache]: Analyzing trace with hash 235009301, now seen corresponding path program 60 times [2018-07-25 08:42:19,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:19,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:19,948 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:19,948 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-25 08:42:19,949 INFO L451 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-25 08:42:19,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-25 08:42:19,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 08:42:19,949 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 63 states. [2018-07-25 08:42:20,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:20,589 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-07-25 08:42:20,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-25 08:42:20,589 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-07-25 08:42:20,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:20,590 INFO L225 Difference]: With dead ends: 129 [2018-07-25 08:42:20,590 INFO L226 Difference]: Without dead ends: 127 [2018-07-25 08:42:20,591 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 08:42:20,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-25 08:42:20,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-07-25 08:42:20,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-25 08:42:20,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-07-25 08:42:20,630 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2018-07-25 08:42:20,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:20,631 INFO L472 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-07-25 08:42:20,631 INFO L473 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-25 08:42:20,631 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-07-25 08:42:20,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-25 08:42:20,632 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:20,632 INFO L354 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2018-07-25 08:42:20,632 INFO L415 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:20,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1789395439, now seen corresponding path program 61 times [2018-07-25 08:42:20,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:21,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:21,053 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:21,053 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-25 08:42:21,053 INFO L451 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-25 08:42:21,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-25 08:42:21,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 08:42:21,054 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 64 states. [2018-07-25 08:42:21,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:21,750 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-07-25 08:42:21,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-25 08:42:21,750 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-07-25 08:42:21,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:21,751 INFO L225 Difference]: With dead ends: 131 [2018-07-25 08:42:21,751 INFO L226 Difference]: Without dead ends: 129 [2018-07-25 08:42:21,752 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 08:42:21,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-25 08:42:21,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-07-25 08:42:21,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-25 08:42:21,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-07-25 08:42:21,792 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2018-07-25 08:42:21,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:21,792 INFO L472 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-07-25 08:42:21,793 INFO L473 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-25 08:42:21,793 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-07-25 08:42:21,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-25 08:42:21,793 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:21,793 INFO L354 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2018-07-25 08:42:21,794 INFO L415 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:21,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1622165491, now seen corresponding path program 62 times [2018-07-25 08:42:21,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:22,403 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:22,403 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-25 08:42:22,403 INFO L451 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-25 08:42:22,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-25 08:42:22,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 08:42:22,404 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 65 states. [2018-07-25 08:42:23,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:23,081 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-07-25 08:42:23,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-25 08:42:23,081 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-07-25 08:42:23,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:23,082 INFO L225 Difference]: With dead ends: 133 [2018-07-25 08:42:23,082 INFO L226 Difference]: Without dead ends: 131 [2018-07-25 08:42:23,083 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 08:42:23,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-25 08:42:23,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-07-25 08:42:23,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-25 08:42:23,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-07-25 08:42:23,113 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2018-07-25 08:42:23,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:23,114 INFO L472 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-07-25 08:42:23,114 INFO L473 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-25 08:42:23,114 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-07-25 08:42:23,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-25 08:42:23,115 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:23,115 INFO L354 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2018-07-25 08:42:23,115 INFO L415 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:23,116 INFO L82 PathProgramCache]: Analyzing trace with hash 172024585, now seen corresponding path program 63 times [2018-07-25 08:42:23,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:23,508 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:23,508 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-25 08:42:23,508 INFO L451 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-25 08:42:23,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-25 08:42:23,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 08:42:23,509 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 66 states. [2018-07-25 08:42:24,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:24,185 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-25 08:42:24,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-25 08:42:24,185 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-07-25 08:42:24,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:24,186 INFO L225 Difference]: With dead ends: 135 [2018-07-25 08:42:24,186 INFO L226 Difference]: Without dead ends: 133 [2018-07-25 08:42:24,187 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 08:42:24,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-25 08:42:24,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-07-25 08:42:24,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-25 08:42:24,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-07-25 08:42:24,221 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2018-07-25 08:42:24,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:24,222 INFO L472 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-07-25 08:42:24,222 INFO L473 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-25 08:42:24,222 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-07-25 08:42:24,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-25 08:42:24,223 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:24,223 INFO L354 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2018-07-25 08:42:24,223 INFO L415 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:24,223 INFO L82 PathProgramCache]: Analyzing trace with hash 2106801925, now seen corresponding path program 64 times [2018-07-25 08:42:24,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:24,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:24,632 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:24,632 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-25 08:42:24,632 INFO L451 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-25 08:42:24,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-25 08:42:24,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 08:42:24,633 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 67 states. [2018-07-25 08:42:25,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:25,379 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-07-25 08:42:25,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-25 08:42:25,379 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-07-25 08:42:25,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:25,380 INFO L225 Difference]: With dead ends: 137 [2018-07-25 08:42:25,380 INFO L226 Difference]: Without dead ends: 135 [2018-07-25 08:42:25,381 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 08:42:25,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-25 08:42:25,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-07-25 08:42:25,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-07-25 08:42:25,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-07-25 08:42:25,415 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2018-07-25 08:42:25,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:25,415 INFO L472 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-07-25 08:42:25,415 INFO L473 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-25 08:42:25,415 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-07-25 08:42:25,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-25 08:42:25,416 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:25,416 INFO L354 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2018-07-25 08:42:25,416 INFO L415 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:25,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1706986497, now seen corresponding path program 65 times [2018-07-25 08:42:25,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:25,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:25,830 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:25,830 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-25 08:42:25,831 INFO L451 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-25 08:42:25,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-25 08:42:25,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 08:42:25,831 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 68 states. [2018-07-25 08:42:26,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:26,592 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-07-25 08:42:26,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-25 08:42:26,592 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-07-25 08:42:26,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:26,593 INFO L225 Difference]: With dead ends: 139 [2018-07-25 08:42:26,593 INFO L226 Difference]: Without dead ends: 137 [2018-07-25 08:42:26,593 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 08:42:26,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-25 08:42:26,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-07-25 08:42:26,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-25 08:42:26,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-07-25 08:42:26,628 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2018-07-25 08:42:26,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:26,628 INFO L472 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-07-25 08:42:26,628 INFO L473 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-25 08:42:26,628 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-07-25 08:42:26,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-25 08:42:26,629 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:26,629 INFO L354 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2018-07-25 08:42:26,629 INFO L415 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:26,630 INFO L82 PathProgramCache]: Analyzing trace with hash -263550467, now seen corresponding path program 66 times [2018-07-25 08:42:26,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:27,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:27,101 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:27,101 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-25 08:42:27,101 INFO L451 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-25 08:42:27,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-25 08:42:27,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 08:42:27,102 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 69 states. [2018-07-25 08:42:27,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:27,922 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-07-25 08:42:27,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-25 08:42:27,922 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-07-25 08:42:27,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:27,923 INFO L225 Difference]: With dead ends: 141 [2018-07-25 08:42:27,923 INFO L226 Difference]: Without dead ends: 139 [2018-07-25 08:42:27,924 INFO L574 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-25 08:42:27,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-25 08:42:27,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-07-25 08:42:27,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-07-25 08:42:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-07-25 08:42:27,967 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2018-07-25 08:42:27,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:27,967 INFO L472 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-07-25 08:42:27,967 INFO L473 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-25 08:42:27,967 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-07-25 08:42:27,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-25 08:42:27,968 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:27,968 INFO L354 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2018-07-25 08:42:27,968 INFO L415 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:27,968 INFO L82 PathProgramCache]: Analyzing trace with hash 131004665, now seen corresponding path program 67 times [2018-07-25 08:42:27,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:28,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:28,710 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:28,711 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-25 08:42:28,711 INFO L451 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-25 08:42:28,711 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-25 08:42:28,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 08:42:28,712 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 70 states. [2018-07-25 08:42:29,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:29,531 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-07-25 08:42:29,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-25 08:42:29,532 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-07-25 08:42:29,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:29,533 INFO L225 Difference]: With dead ends: 143 [2018-07-25 08:42:29,533 INFO L226 Difference]: Without dead ends: 141 [2018-07-25 08:42:29,534 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 08:42:29,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-25 08:42:29,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-07-25 08:42:29,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-25 08:42:29,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-07-25 08:42:29,580 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2018-07-25 08:42:29,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:29,580 INFO L472 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-07-25 08:42:29,580 INFO L473 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-25 08:42:29,580 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-07-25 08:42:29,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-25 08:42:29,581 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:29,581 INFO L354 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2018-07-25 08:42:29,581 INFO L415 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:29,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1341364469, now seen corresponding path program 68 times [2018-07-25 08:42:29,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:30,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:30,042 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:30,042 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-25 08:42:30,043 INFO L451 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-25 08:42:30,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-25 08:42:30,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 08:42:30,044 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 71 states. [2018-07-25 08:42:30,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:30,861 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-07-25 08:42:30,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-25 08:42:30,861 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2018-07-25 08:42:30,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:30,862 INFO L225 Difference]: With dead ends: 145 [2018-07-25 08:42:30,862 INFO L226 Difference]: Without dead ends: 143 [2018-07-25 08:42:30,862 INFO L574 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-25 08:42:30,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-25 08:42:30,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-07-25 08:42:30,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-25 08:42:30,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-07-25 08:42:30,897 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2018-07-25 08:42:30,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:30,897 INFO L472 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-07-25 08:42:30,897 INFO L473 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-25 08:42:30,897 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-07-25 08:42:30,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-25 08:42:30,898 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:30,898 INFO L354 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1] [2018-07-25 08:42:30,898 INFO L415 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:30,898 INFO L82 PathProgramCache]: Analyzing trace with hash 560998897, now seen corresponding path program 69 times [2018-07-25 08:42:30,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:31,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:31,360 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:31,360 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-25 08:42:31,360 INFO L451 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-25 08:42:31,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-25 08:42:31,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 08:42:31,361 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 72 states. [2018-07-25 08:42:32,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:32,251 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-07-25 08:42:32,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-25 08:42:32,251 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-07-25 08:42:32,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:32,252 INFO L225 Difference]: With dead ends: 147 [2018-07-25 08:42:32,252 INFO L226 Difference]: Without dead ends: 145 [2018-07-25 08:42:32,253 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 08:42:32,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-25 08:42:32,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-07-25 08:42:32,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-25 08:42:32,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-07-25 08:42:32,295 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2018-07-25 08:42:32,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:32,296 INFO L472 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-07-25 08:42:32,296 INFO L473 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-25 08:42:32,296 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-07-25 08:42:32,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-25 08:42:32,297 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:32,297 INFO L354 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1] [2018-07-25 08:42:32,297 INFO L415 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:32,297 INFO L82 PathProgramCache]: Analyzing trace with hash -2046006291, now seen corresponding path program 70 times [2018-07-25 08:42:32,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:32,797 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:32,797 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:32,797 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-25 08:42:32,797 INFO L451 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-25 08:42:32,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-25 08:42:32,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 08:42:32,798 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 73 states. [2018-07-25 08:42:33,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:33,686 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-07-25 08:42:33,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-25 08:42:33,686 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-07-25 08:42:33,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:33,687 INFO L225 Difference]: With dead ends: 149 [2018-07-25 08:42:33,687 INFO L226 Difference]: Without dead ends: 147 [2018-07-25 08:42:33,687 INFO L574 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-25 08:42:33,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-25 08:42:33,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-07-25 08:42:33,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-25 08:42:33,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-07-25 08:42:33,737 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2018-07-25 08:42:33,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:33,737 INFO L472 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-07-25 08:42:33,737 INFO L473 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-25 08:42:33,738 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-07-25 08:42:33,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-25 08:42:33,738 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:33,738 INFO L354 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1] [2018-07-25 08:42:33,739 INFO L415 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:33,739 INFO L82 PathProgramCache]: Analyzing trace with hash 882908905, now seen corresponding path program 71 times [2018-07-25 08:42:33,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:34,208 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:34,209 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:34,209 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-25 08:42:34,209 INFO L451 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-25 08:42:34,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-25 08:42:34,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 08:42:34,210 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 74 states. [2018-07-25 08:42:35,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:35,110 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-07-25 08:42:35,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-25 08:42:35,111 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-07-25 08:42:35,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:35,111 INFO L225 Difference]: With dead ends: 151 [2018-07-25 08:42:35,112 INFO L226 Difference]: Without dead ends: 149 [2018-07-25 08:42:35,112 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 08:42:35,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-25 08:42:35,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-07-25 08:42:35,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-25 08:42:35,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-07-25 08:42:35,157 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2018-07-25 08:42:35,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:35,157 INFO L472 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-07-25 08:42:35,157 INFO L473 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-25 08:42:35,158 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-07-25 08:42:35,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-25 08:42:35,158 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:35,159 INFO L354 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1] [2018-07-25 08:42:35,159 INFO L415 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:35,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1928133915, now seen corresponding path program 72 times [2018-07-25 08:42:35,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:35,776 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:35,776 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:35,776 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-25 08:42:35,777 INFO L451 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-25 08:42:35,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-25 08:42:35,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 08:42:35,777 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 75 states. [2018-07-25 08:42:36,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:36,652 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-07-25 08:42:36,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-25 08:42:36,653 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-07-25 08:42:36,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:36,654 INFO L225 Difference]: With dead ends: 153 [2018-07-25 08:42:36,654 INFO L226 Difference]: Without dead ends: 151 [2018-07-25 08:42:36,654 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 08:42:36,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-25 08:42:36,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-07-25 08:42:36,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-25 08:42:36,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-07-25 08:42:36,710 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2018-07-25 08:42:36,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:36,710 INFO L472 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-07-25 08:42:36,710 INFO L473 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-25 08:42:36,710 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-07-25 08:42:36,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-25 08:42:36,711 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:36,711 INFO L354 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1] [2018-07-25 08:42:36,712 INFO L415 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:36,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1805854751, now seen corresponding path program 73 times [2018-07-25 08:42:36,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:37,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:37,451 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:37,451 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-25 08:42:37,452 INFO L451 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-25 08:42:37,452 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-25 08:42:37,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 08:42:37,453 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 76 states. [2018-07-25 08:42:38,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:38,384 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-07-25 08:42:38,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-25 08:42:38,384 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-07-25 08:42:38,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:38,385 INFO L225 Difference]: With dead ends: 155 [2018-07-25 08:42:38,385 INFO L226 Difference]: Without dead ends: 153 [2018-07-25 08:42:38,386 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 08:42:38,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-25 08:42:38,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-07-25 08:42:38,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-25 08:42:38,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-07-25 08:42:38,439 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2018-07-25 08:42:38,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:38,439 INFO L472 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-07-25 08:42:38,439 INFO L473 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-25 08:42:38,439 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-07-25 08:42:38,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-25 08:42:38,440 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:38,440 INFO L354 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1] [2018-07-25 08:42:38,440 INFO L415 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:38,440 INFO L82 PathProgramCache]: Analyzing trace with hash -259695139, now seen corresponding path program 74 times [2018-07-25 08:42:38,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:39,024 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:39,025 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:39,025 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-25 08:42:39,025 INFO L451 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-25 08:42:39,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-25 08:42:39,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 08:42:39,026 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 77 states. [2018-07-25 08:42:40,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:40,025 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-07-25 08:42:40,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-25 08:42:40,026 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2018-07-25 08:42:40,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:40,027 INFO L225 Difference]: With dead ends: 157 [2018-07-25 08:42:40,027 INFO L226 Difference]: Without dead ends: 155 [2018-07-25 08:42:40,027 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 08:42:40,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-25 08:42:40,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-25 08:42:40,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-25 08:42:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-07-25 08:42:40,078 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2018-07-25 08:42:40,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:40,078 INFO L472 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-07-25 08:42:40,079 INFO L473 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-25 08:42:40,079 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-07-25 08:42:40,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-25 08:42:40,079 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:40,080 INFO L354 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1] [2018-07-25 08:42:40,080 INFO L415 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:40,080 INFO L82 PathProgramCache]: Analyzing trace with hash -458992423, now seen corresponding path program 75 times [2018-07-25 08:42:40,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:40,628 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:40,629 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:40,629 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-25 08:42:40,629 INFO L451 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-25 08:42:40,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-25 08:42:40,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 08:42:40,631 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 78 states. [2018-07-25 08:42:41,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:41,596 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-07-25 08:42:41,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-25 08:42:41,596 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-07-25 08:42:41,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:41,597 INFO L225 Difference]: With dead ends: 159 [2018-07-25 08:42:41,597 INFO L226 Difference]: Without dead ends: 157 [2018-07-25 08:42:41,597 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 08:42:41,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-25 08:42:41,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-07-25 08:42:41,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-07-25 08:42:41,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-07-25 08:42:41,655 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2018-07-25 08:42:41,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:41,655 INFO L472 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-07-25 08:42:41,655 INFO L473 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-25 08:42:41,655 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-07-25 08:42:41,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-25 08:42:41,656 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:41,656 INFO L354 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1] [2018-07-25 08:42:41,657 INFO L415 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:41,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1289845973, now seen corresponding path program 76 times [2018-07-25 08:42:41,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:42,232 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:42,232 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:42,233 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-25 08:42:42,233 INFO L451 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-25 08:42:42,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-25 08:42:42,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 08:42:42,234 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 79 states. [2018-07-25 08:42:43,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:43,340 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-07-25 08:42:43,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-25 08:42:43,340 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-07-25 08:42:43,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:43,341 INFO L225 Difference]: With dead ends: 161 [2018-07-25 08:42:43,341 INFO L226 Difference]: Without dead ends: 159 [2018-07-25 08:42:43,342 INFO L574 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-25 08:42:43,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-07-25 08:42:43,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-07-25 08:42:43,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-07-25 08:42:43,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-07-25 08:42:43,414 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2018-07-25 08:42:43,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:43,414 INFO L472 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-07-25 08:42:43,414 INFO L473 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-25 08:42:43,414 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-07-25 08:42:43,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-25 08:42:43,415 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:43,415 INFO L354 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1] [2018-07-25 08:42:43,415 INFO L415 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:43,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1703635503, now seen corresponding path program 77 times [2018-07-25 08:42:43,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:43,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:43,997 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:43,998 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-25 08:42:43,998 INFO L451 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-25 08:42:43,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-25 08:42:43,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 08:42:43,999 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 80 states. [2018-07-25 08:42:45,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:45,078 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-07-25 08:42:45,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-25 08:42:45,078 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-07-25 08:42:45,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:45,079 INFO L225 Difference]: With dead ends: 163 [2018-07-25 08:42:45,079 INFO L226 Difference]: Without dead ends: 161 [2018-07-25 08:42:45,080 INFO L574 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-25 08:42:45,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-07-25 08:42:45,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-07-25 08:42:45,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-25 08:42:45,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-07-25 08:42:45,123 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2018-07-25 08:42:45,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:45,123 INFO L472 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-07-25 08:42:45,123 INFO L473 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-25 08:42:45,123 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-07-25 08:42:45,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-25 08:42:45,124 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:45,124 INFO L354 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1] [2018-07-25 08:42:45,124 INFO L415 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:45,124 INFO L82 PathProgramCache]: Analyzing trace with hash -811245619, now seen corresponding path program 78 times [2018-07-25 08:42:45,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:45,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:45,749 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:45,749 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-25 08:42:45,749 INFO L451 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-25 08:42:45,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-25 08:42:45,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 08:42:45,750 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 81 states. [2018-07-25 08:42:46,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:46,936 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-07-25 08:42:46,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-25 08:42:46,936 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-07-25 08:42:46,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:46,937 INFO L225 Difference]: With dead ends: 165 [2018-07-25 08:42:46,937 INFO L226 Difference]: Without dead ends: 163 [2018-07-25 08:42:46,938 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 08:42:46,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-25 08:42:46,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-07-25 08:42:46,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-25 08:42:46,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-07-25 08:42:46,993 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2018-07-25 08:42:46,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:46,994 INFO L472 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-07-25 08:42:46,994 INFO L473 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-25 08:42:46,994 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-07-25 08:42:46,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-25 08:42:46,995 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:46,995 INFO L354 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1] [2018-07-25 08:42:46,995 INFO L415 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:46,996 INFO L82 PathProgramCache]: Analyzing trace with hash 2076941001, now seen corresponding path program 79 times [2018-07-25 08:42:46,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:47,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:47,652 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:47,652 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-25 08:42:47,653 INFO L451 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-25 08:42:47,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-25 08:42:47,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 08:42:47,653 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 82 states. [2018-07-25 08:42:48,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:48,726 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-07-25 08:42:48,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-25 08:42:48,726 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-07-25 08:42:48,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:48,727 INFO L225 Difference]: With dead ends: 167 [2018-07-25 08:42:48,727 INFO L226 Difference]: Without dead ends: 165 [2018-07-25 08:42:48,728 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 08:42:48,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-07-25 08:42:48,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-07-25 08:42:48,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-07-25 08:42:48,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-07-25 08:42:48,771 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2018-07-25 08:42:48,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:48,771 INFO L472 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-07-25 08:42:48,771 INFO L473 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-25 08:42:48,772 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-07-25 08:42:48,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-25 08:42:48,772 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:48,772 INFO L354 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1] [2018-07-25 08:42:48,772 INFO L415 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:48,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1219557691, now seen corresponding path program 80 times [2018-07-25 08:42:48,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:49,408 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:49,408 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:49,408 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-25 08:42:49,408 INFO L451 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-25 08:42:49,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-25 08:42:49,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 08:42:49,409 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 83 states. [2018-07-25 08:42:50,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:50,546 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-07-25 08:42:50,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-25 08:42:50,546 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2018-07-25 08:42:50,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:50,547 INFO L225 Difference]: With dead ends: 169 [2018-07-25 08:42:50,547 INFO L226 Difference]: Without dead ends: 167 [2018-07-25 08:42:50,548 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 08:42:50,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-25 08:42:50,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-07-25 08:42:50,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-07-25 08:42:50,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-07-25 08:42:50,601 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2018-07-25 08:42:50,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:50,602 INFO L472 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-07-25 08:42:50,602 INFO L473 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-25 08:42:50,602 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-07-25 08:42:50,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-07-25 08:42:50,603 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:50,603 INFO L354 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1] [2018-07-25 08:42:50,603 INFO L415 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:50,603 INFO L82 PathProgramCache]: Analyzing trace with hash 531063745, now seen corresponding path program 81 times [2018-07-25 08:42:50,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:51,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:51,361 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:51,361 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-25 08:42:51,361 INFO L451 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-25 08:42:51,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-25 08:42:51,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 08:42:51,362 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 84 states. [2018-07-25 08:42:52,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:52,498 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-07-25 08:42:52,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-25 08:42:52,499 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-07-25 08:42:52,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:52,499 INFO L225 Difference]: With dead ends: 171 [2018-07-25 08:42:52,499 INFO L226 Difference]: Without dead ends: 169 [2018-07-25 08:42:52,500 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 08:42:52,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-07-25 08:42:52,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-07-25 08:42:52,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-07-25 08:42:52,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-07-25 08:42:52,545 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2018-07-25 08:42:52,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:52,546 INFO L472 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-07-25 08:42:52,546 INFO L473 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-25 08:42:52,546 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-07-25 08:42:52,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-07-25 08:42:52,546 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:52,546 INFO L354 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1] [2018-07-25 08:42:52,547 INFO L415 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:52,547 INFO L82 PathProgramCache]: Analyzing trace with hash -748916291, now seen corresponding path program 82 times [2018-07-25 08:42:52,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:53,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:53,219 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:53,220 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-25 08:42:53,220 INFO L451 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-25 08:42:53,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-25 08:42:53,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 08:42:53,221 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 85 states. [2018-07-25 08:42:54,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:54,426 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-07-25 08:42:54,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-25 08:42:54,426 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2018-07-25 08:42:54,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:54,427 INFO L225 Difference]: With dead ends: 173 [2018-07-25 08:42:54,428 INFO L226 Difference]: Without dead ends: 171 [2018-07-25 08:42:54,428 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 08:42:54,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-07-25 08:42:54,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-07-25 08:42:54,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-07-25 08:42:54,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-07-25 08:42:54,482 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2018-07-25 08:42:54,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:54,482 INFO L472 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-07-25 08:42:54,482 INFO L473 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-25 08:42:54,483 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-07-25 08:42:54,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-25 08:42:54,483 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:54,483 INFO L354 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1] [2018-07-25 08:42:54,484 INFO L415 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:54,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1845883065, now seen corresponding path program 83 times [2018-07-25 08:42:54,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:55,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:55,208 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:55,208 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-25 08:42:55,208 INFO L451 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-25 08:42:55,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-25 08:42:55,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 08:42:55,209 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 86 states. [2018-07-25 08:42:56,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:56,389 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-07-25 08:42:56,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-25 08:42:56,389 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-07-25 08:42:56,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:56,390 INFO L225 Difference]: With dead ends: 175 [2018-07-25 08:42:56,390 INFO L226 Difference]: Without dead ends: 173 [2018-07-25 08:42:56,391 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 08:42:56,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-07-25 08:42:56,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-07-25 08:42:56,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-25 08:42:56,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-07-25 08:42:56,440 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2018-07-25 08:42:56,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:56,440 INFO L472 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-07-25 08:42:56,441 INFO L473 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-25 08:42:56,441 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-07-25 08:42:56,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-25 08:42:56,441 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:56,441 INFO L354 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1] [2018-07-25 08:42:56,442 INFO L415 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:56,442 INFO L82 PathProgramCache]: Analyzing trace with hash 72065205, now seen corresponding path program 84 times [2018-07-25 08:42:56,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:57,170 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:57,170 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:57,170 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-25 08:42:57,170 INFO L451 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-25 08:42:57,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-25 08:42:57,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 08:42:57,171 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 87 states. [2018-07-25 08:42:58,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:42:58,416 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-07-25 08:42:58,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-25 08:42:58,416 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2018-07-25 08:42:58,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:42:58,417 INFO L225 Difference]: With dead ends: 177 [2018-07-25 08:42:58,417 INFO L226 Difference]: Without dead ends: 175 [2018-07-25 08:42:58,418 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 08:42:58,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-07-25 08:42:58,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-07-25 08:42:58,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-07-25 08:42:58,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-07-25 08:42:58,469 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2018-07-25 08:42:58,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:42:58,469 INFO L472 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-07-25 08:42:58,469 INFO L473 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-25 08:42:58,469 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-07-25 08:42:58,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-07-25 08:42:58,470 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:42:58,470 INFO L354 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1] [2018-07-25 08:42:58,471 INFO L415 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:42:58,471 INFO L82 PathProgramCache]: Analyzing trace with hash 535118257, now seen corresponding path program 85 times [2018-07-25 08:42:58,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:42:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:42:59,296 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:42:59,296 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:42:59,296 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-25 08:42:59,297 INFO L451 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-25 08:42:59,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-25 08:42:59,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 08:42:59,298 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 88 states. [2018-07-25 08:43:00,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:00,483 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-07-25 08:43:00,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-25 08:43:00,484 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-07-25 08:43:00,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:00,485 INFO L225 Difference]: With dead ends: 179 [2018-07-25 08:43:00,485 INFO L226 Difference]: Without dead ends: 177 [2018-07-25 08:43:00,485 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 08:43:00,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-07-25 08:43:00,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-07-25 08:43:00,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-07-25 08:43:00,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-07-25 08:43:00,544 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2018-07-25 08:43:00,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:00,544 INFO L472 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-07-25 08:43:00,545 INFO L473 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-25 08:43:00,545 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-07-25 08:43:00,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-25 08:43:00,546 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:00,546 INFO L354 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1] [2018-07-25 08:43:00,546 INFO L415 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:00,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1147497555, now seen corresponding path program 86 times [2018-07-25 08:43:00,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:01,341 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:01,341 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:01,342 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-25 08:43:01,342 INFO L451 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-25 08:43:01,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-25 08:43:01,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 08:43:01,343 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 89 states. [2018-07-25 08:43:02,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:02,546 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-07-25 08:43:02,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-25 08:43:02,546 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2018-07-25 08:43:02,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:02,547 INFO L225 Difference]: With dead ends: 181 [2018-07-25 08:43:02,547 INFO L226 Difference]: Without dead ends: 179 [2018-07-25 08:43:02,548 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 08:43:02,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-25 08:43:02,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-07-25 08:43:02,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-07-25 08:43:02,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-07-25 08:43:02,603 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2018-07-25 08:43:02,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:02,603 INFO L472 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-07-25 08:43:02,603 INFO L473 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-25 08:43:02,603 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-07-25 08:43:02,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-25 08:43:02,604 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:02,604 INFO L354 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1] [2018-07-25 08:43:02,604 INFO L415 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:02,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1061377705, now seen corresponding path program 87 times [2018-07-25 08:43:02,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:03,374 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:03,375 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:03,375 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-25 08:43:03,375 INFO L451 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-25 08:43:03,375 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-25 08:43:03,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 08:43:03,376 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 90 states. [2018-07-25 08:43:04,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:04,700 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-07-25 08:43:04,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-25 08:43:04,700 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-07-25 08:43:04,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:04,701 INFO L225 Difference]: With dead ends: 183 [2018-07-25 08:43:04,701 INFO L226 Difference]: Without dead ends: 181 [2018-07-25 08:43:04,702 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 08:43:04,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-07-25 08:43:04,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-07-25 08:43:04,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-25 08:43:04,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-07-25 08:43:04,755 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2018-07-25 08:43:04,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:04,755 INFO L472 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-07-25 08:43:04,755 INFO L473 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-25 08:43:04,755 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-07-25 08:43:04,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-25 08:43:04,756 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:04,756 INFO L354 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1] [2018-07-25 08:43:04,756 INFO L415 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:04,756 INFO L82 PathProgramCache]: Analyzing trace with hash 2076658341, now seen corresponding path program 88 times [2018-07-25 08:43:04,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:05,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:05,541 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:05,541 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-25 08:43:05,542 INFO L451 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-25 08:43:05,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-25 08:43:05,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 08:43:05,543 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 91 states. [2018-07-25 08:43:06,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:06,857 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-07-25 08:43:06,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-25 08:43:06,857 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2018-07-25 08:43:06,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:06,858 INFO L225 Difference]: With dead ends: 185 [2018-07-25 08:43:06,858 INFO L226 Difference]: Without dead ends: 183 [2018-07-25 08:43:06,858 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 08:43:06,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-25 08:43:06,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-07-25 08:43:06,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-25 08:43:06,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-07-25 08:43:06,913 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2018-07-25 08:43:06,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:06,914 INFO L472 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-07-25 08:43:06,914 INFO L473 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-25 08:43:06,914 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-07-25 08:43:06,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-07-25 08:43:06,915 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:06,915 INFO L354 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1] [2018-07-25 08:43:06,915 INFO L415 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:06,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1491193951, now seen corresponding path program 89 times [2018-07-25 08:43:06,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:07,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:07,763 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:07,763 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-25 08:43:07,763 INFO L451 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-25 08:43:07,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-25 08:43:07,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 08:43:07,764 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 92 states. [2018-07-25 08:43:09,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:09,061 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-07-25 08:43:09,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-25 08:43:09,061 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2018-07-25 08:43:09,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:09,062 INFO L225 Difference]: With dead ends: 187 [2018-07-25 08:43:09,062 INFO L226 Difference]: Without dead ends: 185 [2018-07-25 08:43:09,063 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 08:43:09,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-25 08:43:09,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-07-25 08:43:09,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-25 08:43:09,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-07-25 08:43:09,118 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2018-07-25 08:43:09,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:09,118 INFO L472 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-07-25 08:43:09,118 INFO L473 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-25 08:43:09,119 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-07-25 08:43:09,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-25 08:43:09,119 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:09,119 INFO L354 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1] [2018-07-25 08:43:09,119 INFO L415 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:09,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1481622941, now seen corresponding path program 90 times [2018-07-25 08:43:09,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:10,049 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:10,049 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:10,049 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-25 08:43:10,050 INFO L451 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-25 08:43:10,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-25 08:43:10,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 08:43:10,051 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 93 states. [2018-07-25 08:43:11,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:11,422 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-07-25 08:43:11,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-25 08:43:11,423 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2018-07-25 08:43:11,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:11,424 INFO L225 Difference]: With dead ends: 189 [2018-07-25 08:43:11,424 INFO L226 Difference]: Without dead ends: 187 [2018-07-25 08:43:11,425 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 08:43:11,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-07-25 08:43:11,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-07-25 08:43:11,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-07-25 08:43:11,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-07-25 08:43:11,502 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2018-07-25 08:43:11,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:11,502 INFO L472 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-07-25 08:43:11,502 INFO L473 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-25 08:43:11,502 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-07-25 08:43:11,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-07-25 08:43:11,503 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:11,503 INFO L354 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1] [2018-07-25 08:43:11,504 INFO L415 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:11,504 INFO L82 PathProgramCache]: Analyzing trace with hash -2089562983, now seen corresponding path program 91 times [2018-07-25 08:43:11,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:12,396 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:12,396 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-25 08:43:12,396 INFO L451 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-25 08:43:12,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-25 08:43:12,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 08:43:12,397 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 94 states. [2018-07-25 08:43:13,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:13,823 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-07-25 08:43:13,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-25 08:43:13,823 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2018-07-25 08:43:13,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:13,824 INFO L225 Difference]: With dead ends: 191 [2018-07-25 08:43:13,824 INFO L226 Difference]: Without dead ends: 189 [2018-07-25 08:43:13,825 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 08:43:13,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-07-25 08:43:13,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-07-25 08:43:13,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-07-25 08:43:13,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-07-25 08:43:13,882 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2018-07-25 08:43:13,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:13,882 INFO L472 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-07-25 08:43:13,882 INFO L473 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-25 08:43:13,882 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-07-25 08:43:13,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-07-25 08:43:13,883 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:13,883 INFO L354 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1] [2018-07-25 08:43:13,883 INFO L415 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:13,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1974600853, now seen corresponding path program 92 times [2018-07-25 08:43:13,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:14,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:14,802 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:14,802 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:14,802 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-25 08:43:14,802 INFO L451 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-25 08:43:14,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-25 08:43:14,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 08:43:14,803 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 95 states. [2018-07-25 08:43:16,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:16,066 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-07-25 08:43:16,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-25 08:43:16,066 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2018-07-25 08:43:16,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:16,067 INFO L225 Difference]: With dead ends: 193 [2018-07-25 08:43:16,067 INFO L226 Difference]: Without dead ends: 191 [2018-07-25 08:43:16,068 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 08:43:16,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-07-25 08:43:16,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-07-25 08:43:16,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-07-25 08:43:16,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-07-25 08:43:16,124 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2018-07-25 08:43:16,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:16,124 INFO L472 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-07-25 08:43:16,124 INFO L473 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-25 08:43:16,124 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-07-25 08:43:16,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-07-25 08:43:16,125 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:16,125 INFO L354 BasicCegarLoop]: trace histogram [94, 93, 1, 1, 1] [2018-07-25 08:43:16,126 INFO L415 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:16,126 INFO L82 PathProgramCache]: Analyzing trace with hash -784192111, now seen corresponding path program 93 times [2018-07-25 08:43:16,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:16,978 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:16,978 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:16,978 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-25 08:43:16,978 INFO L451 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-25 08:43:16,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-25 08:43:16,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 08:43:16,979 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 96 states. [2018-07-25 08:43:18,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:18,390 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-07-25 08:43:18,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-25 08:43:18,390 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2018-07-25 08:43:18,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:18,391 INFO L225 Difference]: With dead ends: 195 [2018-07-25 08:43:18,392 INFO L226 Difference]: Without dead ends: 193 [2018-07-25 08:43:18,392 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 08:43:18,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-07-25 08:43:18,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-07-25 08:43:18,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-07-25 08:43:18,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-07-25 08:43:18,474 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 190 [2018-07-25 08:43:18,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:18,474 INFO L472 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-07-25 08:43:18,474 INFO L473 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-25 08:43:18,474 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-07-25 08:43:18,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-07-25 08:43:18,475 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:18,475 INFO L354 BasicCegarLoop]: trace histogram [95, 94, 1, 1, 1] [2018-07-25 08:43:18,475 INFO L415 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:18,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1989408883, now seen corresponding path program 94 times [2018-07-25 08:43:18,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:19,425 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:19,425 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:19,425 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-25 08:43:19,426 INFO L451 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-25 08:43:19,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-25 08:43:19,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 08:43:19,427 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 97 states. [2018-07-25 08:43:20,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:20,986 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-07-25 08:43:20,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-25 08:43:20,987 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2018-07-25 08:43:20,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:20,988 INFO L225 Difference]: With dead ends: 197 [2018-07-25 08:43:20,988 INFO L226 Difference]: Without dead ends: 195 [2018-07-25 08:43:20,989 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 08:43:20,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-07-25 08:43:21,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-07-25 08:43:21,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-07-25 08:43:21,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-07-25 08:43:21,067 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 192 [2018-07-25 08:43:21,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:21,068 INFO L472 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-07-25 08:43:21,068 INFO L473 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-25 08:43:21,068 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-07-25 08:43:21,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-07-25 08:43:21,068 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:21,069 INFO L354 BasicCegarLoop]: trace histogram [96, 95, 1, 1, 1] [2018-07-25 08:43:21,069 INFO L415 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:21,069 INFO L82 PathProgramCache]: Analyzing trace with hash -561556855, now seen corresponding path program 95 times [2018-07-25 08:43:21,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:22,054 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:22,054 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:22,055 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-25 08:43:22,055 INFO L451 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-25 08:43:22,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-25 08:43:22,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 08:43:22,056 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 98 states. [2018-07-25 08:43:23,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:23,633 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-07-25 08:43:23,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-25 08:43:23,633 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2018-07-25 08:43:23,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:23,634 INFO L225 Difference]: With dead ends: 199 [2018-07-25 08:43:23,634 INFO L226 Difference]: Without dead ends: 197 [2018-07-25 08:43:23,635 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 08:43:23,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-07-25 08:43:23,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-07-25 08:43:23,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-07-25 08:43:23,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-07-25 08:43:23,702 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 194 [2018-07-25 08:43:23,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:23,702 INFO L472 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-07-25 08:43:23,703 INFO L473 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-25 08:43:23,703 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-07-25 08:43:23,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-07-25 08:43:23,704 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:23,704 INFO L354 BasicCegarLoop]: trace histogram [97, 96, 1, 1, 1] [2018-07-25 08:43:23,704 INFO L415 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:23,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1509674629, now seen corresponding path program 96 times [2018-07-25 08:43:23,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:24,781 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:24,781 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:24,781 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-25 08:43:24,782 INFO L451 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-25 08:43:24,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-25 08:43:24,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 08:43:24,782 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 99 states. [2018-07-25 08:43:26,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:26,357 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-07-25 08:43:26,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-25 08:43:26,357 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2018-07-25 08:43:26,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:26,358 INFO L225 Difference]: With dead ends: 201 [2018-07-25 08:43:26,358 INFO L226 Difference]: Without dead ends: 199 [2018-07-25 08:43:26,358 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 08:43:26,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-07-25 08:43:26,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-07-25 08:43:26,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-07-25 08:43:26,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-07-25 08:43:26,435 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 196 [2018-07-25 08:43:26,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:26,435 INFO L472 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-07-25 08:43:26,435 INFO L473 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-25 08:43:26,435 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-07-25 08:43:26,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-07-25 08:43:26,436 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:26,437 INFO L354 BasicCegarLoop]: trace histogram [98, 97, 1, 1, 1] [2018-07-25 08:43:26,437 INFO L415 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:26,437 INFO L82 PathProgramCache]: Analyzing trace with hash -901694591, now seen corresponding path program 97 times [2018-07-25 08:43:26,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:27,447 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:27,447 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:27,448 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-25 08:43:27,448 INFO L451 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-25 08:43:27,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-25 08:43:27,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 08:43:27,449 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 100 states. [2018-07-25 08:43:29,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:29,136 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-07-25 08:43:29,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-25 08:43:29,137 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2018-07-25 08:43:29,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:29,138 INFO L225 Difference]: With dead ends: 203 [2018-07-25 08:43:29,138 INFO L226 Difference]: Without dead ends: 201 [2018-07-25 08:43:29,138 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 08:43:29,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-07-25 08:43:29,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-07-25 08:43:29,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-07-25 08:43:29,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-07-25 08:43:29,204 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 198 [2018-07-25 08:43:29,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:29,204 INFO L472 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-07-25 08:43:29,204 INFO L473 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-25 08:43:29,204 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-07-25 08:43:29,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-07-25 08:43:29,205 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:29,205 INFO L354 BasicCegarLoop]: trace histogram [99, 98, 1, 1, 1] [2018-07-25 08:43:29,205 INFO L415 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:29,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1054824829, now seen corresponding path program 98 times [2018-07-25 08:43:29,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:30,232 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:30,233 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:30,233 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-25 08:43:30,233 INFO L451 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-25 08:43:30,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-25 08:43:30,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 08:43:30,234 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 101 states. [2018-07-25 08:43:31,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:31,906 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-07-25 08:43:31,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-25 08:43:31,907 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2018-07-25 08:43:31,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:31,908 INFO L225 Difference]: With dead ends: 205 [2018-07-25 08:43:31,908 INFO L226 Difference]: Without dead ends: 203 [2018-07-25 08:43:31,909 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 08:43:31,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-07-25 08:43:31,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-07-25 08:43:31,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-25 08:43:31,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-07-25 08:43:31,996 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 200 [2018-07-25 08:43:31,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:31,996 INFO L472 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-07-25 08:43:31,997 INFO L473 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-25 08:43:31,997 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-07-25 08:43:31,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-07-25 08:43:31,998 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:31,998 INFO L354 BasicCegarLoop]: trace histogram [100, 99, 1, 1, 1] [2018-07-25 08:43:31,998 INFO L415 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:31,998 INFO L82 PathProgramCache]: Analyzing trace with hash 74311801, now seen corresponding path program 99 times [2018-07-25 08:43:31,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:32,999 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:33,000 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:33,000 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-25 08:43:33,000 INFO L451 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-25 08:43:33,000 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-25 08:43:33,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 08:43:33,001 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 102 states. [2018-07-25 08:43:34,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:34,613 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-07-25 08:43:34,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-25 08:43:34,613 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2018-07-25 08:43:34,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:34,614 INFO L225 Difference]: With dead ends: 207 [2018-07-25 08:43:34,614 INFO L226 Difference]: Without dead ends: 205 [2018-07-25 08:43:34,615 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 08:43:34,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-07-25 08:43:34,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-07-25 08:43:34,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-07-25 08:43:34,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-07-25 08:43:34,682 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 202 [2018-07-25 08:43:34,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:34,682 INFO L472 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-07-25 08:43:34,682 INFO L473 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-25 08:43:34,683 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-07-25 08:43:34,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-07-25 08:43:34,684 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:34,684 INFO L354 BasicCegarLoop]: trace histogram [101, 100, 1, 1, 1] [2018-07-25 08:43:34,684 INFO L415 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:34,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1600870283, now seen corresponding path program 100 times [2018-07-25 08:43:34,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:35,979 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:35,979 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:35,979 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-25 08:43:35,979 INFO L451 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-25 08:43:35,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-25 08:43:35,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 08:43:35,980 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 103 states. [2018-07-25 08:43:37,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:37,626 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-07-25 08:43:37,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-25 08:43:37,626 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2018-07-25 08:43:37,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:37,627 INFO L225 Difference]: With dead ends: 209 [2018-07-25 08:43:37,627 INFO L226 Difference]: Without dead ends: 207 [2018-07-25 08:43:37,628 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 08:43:37,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-07-25 08:43:37,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-07-25 08:43:37,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-07-25 08:43:37,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-07-25 08:43:37,707 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 204 [2018-07-25 08:43:37,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:37,708 INFO L472 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-07-25 08:43:37,708 INFO L473 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-25 08:43:37,708 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-07-25 08:43:37,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-07-25 08:43:37,708 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:37,709 INFO L354 BasicCegarLoop]: trace histogram [102, 101, 1, 1, 1] [2018-07-25 08:43:37,709 INFO L415 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:37,709 INFO L82 PathProgramCache]: Analyzing trace with hash -838117007, now seen corresponding path program 101 times [2018-07-25 08:43:37,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:38,784 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:38,785 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:38,785 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-25 08:43:38,785 INFO L451 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-25 08:43:38,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-25 08:43:38,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 08:43:38,787 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 104 states. [2018-07-25 08:43:40,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:40,568 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-07-25 08:43:40,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-25 08:43:40,569 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2018-07-25 08:43:40,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:40,570 INFO L225 Difference]: With dead ends: 211 [2018-07-25 08:43:40,570 INFO L226 Difference]: Without dead ends: 209 [2018-07-25 08:43:40,571 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 08:43:40,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-07-25 08:43:40,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-07-25 08:43:40,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-07-25 08:43:40,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-07-25 08:43:40,643 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 206 [2018-07-25 08:43:40,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:40,643 INFO L472 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-07-25 08:43:40,643 INFO L473 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-25 08:43:40,643 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-07-25 08:43:40,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-07-25 08:43:40,644 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:40,644 INFO L354 BasicCegarLoop]: trace histogram [103, 102, 1, 1, 1] [2018-07-25 08:43:40,644 INFO L415 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:40,644 INFO L82 PathProgramCache]: Analyzing trace with hash 2023340909, now seen corresponding path program 102 times [2018-07-25 08:43:40,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:41,821 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:41,822 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:41,822 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-07-25 08:43:41,822 INFO L451 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-25 08:43:41,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-25 08:43:41,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 08:43:41,823 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 105 states. [2018-07-25 08:43:43,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:43,615 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-07-25 08:43:43,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-07-25 08:43:43,615 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2018-07-25 08:43:43,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:43,616 INFO L225 Difference]: With dead ends: 213 [2018-07-25 08:43:43,616 INFO L226 Difference]: Without dead ends: 211 [2018-07-25 08:43:43,617 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 08:43:43,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-07-25 08:43:43,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-07-25 08:43:43,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-07-25 08:43:43,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-07-25 08:43:43,690 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 208 [2018-07-25 08:43:43,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:43,690 INFO L472 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-07-25 08:43:43,690 INFO L473 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-25 08:43:43,690 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-07-25 08:43:43,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-07-25 08:43:43,691 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:43,691 INFO L354 BasicCegarLoop]: trace histogram [104, 103, 1, 1, 1] [2018-07-25 08:43:43,691 INFO L415 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:43,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1189638551, now seen corresponding path program 103 times [2018-07-25 08:43:43,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:44,815 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:44,815 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:44,815 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-25 08:43:44,816 INFO L451 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-07-25 08:43:44,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-07-25 08:43:44,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 08:43:44,817 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 106 states. [2018-07-25 08:43:46,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:46,538 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-07-25 08:43:46,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-25 08:43:46,538 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2018-07-25 08:43:46,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:46,539 INFO L225 Difference]: With dead ends: 215 [2018-07-25 08:43:46,539 INFO L226 Difference]: Without dead ends: 213 [2018-07-25 08:43:46,539 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 08:43:46,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-07-25 08:43:46,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-07-25 08:43:46,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-07-25 08:43:46,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-07-25 08:43:46,639 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 210 [2018-07-25 08:43:46,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:46,639 INFO L472 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-07-25 08:43:46,639 INFO L473 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-07-25 08:43:46,639 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-07-25 08:43:46,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-07-25 08:43:46,640 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:46,641 INFO L354 BasicCegarLoop]: trace histogram [105, 104, 1, 1, 1] [2018-07-25 08:43:46,641 INFO L415 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:46,641 INFO L82 PathProgramCache]: Analyzing trace with hash -781413787, now seen corresponding path program 104 times [2018-07-25 08:43:46,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:47,836 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:47,836 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:47,836 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-07-25 08:43:47,837 INFO L451 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-07-25 08:43:47,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-07-25 08:43:47,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 08:43:47,838 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 107 states. [2018-07-25 08:43:49,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:49,742 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-07-25 08:43:49,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-07-25 08:43:49,742 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 212 [2018-07-25 08:43:49,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:49,743 INFO L225 Difference]: With dead ends: 217 [2018-07-25 08:43:49,743 INFO L226 Difference]: Without dead ends: 215 [2018-07-25 08:43:49,744 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 08:43:49,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-07-25 08:43:49,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-07-25 08:43:49,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-07-25 08:43:49,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-07-25 08:43:49,854 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 212 [2018-07-25 08:43:49,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:49,854 INFO L472 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-07-25 08:43:49,854 INFO L473 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-07-25 08:43:49,855 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-07-25 08:43:49,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-07-25 08:43:49,855 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:49,855 INFO L354 BasicCegarLoop]: trace histogram [106, 105, 1, 1, 1] [2018-07-25 08:43:49,856 INFO L415 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:49,856 INFO L82 PathProgramCache]: Analyzing trace with hash 680560481, now seen corresponding path program 105 times [2018-07-25 08:43:49,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:51,010 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:51,011 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:51,011 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-07-25 08:43:51,011 INFO L451 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-07-25 08:43:51,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-07-25 08:43:51,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 08:43:51,012 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 108 states. [2018-07-25 08:43:52,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:52,934 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-07-25 08:43:52,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-25 08:43:52,935 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 214 [2018-07-25 08:43:52,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:52,936 INFO L225 Difference]: With dead ends: 219 [2018-07-25 08:43:52,936 INFO L226 Difference]: Without dead ends: 217 [2018-07-25 08:43:52,936 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 08:43:52,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-07-25 08:43:53,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-07-25 08:43:53,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-07-25 08:43:53,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-07-25 08:43:53,014 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 214 [2018-07-25 08:43:53,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:53,014 INFO L472 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-07-25 08:43:53,014 INFO L473 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-07-25 08:43:53,014 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-07-25 08:43:53,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-07-25 08:43:53,015 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:53,015 INFO L354 BasicCegarLoop]: trace histogram [107, 106, 1, 1, 1] [2018-07-25 08:43:53,015 INFO L415 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:53,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1183526237, now seen corresponding path program 106 times [2018-07-25 08:43:53,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:54,279 INFO L134 CoverageAnalysis]: Checked inductivity of 11342 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:54,280 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:54,280 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-07-25 08:43:54,280 INFO L451 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-07-25 08:43:54,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-07-25 08:43:54,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 08:43:54,281 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 109 states. [2018-07-25 08:43:56,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:56,221 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-07-25 08:43:56,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-07-25 08:43:56,222 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 216 [2018-07-25 08:43:56,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:56,222 INFO L225 Difference]: With dead ends: 221 [2018-07-25 08:43:56,222 INFO L226 Difference]: Without dead ends: 219 [2018-07-25 08:43:56,223 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 08:43:56,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-07-25 08:43:56,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-07-25 08:43:56,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-07-25 08:43:56,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-07-25 08:43:56,299 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 216 [2018-07-25 08:43:56,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:56,300 INFO L472 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-07-25 08:43:56,300 INFO L473 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-07-25 08:43:56,300 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-07-25 08:43:56,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-07-25 08:43:56,300 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:56,300 INFO L354 BasicCegarLoop]: trace histogram [108, 107, 1, 1, 1] [2018-07-25 08:43:56,301 INFO L415 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:56,301 INFO L82 PathProgramCache]: Analyzing trace with hash -797686695, now seen corresponding path program 107 times [2018-07-25 08:43:56,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:43:57,501 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:43:57,501 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:43:57,502 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-07-25 08:43:57,502 INFO L451 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-07-25 08:43:57,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-07-25 08:43:57,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 08:43:57,503 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 110 states. [2018-07-25 08:43:59,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:43:59,491 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-07-25 08:43:59,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-07-25 08:43:59,491 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 218 [2018-07-25 08:43:59,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:43:59,492 INFO L225 Difference]: With dead ends: 223 [2018-07-25 08:43:59,492 INFO L226 Difference]: Without dead ends: 221 [2018-07-25 08:43:59,492 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 08:43:59,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-07-25 08:43:59,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-07-25 08:43:59,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-07-25 08:43:59,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-07-25 08:43:59,572 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 218 [2018-07-25 08:43:59,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:43:59,572 INFO L472 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-07-25 08:43:59,572 INFO L473 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-07-25 08:43:59,572 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-07-25 08:43:59,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-07-25 08:43:59,573 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:43:59,573 INFO L354 BasicCegarLoop]: trace histogram [109, 108, 1, 1, 1] [2018-07-25 08:43:59,573 INFO L415 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:43:59,573 INFO L82 PathProgramCache]: Analyzing trace with hash -2072802219, now seen corresponding path program 108 times [2018-07-25 08:43:59,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:43:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:00,842 INFO L134 CoverageAnalysis]: Checked inductivity of 11772 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:00,842 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:00,843 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-07-25 08:44:00,843 INFO L451 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-07-25 08:44:00,843 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-07-25 08:44:00,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 08:44:00,844 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 111 states. [2018-07-25 08:44:02,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:02,871 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-07-25 08:44:02,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-25 08:44:02,871 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 220 [2018-07-25 08:44:02,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:02,872 INFO L225 Difference]: With dead ends: 225 [2018-07-25 08:44:02,872 INFO L226 Difference]: Without dead ends: 223 [2018-07-25 08:44:02,872 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 08:44:02,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-07-25 08:44:02,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-07-25 08:44:02,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-07-25 08:44:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-07-25 08:44:02,971 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 220 [2018-07-25 08:44:02,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:02,971 INFO L472 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-07-25 08:44:02,971 INFO L473 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-07-25 08:44:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-07-25 08:44:02,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-07-25 08:44:02,972 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:02,972 INFO L354 BasicCegarLoop]: trace histogram [110, 109, 1, 1, 1] [2018-07-25 08:44:02,972 INFO L415 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:02,973 INFO L82 PathProgramCache]: Analyzing trace with hash 901825873, now seen corresponding path program 109 times [2018-07-25 08:44:02,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 11990 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:04,278 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:04,278 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-07-25 08:44:04,278 INFO L451 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-07-25 08:44:04,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-07-25 08:44:04,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 08:44:04,279 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 112 states. [2018-07-25 08:44:06,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:06,262 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-07-25 08:44:06,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-25 08:44:06,262 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 222 [2018-07-25 08:44:06,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:06,263 INFO L225 Difference]: With dead ends: 227 [2018-07-25 08:44:06,263 INFO L226 Difference]: Without dead ends: 225 [2018-07-25 08:44:06,264 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 08:44:06,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-07-25 08:44:06,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-07-25 08:44:06,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-07-25 08:44:06,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-07-25 08:44:06,376 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 222 [2018-07-25 08:44:06,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:06,376 INFO L472 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-07-25 08:44:06,376 INFO L473 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-07-25 08:44:06,376 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-07-25 08:44:06,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-07-25 08:44:06,377 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:06,377 INFO L354 BasicCegarLoop]: trace histogram [111, 110, 1, 1, 1] [2018-07-25 08:44:06,377 INFO L415 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:06,377 INFO L82 PathProgramCache]: Analyzing trace with hash -928796851, now seen corresponding path program 110 times [2018-07-25 08:44:06,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:07,694 INFO L134 CoverageAnalysis]: Checked inductivity of 12210 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:07,694 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:07,695 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-07-25 08:44:07,695 INFO L451 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-07-25 08:44:07,695 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-07-25 08:44:07,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 08:44:07,696 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 113 states. [2018-07-25 08:44:09,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:09,707 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-07-25 08:44:09,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-25 08:44:09,707 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 224 [2018-07-25 08:44:09,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:09,708 INFO L225 Difference]: With dead ends: 229 [2018-07-25 08:44:09,708 INFO L226 Difference]: Without dead ends: 227 [2018-07-25 08:44:09,709 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 08:44:09,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-07-25 08:44:09,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-07-25 08:44:09,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-07-25 08:44:09,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-07-25 08:44:09,792 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 224 [2018-07-25 08:44:09,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:09,792 INFO L472 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-07-25 08:44:09,792 INFO L473 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-07-25 08:44:09,792 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-07-25 08:44:09,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-07-25 08:44:09,793 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:09,793 INFO L354 BasicCegarLoop]: trace histogram [112, 111, 1, 1, 1] [2018-07-25 08:44:09,793 INFO L415 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:09,793 INFO L82 PathProgramCache]: Analyzing trace with hash 779356745, now seen corresponding path program 111 times [2018-07-25 08:44:09,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:11,124 INFO L134 CoverageAnalysis]: Checked inductivity of 12432 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:11,124 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:11,124 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-07-25 08:44:11,124 INFO L451 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-07-25 08:44:11,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-07-25 08:44:11,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 08:44:11,126 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 114 states. [2018-07-25 08:44:13,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:13,184 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-07-25 08:44:13,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-07-25 08:44:13,185 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 226 [2018-07-25 08:44:13,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:13,185 INFO L225 Difference]: With dead ends: 231 [2018-07-25 08:44:13,185 INFO L226 Difference]: Without dead ends: 229 [2018-07-25 08:44:13,186 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 08:44:13,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-07-25 08:44:13,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-07-25 08:44:13,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-07-25 08:44:13,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-07-25 08:44:13,271 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 226 [2018-07-25 08:44:13,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:13,272 INFO L472 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-07-25 08:44:13,272 INFO L473 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-07-25 08:44:13,272 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-07-25 08:44:13,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-07-25 08:44:13,272 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:13,272 INFO L354 BasicCegarLoop]: trace histogram [113, 112, 1, 1, 1] [2018-07-25 08:44:13,273 INFO L415 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:13,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1637455429, now seen corresponding path program 112 times [2018-07-25 08:44:13,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:14,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12656 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:14,709 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:14,709 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-07-25 08:44:14,710 INFO L451 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-07-25 08:44:14,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-07-25 08:44:14,710 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 08:44:14,711 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 115 states. [2018-07-25 08:44:16,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:16,826 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-07-25 08:44:16,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-07-25 08:44:16,826 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 228 [2018-07-25 08:44:16,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:16,827 INFO L225 Difference]: With dead ends: 233 [2018-07-25 08:44:16,827 INFO L226 Difference]: Without dead ends: 231 [2018-07-25 08:44:16,828 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 08:44:16,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-07-25 08:44:16,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-07-25 08:44:16,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-07-25 08:44:16,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-07-25 08:44:16,948 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 228 [2018-07-25 08:44:16,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:16,948 INFO L472 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-07-25 08:44:16,948 INFO L473 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-07-25 08:44:16,948 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-07-25 08:44:16,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-07-25 08:44:16,949 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:16,949 INFO L354 BasicCegarLoop]: trace histogram [114, 113, 1, 1, 1] [2018-07-25 08:44:16,949 INFO L415 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:16,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1636569921, now seen corresponding path program 113 times [2018-07-25 08:44:16,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:18,415 INFO L134 CoverageAnalysis]: Checked inductivity of 12882 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:18,415 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:18,415 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-07-25 08:44:18,416 INFO L451 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-07-25 08:44:18,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-07-25 08:44:18,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 08:44:18,416 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 116 states. [2018-07-25 08:44:20,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:20,580 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-07-25 08:44:20,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-25 08:44:20,581 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 230 [2018-07-25 08:44:20,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:20,581 INFO L225 Difference]: With dead ends: 235 [2018-07-25 08:44:20,581 INFO L226 Difference]: Without dead ends: 233 [2018-07-25 08:44:20,582 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 08:44:20,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-07-25 08:44:20,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-07-25 08:44:20,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-07-25 08:44:20,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-07-25 08:44:20,670 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 230 [2018-07-25 08:44:20,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:20,671 INFO L472 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-07-25 08:44:20,671 INFO L473 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-07-25 08:44:20,671 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-07-25 08:44:20,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-07-25 08:44:20,671 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:20,671 INFO L354 BasicCegarLoop]: trace histogram [115, 114, 1, 1, 1] [2018-07-25 08:44:20,672 INFO L415 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:20,672 INFO L82 PathProgramCache]: Analyzing trace with hash 785596733, now seen corresponding path program 114 times [2018-07-25 08:44:20,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:22,229 INFO L134 CoverageAnalysis]: Checked inductivity of 13110 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:22,229 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:22,229 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-07-25 08:44:22,230 INFO L451 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-07-25 08:44:22,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-07-25 08:44:22,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 08:44:22,230 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 117 states. [2018-07-25 08:44:24,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:24,487 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-07-25 08:44:24,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-07-25 08:44:24,487 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 232 [2018-07-25 08:44:24,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:24,487 INFO L225 Difference]: With dead ends: 237 [2018-07-25 08:44:24,488 INFO L226 Difference]: Without dead ends: 235 [2018-07-25 08:44:24,488 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 08:44:24,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-07-25 08:44:24,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-07-25 08:44:24,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-07-25 08:44:24,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-07-25 08:44:24,578 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 232 [2018-07-25 08:44:24,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:24,578 INFO L472 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-07-25 08:44:24,578 INFO L473 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-07-25 08:44:24,578 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-07-25 08:44:24,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-07-25 08:44:24,579 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:24,579 INFO L354 BasicCegarLoop]: trace histogram [116, 115, 1, 1, 1] [2018-07-25 08:44:24,579 INFO L415 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:24,579 INFO L82 PathProgramCache]: Analyzing trace with hash -955850695, now seen corresponding path program 115 times [2018-07-25 08:44:24,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:25,900 INFO L134 CoverageAnalysis]: Checked inductivity of 13340 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:25,901 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:25,901 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-07-25 08:44:25,901 INFO L451 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-07-25 08:44:25,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-07-25 08:44:25,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 08:44:25,902 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 118 states. [2018-07-25 08:44:28,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:28,176 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-07-25 08:44:28,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-25 08:44:28,176 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 234 [2018-07-25 08:44:28,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:28,177 INFO L225 Difference]: With dead ends: 239 [2018-07-25 08:44:28,177 INFO L226 Difference]: Without dead ends: 237 [2018-07-25 08:44:28,177 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 08:44:28,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-07-25 08:44:28,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-07-25 08:44:28,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-07-25 08:44:28,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-07-25 08:44:28,268 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 234 [2018-07-25 08:44:28,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:28,268 INFO L472 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-07-25 08:44:28,268 INFO L473 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-07-25 08:44:28,268 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-07-25 08:44:28,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-07-25 08:44:28,269 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:28,269 INFO L354 BasicCegarLoop]: trace histogram [117, 116, 1, 1, 1] [2018-07-25 08:44:28,269 INFO L415 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:28,269 INFO L82 PathProgramCache]: Analyzing trace with hash 550416437, now seen corresponding path program 116 times [2018-07-25 08:44:28,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:29,777 INFO L134 CoverageAnalysis]: Checked inductivity of 13572 backedges. 0 proven. 13572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:29,777 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:29,777 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-07-25 08:44:29,777 INFO L451 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-07-25 08:44:29,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-07-25 08:44:29,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 08:44:29,778 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 119 states. [2018-07-25 08:44:32,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:32,126 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-07-25 08:44:32,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-07-25 08:44:32,127 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 236 [2018-07-25 08:44:32,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:32,127 INFO L225 Difference]: With dead ends: 241 [2018-07-25 08:44:32,127 INFO L226 Difference]: Without dead ends: 239 [2018-07-25 08:44:32,128 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 08:44:32,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-07-25 08:44:32,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-07-25 08:44:32,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-07-25 08:44:32,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-07-25 08:44:32,220 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 236 [2018-07-25 08:44:32,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:32,220 INFO L472 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-07-25 08:44:32,221 INFO L473 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-07-25 08:44:32,221 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-07-25 08:44:32,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-07-25 08:44:32,221 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:32,221 INFO L354 BasicCegarLoop]: trace histogram [118, 117, 1, 1, 1] [2018-07-25 08:44:32,221 INFO L415 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:32,222 INFO L82 PathProgramCache]: Analyzing trace with hash 669151537, now seen corresponding path program 117 times [2018-07-25 08:44:32,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:33,625 INFO L134 CoverageAnalysis]: Checked inductivity of 13806 backedges. 0 proven. 13806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:33,625 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:33,625 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-07-25 08:44:33,626 INFO L451 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-07-25 08:44:33,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-07-25 08:44:33,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 08:44:33,627 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 120 states. [2018-07-25 08:44:35,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:35,898 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-07-25 08:44:35,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-07-25 08:44:35,898 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 238 [2018-07-25 08:44:35,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:35,899 INFO L225 Difference]: With dead ends: 243 [2018-07-25 08:44:35,899 INFO L226 Difference]: Without dead ends: 241 [2018-07-25 08:44:35,899 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 08:44:35,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-07-25 08:44:35,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-07-25 08:44:35,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-07-25 08:44:35,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-07-25 08:44:35,993 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 238 [2018-07-25 08:44:35,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:35,993 INFO L472 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-07-25 08:44:35,993 INFO L473 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-07-25 08:44:35,993 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-07-25 08:44:35,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-07-25 08:44:35,994 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:35,994 INFO L354 BasicCegarLoop]: trace histogram [119, 118, 1, 1, 1] [2018-07-25 08:44:35,994 INFO L415 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:35,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1190534355, now seen corresponding path program 118 times [2018-07-25 08:44:35,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:37,610 INFO L134 CoverageAnalysis]: Checked inductivity of 14042 backedges. 0 proven. 14042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:37,611 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:37,611 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-07-25 08:44:37,611 INFO L451 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-07-25 08:44:37,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-07-25 08:44:37,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 08:44:37,612 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 121 states. [2018-07-25 08:44:39,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:39,936 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-07-25 08:44:39,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-07-25 08:44:39,936 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 240 [2018-07-25 08:44:39,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:39,937 INFO L225 Difference]: With dead ends: 245 [2018-07-25 08:44:39,937 INFO L226 Difference]: Without dead ends: 243 [2018-07-25 08:44:39,938 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 08:44:39,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-07-25 08:44:40,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-07-25 08:44:40,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-07-25 08:44:40,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-07-25 08:44:40,025 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 240 [2018-07-25 08:44:40,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:40,025 INFO L472 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-07-25 08:44:40,025 INFO L473 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-07-25 08:44:40,025 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-07-25 08:44:40,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-07-25 08:44:40,026 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:40,026 INFO L354 BasicCegarLoop]: trace histogram [120, 119, 1, 1, 1] [2018-07-25 08:44:40,026 INFO L415 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:40,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1642281431, now seen corresponding path program 119 times [2018-07-25 08:44:40,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:41,643 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 14280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:41,643 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:41,643 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-07-25 08:44:41,644 INFO L451 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-07-25 08:44:41,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-07-25 08:44:41,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 08:44:41,645 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 122 states. [2018-07-25 08:44:44,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:44,136 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-07-25 08:44:44,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-07-25 08:44:44,136 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 242 [2018-07-25 08:44:44,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:44,137 INFO L225 Difference]: With dead ends: 247 [2018-07-25 08:44:44,137 INFO L226 Difference]: Without dead ends: 245 [2018-07-25 08:44:44,138 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 08:44:44,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-07-25 08:44:44,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-07-25 08:44:44,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-07-25 08:44:44,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-07-25 08:44:44,231 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 242 [2018-07-25 08:44:44,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:44,232 INFO L472 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-07-25 08:44:44,232 INFO L473 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-07-25 08:44:44,232 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-07-25 08:44:44,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-07-25 08:44:44,232 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:44,233 INFO L354 BasicCegarLoop]: trace histogram [121, 120, 1, 1, 1] [2018-07-25 08:44:44,233 INFO L415 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:44,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1979524571, now seen corresponding path program 120 times [2018-07-25 08:44:44,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:45,869 INFO L134 CoverageAnalysis]: Checked inductivity of 14520 backedges. 0 proven. 14520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:45,870 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:45,870 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-07-25 08:44:45,870 INFO L451 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-07-25 08:44:45,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-07-25 08:44:45,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 08:44:45,871 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 123 states. [2018-07-25 08:44:48,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:48,384 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-07-25 08:44:48,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-07-25 08:44:48,385 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 244 [2018-07-25 08:44:48,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:48,385 INFO L225 Difference]: With dead ends: 249 [2018-07-25 08:44:48,385 INFO L226 Difference]: Without dead ends: 247 [2018-07-25 08:44:48,386 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 08:44:48,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-07-25 08:44:48,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-07-25 08:44:48,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-07-25 08:44:48,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-07-25 08:44:48,485 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 244 [2018-07-25 08:44:48,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:48,485 INFO L472 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-07-25 08:44:48,485 INFO L473 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-07-25 08:44:48,485 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-07-25 08:44:48,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-07-25 08:44:48,486 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:48,486 INFO L354 BasicCegarLoop]: trace histogram [122, 121, 1, 1, 1] [2018-07-25 08:44:48,486 INFO L415 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:48,486 INFO L82 PathProgramCache]: Analyzing trace with hash 347332385, now seen corresponding path program 121 times [2018-07-25 08:44:48,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:50,068 INFO L134 CoverageAnalysis]: Checked inductivity of 14762 backedges. 0 proven. 14762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:50,068 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:50,068 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-07-25 08:44:50,068 INFO L451 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-07-25 08:44:50,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-07-25 08:44:50,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 08:44:50,070 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 124 states. [2018-07-25 08:44:52,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:52,365 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-07-25 08:44:52,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-07-25 08:44:52,366 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 246 [2018-07-25 08:44:52,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:52,366 INFO L225 Difference]: With dead ends: 251 [2018-07-25 08:44:52,367 INFO L226 Difference]: Without dead ends: 249 [2018-07-25 08:44:52,367 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 08:44:52,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-07-25 08:44:52,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-07-25 08:44:52,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-07-25 08:44:52,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-07-25 08:44:52,469 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 246 [2018-07-25 08:44:52,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:52,469 INFO L472 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-07-25 08:44:52,469 INFO L473 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-07-25 08:44:52,469 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-07-25 08:44:52,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-07-25 08:44:52,470 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:52,470 INFO L354 BasicCegarLoop]: trace histogram [123, 122, 1, 1, 1] [2018-07-25 08:44:52,470 INFO L415 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:52,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1221094115, now seen corresponding path program 122 times [2018-07-25 08:44:52,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:54,212 INFO L134 CoverageAnalysis]: Checked inductivity of 15006 backedges. 0 proven. 15006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:54,212 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:54,212 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-07-25 08:44:54,212 INFO L451 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-07-25 08:44:54,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-07-25 08:44:54,213 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 08:44:54,213 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 125 states. [2018-07-25 08:44:56,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:44:56,785 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-07-25 08:44:56,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-07-25 08:44:56,785 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 248 [2018-07-25 08:44:56,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:44:56,786 INFO L225 Difference]: With dead ends: 253 [2018-07-25 08:44:56,786 INFO L226 Difference]: Without dead ends: 251 [2018-07-25 08:44:56,787 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 08:44:56,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-07-25 08:44:56,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-07-25 08:44:56,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-07-25 08:44:56,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-07-25 08:44:56,889 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 248 [2018-07-25 08:44:56,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:44:56,889 INFO L472 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-07-25 08:44:56,889 INFO L473 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-07-25 08:44:56,889 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-07-25 08:44:56,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-07-25 08:44:56,890 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:44:56,890 INFO L354 BasicCegarLoop]: trace histogram [124, 123, 1, 1, 1] [2018-07-25 08:44:56,890 INFO L415 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:44:56,891 INFO L82 PathProgramCache]: Analyzing trace with hash -945439719, now seen corresponding path program 123 times [2018-07-25 08:44:56,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:44:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:44:58,655 INFO L134 CoverageAnalysis]: Checked inductivity of 15252 backedges. 0 proven. 15252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:44:58,656 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:44:58,656 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-07-25 08:44:58,656 INFO L451 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-07-25 08:44:58,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-07-25 08:44:58,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 08:44:58,657 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 126 states. [2018-07-25 08:45:00,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:00,925 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-07-25 08:45:00,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-07-25 08:45:00,925 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 250 [2018-07-25 08:45:00,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:00,926 INFO L225 Difference]: With dead ends: 255 [2018-07-25 08:45:00,926 INFO L226 Difference]: Without dead ends: 253 [2018-07-25 08:45:00,927 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 08:45:00,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-07-25 08:45:01,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-07-25 08:45:01,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-07-25 08:45:01,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-07-25 08:45:01,019 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 250 [2018-07-25 08:45:01,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:01,019 INFO L472 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-07-25 08:45:01,019 INFO L473 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-07-25 08:45:01,019 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-07-25 08:45:01,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-07-25 08:45:01,020 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:01,020 INFO L354 BasicCegarLoop]: trace histogram [125, 124, 1, 1, 1] [2018-07-25 08:45:01,021 INFO L415 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:01,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1965429781, now seen corresponding path program 124 times [2018-07-25 08:45:01,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:02,674 INFO L134 CoverageAnalysis]: Checked inductivity of 15500 backedges. 0 proven. 15500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:02,674 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:02,675 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-07-25 08:45:02,675 INFO L451 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-07-25 08:45:02,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-07-25 08:45:02,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 08:45:02,676 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 127 states. [2018-07-25 08:45:05,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:05,168 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-07-25 08:45:05,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-07-25 08:45:05,168 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 252 [2018-07-25 08:45:05,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:05,169 INFO L225 Difference]: With dead ends: 257 [2018-07-25 08:45:05,169 INFO L226 Difference]: Without dead ends: 255 [2018-07-25 08:45:05,169 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 08:45:05,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-07-25 08:45:05,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-07-25 08:45:05,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-07-25 08:45:05,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-07-25 08:45:05,275 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 252 [2018-07-25 08:45:05,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:05,275 INFO L472 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-07-25 08:45:05,275 INFO L473 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-07-25 08:45:05,275 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-07-25 08:45:05,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-07-25 08:45:05,276 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:05,276 INFO L354 BasicCegarLoop]: trace histogram [126, 125, 1, 1, 1] [2018-07-25 08:45:05,276 INFO L415 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:05,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1007657711, now seen corresponding path program 125 times [2018-07-25 08:45:05,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:07,065 INFO L134 CoverageAnalysis]: Checked inductivity of 15750 backedges. 0 proven. 15750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:07,065 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:07,065 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-07-25 08:45:07,065 INFO L451 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-07-25 08:45:07,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-07-25 08:45:07,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 08:45:07,067 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 128 states. [2018-07-25 08:45:09,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:09,619 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-07-25 08:45:09,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-07-25 08:45:09,619 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 254 [2018-07-25 08:45:09,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:09,620 INFO L225 Difference]: With dead ends: 259 [2018-07-25 08:45:09,620 INFO L226 Difference]: Without dead ends: 257 [2018-07-25 08:45:09,621 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 08:45:09,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-07-25 08:45:09,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2018-07-25 08:45:09,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-07-25 08:45:09,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-07-25 08:45:09,729 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 254 [2018-07-25 08:45:09,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:09,729 INFO L472 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-07-25 08:45:09,729 INFO L473 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-07-25 08:45:09,729 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-07-25 08:45:09,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-07-25 08:45:09,730 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:09,730 INFO L354 BasicCegarLoop]: trace histogram [127, 126, 1, 1, 1] [2018-07-25 08:45:09,730 INFO L415 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:09,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1991485683, now seen corresponding path program 126 times [2018-07-25 08:45:09,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:11,578 INFO L134 CoverageAnalysis]: Checked inductivity of 16002 backedges. 0 proven. 16002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:11,578 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:11,578 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-07-25 08:45:11,578 INFO L451 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-07-25 08:45:11,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-07-25 08:45:11,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 08:45:11,580 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 129 states. [2018-07-25 08:45:14,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:14,132 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-07-25 08:45:14,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-07-25 08:45:14,132 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 256 [2018-07-25 08:45:14,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:14,132 INFO L225 Difference]: With dead ends: 261 [2018-07-25 08:45:14,133 INFO L226 Difference]: Without dead ends: 259 [2018-07-25 08:45:14,134 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 08:45:14,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-07-25 08:45:14,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-07-25 08:45:14,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-07-25 08:45:14,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2018-07-25 08:45:14,233 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 256 [2018-07-25 08:45:14,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:14,233 INFO L472 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2018-07-25 08:45:14,233 INFO L473 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-07-25 08:45:14,233 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2018-07-25 08:45:14,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-07-25 08:45:14,234 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:14,234 INFO L354 BasicCegarLoop]: trace histogram [128, 127, 1, 1, 1] [2018-07-25 08:45:14,235 INFO L415 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:14,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1737605641, now seen corresponding path program 127 times [2018-07-25 08:45:14,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:15,993 INFO L134 CoverageAnalysis]: Checked inductivity of 16256 backedges. 0 proven. 16256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:15,993 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:15,994 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-07-25 08:45:15,994 INFO L451 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-07-25 08:45:15,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-07-25 08:45:15,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 08:45:15,996 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 130 states. [2018-07-25 08:45:18,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:18,618 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-07-25 08:45:18,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-07-25 08:45:18,618 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 258 [2018-07-25 08:45:18,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:18,619 INFO L225 Difference]: With dead ends: 263 [2018-07-25 08:45:18,619 INFO L226 Difference]: Without dead ends: 261 [2018-07-25 08:45:18,621 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 08:45:18,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-07-25 08:45:18,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2018-07-25 08:45:18,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-07-25 08:45:18,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-07-25 08:45:18,761 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 258 [2018-07-25 08:45:18,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:18,761 INFO L472 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-07-25 08:45:18,761 INFO L473 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-07-25 08:45:18,761 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-07-25 08:45:18,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-07-25 08:45:18,762 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:18,762 INFO L354 BasicCegarLoop]: trace histogram [129, 128, 1, 1, 1] [2018-07-25 08:45:18,762 INFO L415 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:18,762 INFO L82 PathProgramCache]: Analyzing trace with hash -903324155, now seen corresponding path program 128 times [2018-07-25 08:45:18,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:20,703 INFO L134 CoverageAnalysis]: Checked inductivity of 16512 backedges. 0 proven. 16512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:20,703 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:20,704 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-07-25 08:45:20,704 INFO L451 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-07-25 08:45:20,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-07-25 08:45:20,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 08:45:20,706 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 131 states. [2018-07-25 08:45:23,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:23,629 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-07-25 08:45:23,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-07-25 08:45:23,629 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 260 [2018-07-25 08:45:23,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:23,630 INFO L225 Difference]: With dead ends: 265 [2018-07-25 08:45:23,630 INFO L226 Difference]: Without dead ends: 263 [2018-07-25 08:45:23,631 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 08:45:23,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-07-25 08:45:23,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-07-25 08:45:23,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-07-25 08:45:23,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-07-25 08:45:23,756 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 260 [2018-07-25 08:45:23,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:23,757 INFO L472 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-07-25 08:45:23,757 INFO L473 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-07-25 08:45:23,757 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-07-25 08:45:23,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-07-25 08:45:23,758 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:23,758 INFO L354 BasicCegarLoop]: trace histogram [130, 129, 1, 1, 1] [2018-07-25 08:45:23,758 INFO L415 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:23,758 INFO L82 PathProgramCache]: Analyzing trace with hash -511186175, now seen corresponding path program 129 times [2018-07-25 08:45:23,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:25,731 INFO L134 CoverageAnalysis]: Checked inductivity of 16770 backedges. 0 proven. 16770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:25,732 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:25,732 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-07-25 08:45:25,732 INFO L451 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-07-25 08:45:25,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-07-25 08:45:25,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 08:45:25,733 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 132 states. [2018-07-25 08:45:28,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:28,606 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-07-25 08:45:28,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-07-25 08:45:28,606 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 262 [2018-07-25 08:45:28,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:28,607 INFO L225 Difference]: With dead ends: 267 [2018-07-25 08:45:28,607 INFO L226 Difference]: Without dead ends: 265 [2018-07-25 08:45:28,608 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 08:45:28,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-07-25 08:45:28,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2018-07-25 08:45:28,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-07-25 08:45:28,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-07-25 08:45:28,722 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 262 [2018-07-25 08:45:28,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:28,722 INFO L472 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-07-25 08:45:28,722 INFO L473 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-07-25 08:45:28,722 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-07-25 08:45:28,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-07-25 08:45:28,723 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:28,723 INFO L354 BasicCegarLoop]: trace histogram [131, 130, 1, 1, 1] [2018-07-25 08:45:28,723 INFO L415 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:28,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1623709443, now seen corresponding path program 130 times [2018-07-25 08:45:28,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:30,733 INFO L134 CoverageAnalysis]: Checked inductivity of 17030 backedges. 0 proven. 17030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:30,733 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:30,733 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-07-25 08:45:30,733 INFO L451 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-07-25 08:45:30,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-07-25 08:45:30,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 08:45:30,734 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 133 states. [2018-07-25 08:45:33,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:33,488 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-07-25 08:45:33,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-07-25 08:45:33,488 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 264 [2018-07-25 08:45:33,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:33,489 INFO L225 Difference]: With dead ends: 269 [2018-07-25 08:45:33,489 INFO L226 Difference]: Without dead ends: 267 [2018-07-25 08:45:33,490 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 08:45:33,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-07-25 08:45:33,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-07-25 08:45:33,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-07-25 08:45:33,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-07-25 08:45:33,605 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 264 [2018-07-25 08:45:33,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:33,606 INFO L472 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-07-25 08:45:33,606 INFO L473 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-07-25 08:45:33,606 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-07-25 08:45:33,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-07-25 08:45:33,606 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:33,607 INFO L354 BasicCegarLoop]: trace histogram [132, 131, 1, 1, 1] [2018-07-25 08:45:33,607 INFO L415 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:33,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1311713287, now seen corresponding path program 131 times [2018-07-25 08:45:33,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:35,618 INFO L134 CoverageAnalysis]: Checked inductivity of 17292 backedges. 0 proven. 17292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:35,619 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:35,619 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-07-25 08:45:35,619 INFO L451 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-07-25 08:45:35,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-07-25 08:45:35,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 08:45:35,621 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 134 states. [2018-07-25 08:45:38,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:38,626 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-07-25 08:45:38,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-07-25 08:45:38,626 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 266 [2018-07-25 08:45:38,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:38,627 INFO L225 Difference]: With dead ends: 271 [2018-07-25 08:45:38,627 INFO L226 Difference]: Without dead ends: 269 [2018-07-25 08:45:38,628 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 08:45:38,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-07-25 08:45:38,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-07-25 08:45:38,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-07-25 08:45:38,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-07-25 08:45:38,767 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 266 [2018-07-25 08:45:38,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:38,768 INFO L472 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-07-25 08:45:38,768 INFO L473 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-07-25 08:45:38,768 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-07-25 08:45:38,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-07-25 08:45:38,768 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:38,768 INFO L354 BasicCegarLoop]: trace histogram [133, 132, 1, 1, 1] [2018-07-25 08:45:38,769 INFO L415 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:38,769 INFO L82 PathProgramCache]: Analyzing trace with hash -2131118091, now seen corresponding path program 132 times [2018-07-25 08:45:38,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:40,898 INFO L134 CoverageAnalysis]: Checked inductivity of 17556 backedges. 0 proven. 17556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:40,899 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:40,899 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-07-25 08:45:40,899 INFO L451 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-07-25 08:45:40,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-07-25 08:45:40,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 08:45:40,900 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 135 states. [2018-07-25 08:45:43,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:43,911 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-07-25 08:45:43,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-07-25 08:45:43,911 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 268 [2018-07-25 08:45:43,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:43,912 INFO L225 Difference]: With dead ends: 273 [2018-07-25 08:45:43,912 INFO L226 Difference]: Without dead ends: 271 [2018-07-25 08:45:43,913 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 08:45:43,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-07-25 08:45:44,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-07-25 08:45:44,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-07-25 08:45:44,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-07-25 08:45:44,035 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 268 [2018-07-25 08:45:44,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:44,035 INFO L472 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-07-25 08:45:44,035 INFO L473 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-07-25 08:45:44,035 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-07-25 08:45:44,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-07-25 08:45:44,036 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:44,036 INFO L354 BasicCegarLoop]: trace histogram [134, 133, 1, 1, 1] [2018-07-25 08:45:44,036 INFO L415 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:44,036 INFO L82 PathProgramCache]: Analyzing trace with hash 694847729, now seen corresponding path program 133 times [2018-07-25 08:45:44,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:46,022 INFO L134 CoverageAnalysis]: Checked inductivity of 17822 backedges. 0 proven. 17822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:46,023 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:46,023 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-07-25 08:45:46,023 INFO L451 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-07-25 08:45:46,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-07-25 08:45:46,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 08:45:46,024 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 136 states. [2018-07-25 08:45:48,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:48,921 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-07-25 08:45:48,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-07-25 08:45:48,921 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 270 [2018-07-25 08:45:48,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:48,922 INFO L225 Difference]: With dead ends: 275 [2018-07-25 08:45:48,922 INFO L226 Difference]: Without dead ends: 273 [2018-07-25 08:45:48,923 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 08:45:48,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-07-25 08:45:49,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-07-25 08:45:49,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-07-25 08:45:49,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-07-25 08:45:49,040 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 270 [2018-07-25 08:45:49,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:49,040 INFO L472 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-07-25 08:45:49,040 INFO L473 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-07-25 08:45:49,040 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-07-25 08:45:49,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-07-25 08:45:49,041 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:49,041 INFO L354 BasicCegarLoop]: trace histogram [135, 134, 1, 1, 1] [2018-07-25 08:45:49,041 INFO L415 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:49,041 INFO L82 PathProgramCache]: Analyzing trace with hash 2028669677, now seen corresponding path program 134 times [2018-07-25 08:45:49,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:51,226 INFO L134 CoverageAnalysis]: Checked inductivity of 18090 backedges. 0 proven. 18090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:51,226 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:51,226 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-07-25 08:45:51,226 INFO L451 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-07-25 08:45:51,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-07-25 08:45:51,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 08:45:51,228 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 137 states. [2018-07-25 08:45:54,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:54,149 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2018-07-25 08:45:54,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-07-25 08:45:54,149 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 272 [2018-07-25 08:45:54,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:54,150 INFO L225 Difference]: With dead ends: 277 [2018-07-25 08:45:54,150 INFO L226 Difference]: Without dead ends: 275 [2018-07-25 08:45:54,151 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 08:45:54,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-07-25 08:45:54,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-07-25 08:45:54,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-07-25 08:45:54,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-07-25 08:45:54,301 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 272 [2018-07-25 08:45:54,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:54,302 INFO L472 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-07-25 08:45:54,302 INFO L473 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-07-25 08:45:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-07-25 08:45:54,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-07-25 08:45:54,303 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:54,303 INFO L354 BasicCegarLoop]: trace histogram [136, 135, 1, 1, 1] [2018-07-25 08:45:54,303 INFO L415 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:54,303 INFO L82 PathProgramCache]: Analyzing trace with hash -363659799, now seen corresponding path program 135 times [2018-07-25 08:45:54,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 08:45:56,354 INFO L134 CoverageAnalysis]: Checked inductivity of 18360 backedges. 0 proven. 18360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 08:45:56,355 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 08:45:56,355 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-07-25 08:45:56,355 INFO L451 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-07-25 08:45:56,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-07-25 08:45:56,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 08:45:56,356 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 138 states. [2018-07-25 08:45:59,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 08:45:59,308 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-07-25 08:45:59,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-07-25 08:45:59,308 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 274 [2018-07-25 08:45:59,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 08:45:59,309 INFO L225 Difference]: With dead ends: 279 [2018-07-25 08:45:59,309 INFO L226 Difference]: Without dead ends: 277 [2018-07-25 08:45:59,310 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 08:45:59,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-07-25 08:45:59,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-07-25 08:45:59,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-07-25 08:45:59,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-07-25 08:45:59,433 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 274 [2018-07-25 08:45:59,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 08:45:59,433 INFO L472 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-07-25 08:45:59,434 INFO L473 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-07-25 08:45:59,434 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-07-25 08:45:59,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-07-25 08:45:59,434 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 08:45:59,434 INFO L354 BasicCegarLoop]: trace histogram [137, 136, 1, 1, 1] [2018-07-25 08:45:59,435 INFO L415 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 08:45:59,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1584782875, now seen corresponding path program 136 times [2018-07-25 08:45:59,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 08:45:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-07-25 08:46:00,950 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 08:46:00,977 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 08:46:00,978 INFO L202 PluginConnector]: Adding new model afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 08:46:00 BoogieIcfgContainer [2018-07-25 08:46:00,978 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 08:46:00,979 INFO L168 Benchmark]: Toolchain (without parser) took 257685.33 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.4 GB). Free memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-07-25 08:46:00,981 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:46:00,981 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.04 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:46:00,982 INFO L168 Benchmark]: Boogie Preprocessor took 24.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 08:46:00,982 INFO L168 Benchmark]: RCFGBuilder took 284.85 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 08:46:00,983 INFO L168 Benchmark]: TraceAbstraction took 257329.10 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.4 GB). Free memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-07-25 08:46:00,986 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.04 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 24.39 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 284.85 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 257329.10 ms. Allocated memory was 1.5 GB in the beginning and 2.9 GB in the end (delta: 1.4 GB). Free memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 43). Cancelled while BasicCegarLoop was analyzing trace of length 277 with TraceHistMax 137, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 93 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 257.2s OverallTime, 137 OverallIterations, 137 TraceHistogramMax, 150.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 541 SDtfs, 0 SDslu, 9316 SDs, 0 SdLazy, 1713986 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 101.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9456 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 9320 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 54.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=136, 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: 6.9s AutomataMinimizationTime, 136 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 17.7s SatisfiabilityAnalysisTime, 74.3s InterpolantComputationTime, 18904 NumberOfCodeBlocks, 18904 NumberOfCodeBlocksAsserted, 136 NumberOfCheckSat, 18768 ConstructedInterpolants, 0 QuantifiedInterpolants, 23586080 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 136 InterpolantComputations, 1 PerfectInterpolantSequences, 0/838440 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/afnp2014.c.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_08-46-00-996.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/afnp2014.c.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_08-46-00-996.csv Completed graceful shutdown