java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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/nested1.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:17:36,237 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:17:36,239 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:17:36,256 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:17:36,257 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:17:36,259 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:17:36,260 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:17:36,262 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:17:36,263 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:17:36,264 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:17:36,265 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:17:36,265 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:17:36,266 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:17:36,268 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:17:36,269 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:17:36,271 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:17:36,272 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:17:36,277 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:17:36,284 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:17:36,288 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:17:36,289 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:17:36,291 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:17:36,294 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:17:36,294 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:17:36,295 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:17:36,296 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:17:36,297 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:17:36,297 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:17:36,298 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:17:36,302 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:17:36,302 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:17:36,303 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:17:36,303 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:17:36,303 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:17:36,306 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:17:36,307 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:17:36,308 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:17:36,322 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:17:36,323 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:17:36,324 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:17:36,325 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:17:36,325 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:17:36,325 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:17:36,325 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:17:36,325 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:17:36,370 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:17:36,382 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:17:36,386 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:17:36,388 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:17:36,388 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:17:36,389 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/nested1.i_4.bpl [2018-09-26 08:17:36,389 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/nested1.i_4.bpl' [2018-09-26 08:17:36,444 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:17:36,449 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:17:36,450 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:17:36,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:17:36,450 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:17:36,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:17:36" (1/1) ... [2018-09-26 08:17:36,485 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:17:36" (1/1) ... [2018-09-26 08:17:36,492 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:17:36,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:17:36,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:17:36,493 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:17:36,504 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:17:36" (1/1) ... [2018-09-26 08:17:36,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:17:36" (1/1) ... [2018-09-26 08:17:36,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:17:36" (1/1) ... [2018-09-26 08:17:36,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:17:36" (1/1) ... [2018-09-26 08:17:36,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:17:36" (1/1) ... [2018-09-26 08:17:36,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:17:36" (1/1) ... [2018-09-26 08:17:36,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:17:36" (1/1) ... [2018-09-26 08:17:36,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:17:36,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:17:36,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:17:36,514 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:17:36,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:17:36" (1/1) ... [2018-09-26 08:17:36,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:17:36,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:17:36,770 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:17:36,771 INFO L202 PluginConnector]: Adding new model nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:17:36 BoogieIcfgContainer [2018-09-26 08:17:36,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:17:36,774 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:17:36,774 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:17:36,778 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:17:36,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:17:36" (1/2) ... [2018-09-26 08:17:36,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e6579d and model type nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:17:36, skipping insertion in model container [2018-09-26 08:17:36,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:17:36" (2/2) ... [2018-09-26 08:17:36,782 INFO L112 eAbstractionObserver]: Analyzing ICFG nested1.i_4.bpl [2018-09-26 08:17:36,793 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:17:36,803 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:17:36,855 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:17:36,856 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:17:36,856 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:17:36,857 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:17:36,857 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:17:36,857 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:17:36,857 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:17:36,858 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:17:36,858 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:17:36,875 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-09-26 08:17:36,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:17:36,886 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:36,887 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:17:36,888 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:36,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:36,898 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-09-26 08:17:36,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:36,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:36,987 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:17:36,987 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:17:36,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:17:37,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:17:37,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:17:37,007 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-09-26 08:17:37,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:37,050 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2018-09-26 08:17:37,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:17:37,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-09-26 08:17:37,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:37,070 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:17:37,071 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:17:37,077 INFO L605 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-09-26 08:17:37,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:17:37,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-09-26 08:17:37,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:17:37,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-09-26 08:17:37,118 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 4 [2018-09-26 08:17:37,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:37,119 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-09-26 08:17:37,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:17:37,119 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-09-26 08:17:37,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:17:37,120 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:37,120 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:17:37,121 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:37,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:37,121 INFO L82 PathProgramCache]: Analyzing trace with hash 209100445, now seen corresponding path program 1 times [2018-09-26 08:17:37,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:37,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:37,164 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:17:37,164 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 08:17:37,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:17:37,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:17:37,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:17:37,171 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 3 states. [2018-09-26 08:17:37,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:37,186 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-09-26 08:17:37,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:17:37,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-09-26 08:17:37,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:37,187 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:17:37,187 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:17:37,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-26 08:17:37,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:17:37,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:17:37,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:17:37,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-09-26 08:17:37,193 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-09-26 08:17:37,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:37,194 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-09-26 08:17:37,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:17:37,194 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-09-26 08:17:37,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:17:37,194 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:37,195 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-09-26 08:17:37,195 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:37,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:37,195 INFO L82 PathProgramCache]: Analyzing trace with hash -850198025, now seen corresponding path program 1 times [2018-09-26 08:17:37,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:37,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:37,234 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:37,234 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:17:37,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:17:37,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:17:37,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:17:37,236 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 4 states. [2018-09-26 08:17:37,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:37,257 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-09-26 08:17:37,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:17:37,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-09-26 08:17:37,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:37,259 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:17:37,259 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:17:37,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:17:37,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:17:37,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 08:17:37,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:17:37,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-09-26 08:17:37,265 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-09-26 08:17:37,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:37,266 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-09-26 08:17:37,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:17:37,266 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-09-26 08:17:37,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:17:37,267 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:37,267 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2018-09-26 08:17:37,267 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:37,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:37,268 INFO L82 PathProgramCache]: Analyzing trace with hash -928778543, now seen corresponding path program 2 times [2018-09-26 08:17:37,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:37,347 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-09-26 08:17:37,347 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:37,347 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:17:37,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:17:37,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:17:37,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:17:37,350 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 4 states. [2018-09-26 08:17:37,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:37,413 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-09-26 08:17:37,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:17:37,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-09-26 08:17:37,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:37,416 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:17:37,417 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:17:37,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:17:37,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:17:37,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2018-09-26 08:17:37,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:17:37,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-09-26 08:17:37,428 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 12 [2018-09-26 08:17:37,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:37,430 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-09-26 08:17:37,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:17:37,430 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-09-26 08:17:37,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:17:37,431 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:37,435 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 3, 2, 2, 1, 1, 1] [2018-09-26 08:17:37,436 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:37,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:37,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1881088987, now seen corresponding path program 3 times [2018-09-26 08:17:37,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:37,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:37,529 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-26 08:17:37,529 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:37,529 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:17:37,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:17:37,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:17:37,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:17:37,531 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 5 states. [2018-09-26 08:17:37,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:37,561 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-09-26 08:17:37,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:17:37,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-09-26 08:17:37,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:37,563 INFO L225 Difference]: With dead ends: 37 [2018-09-26 08:17:37,563 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:17:37,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:17:37,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:17:37,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 08:17:37,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:17:37,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-09-26 08:17:37,573 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 20 [2018-09-26 08:17:37,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:37,573 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-09-26 08:17:37,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:17:37,574 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-09-26 08:17:37,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:17:37,575 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:37,575 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 3, 2, 2, 1, 1, 1] [2018-09-26 08:17:37,575 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:37,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:37,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1778757007, now seen corresponding path program 4 times [2018-09-26 08:17:37,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:37,661 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-09-26 08:17:37,662 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:37,662 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:17:37,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:17:37,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:17:37,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:17:37,665 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2018-09-26 08:17:37,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:37,703 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-09-26 08:17:37,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:17:37,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-09-26 08:17:37,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:37,710 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:17:37,711 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:17:37,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:17:37,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:17:37,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2018-09-26 08:17:37,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:17:37,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-09-26 08:17:37,729 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 24 [2018-09-26 08:17:37,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:37,730 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-09-26 08:17:37,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:17:37,730 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-09-26 08:17:37,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:17:37,731 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:37,731 INFO L375 BasicCegarLoop]: trace histogram [12, 9, 4, 3, 3, 1, 1, 1] [2018-09-26 08:17:37,732 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:37,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:37,732 INFO L82 PathProgramCache]: Analyzing trace with hash 501354739, now seen corresponding path program 5 times [2018-09-26 08:17:37,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:37,790 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 70 proven. 12 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-09-26 08:17:37,790 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:37,790 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:17:37,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:17:37,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:17:37,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:17:37,792 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 6 states. [2018-09-26 08:17:37,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:37,844 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-09-26 08:17:37,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:17:37,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-09-26 08:17:37,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:37,846 INFO L225 Difference]: With dead ends: 65 [2018-09-26 08:17:37,846 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 08:17:37,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:17:37,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 08:17:37,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-26 08:17:37,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:17:37,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-09-26 08:17:37,858 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 34 [2018-09-26 08:17:37,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:37,859 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-09-26 08:17:37,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:17:37,859 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-09-26 08:17:37,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:17:37,861 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:37,861 INFO L375 BasicCegarLoop]: trace histogram [15, 12, 4, 3, 3, 1, 1, 1] [2018-09-26 08:17:37,861 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:37,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:37,863 INFO L82 PathProgramCache]: Analyzing trace with hash 209827969, now seen corresponding path program 6 times [2018-09-26 08:17:37,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:37,945 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-09-26 08:17:37,946 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:37,946 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:17:37,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:17:37,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:17:37,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:17:37,948 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 6 states. [2018-09-26 08:17:37,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:37,989 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-09-26 08:17:37,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:17:37,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-09-26 08:17:37,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:37,991 INFO L225 Difference]: With dead ends: 65 [2018-09-26 08:17:37,991 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 08:17:37,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:17:37,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 08:17:38,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2018-09-26 08:17:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 08:17:38,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-09-26 08:17:38,006 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 40 [2018-09-26 08:17:38,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:38,007 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-09-26 08:17:38,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:17:38,007 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-09-26 08:17:38,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:17:38,009 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:38,009 INFO L375 BasicCegarLoop]: trace histogram [20, 16, 5, 4, 4, 1, 1, 1] [2018-09-26 08:17:38,009 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:38,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:38,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1874565441, now seen corresponding path program 7 times [2018-09-26 08:17:38,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:38,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:38,119 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-09-26 08:17:38,120 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:38,120 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:17:38,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:17:38,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:17:38,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:17:38,121 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 7 states. [2018-09-26 08:17:38,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:38,172 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-09-26 08:17:38,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:17:38,173 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-09-26 08:17:38,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:38,175 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:17:38,175 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:17:38,176 INFO L605 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-09-26 08:17:38,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:17:38,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2018-09-26 08:17:38,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:17:38,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-09-26 08:17:38,194 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 52 [2018-09-26 08:17:38,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:38,195 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-09-26 08:17:38,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:17:38,195 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-09-26 08:17:38,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 08:17:38,197 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:38,198 INFO L375 BasicCegarLoop]: trace histogram [25, 20, 6, 5, 5, 1, 1, 1] [2018-09-26 08:17:38,198 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:38,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:38,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1395501053, now seen corresponding path program 8 times [2018-09-26 08:17:38,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:38,319 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 530 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-09-26 08:17:38,320 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:38,320 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:17:38,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:17:38,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:17:38,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:17:38,321 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 8 states. [2018-09-26 08:17:38,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:38,385 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-09-26 08:17:38,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:17:38,386 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2018-09-26 08:17:38,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:38,387 INFO L225 Difference]: With dead ends: 89 [2018-09-26 08:17:38,387 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 08:17:38,388 INFO L605 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-09-26 08:17:38,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 08:17:38,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2018-09-26 08:17:38,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 08:17:38,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-09-26 08:17:38,410 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 64 [2018-09-26 08:17:38,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:38,413 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-09-26 08:17:38,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:17:38,413 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-09-26 08:17:38,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 08:17:38,415 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:38,416 INFO L375 BasicCegarLoop]: trace histogram [30, 24, 7, 6, 6, 1, 1, 1] [2018-09-26 08:17:38,417 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:38,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:38,417 INFO L82 PathProgramCache]: Analyzing trace with hash 150535227, now seen corresponding path program 9 times [2018-09-26 08:17:38,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:38,544 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 792 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-09-26 08:17:38,545 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:38,545 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:17:38,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:17:38,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:17:38,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:17:38,546 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 9 states. [2018-09-26 08:17:38,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:38,617 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-09-26 08:17:38,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:17:38,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2018-09-26 08:17:38,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:38,620 INFO L225 Difference]: With dead ends: 101 [2018-09-26 08:17:38,620 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 08:17:38,624 INFO L605 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-09-26 08:17:38,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 08:17:38,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2018-09-26 08:17:38,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 08:17:38,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-09-26 08:17:38,651 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 76 [2018-09-26 08:17:38,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:38,652 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-09-26 08:17:38,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:17:38,652 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-09-26 08:17:38,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 08:17:38,654 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:38,654 INFO L375 BasicCegarLoop]: trace histogram [35, 28, 8, 7, 7, 1, 1, 1] [2018-09-26 08:17:38,654 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:38,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:38,655 INFO L82 PathProgramCache]: Analyzing trace with hash 673309561, now seen corresponding path program 10 times [2018-09-26 08:17:38,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:38,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 0 proven. 1106 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-09-26 08:17:38,762 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:38,762 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:17:38,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:17:38,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:17:38,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:17:38,765 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 10 states. [2018-09-26 08:17:38,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:38,853 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-09-26 08:17:38,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:17:38,854 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 88 [2018-09-26 08:17:38,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:38,855 INFO L225 Difference]: With dead ends: 113 [2018-09-26 08:17:38,855 INFO L226 Difference]: Without dead ends: 111 [2018-09-26 08:17:38,857 INFO L605 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-09-26 08:17:38,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-26 08:17:38,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 101. [2018-09-26 08:17:38,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 08:17:38,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2018-09-26 08:17:38,897 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 88 [2018-09-26 08:17:38,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:38,897 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2018-09-26 08:17:38,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:17:38,897 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2018-09-26 08:17:38,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 08:17:38,902 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:38,902 INFO L375 BasicCegarLoop]: trace histogram [40, 32, 9, 8, 8, 1, 1, 1] [2018-09-26 08:17:38,902 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:38,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:38,903 INFO L82 PathProgramCache]: Analyzing trace with hash -907813449, now seen corresponding path program 11 times [2018-09-26 08:17:38,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:39,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1632 backedges. 0 proven. 1472 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2018-09-26 08:17:39,058 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:39,059 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:17:39,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:17:39,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:17:39,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:17:39,060 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 11 states. [2018-09-26 08:17:39,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:39,162 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2018-09-26 08:17:39,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:17:39,163 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 100 [2018-09-26 08:17:39,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:39,164 INFO L225 Difference]: With dead ends: 125 [2018-09-26 08:17:39,164 INFO L226 Difference]: Without dead ends: 123 [2018-09-26 08:17:39,165 INFO L605 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-09-26 08:17:39,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-26 08:17:39,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2018-09-26 08:17:39,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-26 08:17:39,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-09-26 08:17:39,201 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 100 [2018-09-26 08:17:39,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:39,206 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-09-26 08:17:39,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:17:39,206 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-09-26 08:17:39,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-26 08:17:39,213 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:39,213 INFO L375 BasicCegarLoop]: trace histogram [45, 36, 10, 9, 9, 1, 1, 1] [2018-09-26 08:17:39,213 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:39,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:39,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1975883019, now seen corresponding path program 12 times [2018-09-26 08:17:39,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:39,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1890 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-09-26 08:17:39,373 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:39,373 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:17:39,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:17:39,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:17:39,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:17:39,375 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 12 states. [2018-09-26 08:17:39,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:39,493 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2018-09-26 08:17:39,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:17:39,493 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 112 [2018-09-26 08:17:39,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:39,495 INFO L225 Difference]: With dead ends: 137 [2018-09-26 08:17:39,495 INFO L226 Difference]: Without dead ends: 135 [2018-09-26 08:17:39,497 INFO L605 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-09-26 08:17:39,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-26 08:17:39,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2018-09-26 08:17:39,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-26 08:17:39,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2018-09-26 08:17:39,545 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 112 [2018-09-26 08:17:39,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:39,546 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2018-09-26 08:17:39,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:17:39,546 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2018-09-26 08:17:39,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-26 08:17:39,548 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:39,548 INFO L375 BasicCegarLoop]: trace histogram [50, 40, 11, 10, 10, 1, 1, 1] [2018-09-26 08:17:39,548 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:39,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:39,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1742801715, now seen corresponding path program 13 times [2018-09-26 08:17:39,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:39,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2560 backedges. 0 proven. 2360 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-09-26 08:17:39,708 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:39,708 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:17:39,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:17:39,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:17:39,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:17:39,710 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand 13 states. [2018-09-26 08:17:39,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:39,832 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2018-09-26 08:17:39,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:17:39,833 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 124 [2018-09-26 08:17:39,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:39,834 INFO L225 Difference]: With dead ends: 149 [2018-09-26 08:17:39,834 INFO L226 Difference]: Without dead ends: 147 [2018-09-26 08:17:39,835 INFO L605 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-09-26 08:17:39,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-26 08:17:39,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 137. [2018-09-26 08:17:39,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-26 08:17:39,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2018-09-26 08:17:39,874 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 124 [2018-09-26 08:17:39,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:39,875 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2018-09-26 08:17:39,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:17:39,875 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2018-09-26 08:17:39,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-26 08:17:39,876 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:39,876 INFO L375 BasicCegarLoop]: trace histogram [55, 44, 12, 11, 11, 1, 1, 1] [2018-09-26 08:17:39,877 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:39,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:39,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1538048399, now seen corresponding path program 14 times [2018-09-26 08:17:39,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:40,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3102 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-09-26 08:17:40,038 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:40,038 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:17:40,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:17:40,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:17:40,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:17:40,039 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand 14 states. [2018-09-26 08:17:40,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:40,187 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2018-09-26 08:17:40,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:17:40,188 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 136 [2018-09-26 08:17:40,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:40,189 INFO L225 Difference]: With dead ends: 161 [2018-09-26 08:17:40,189 INFO L226 Difference]: Without dead ends: 159 [2018-09-26 08:17:40,190 INFO L605 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-09-26 08:17:40,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-09-26 08:17:40,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 149. [2018-09-26 08:17:40,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-26 08:17:40,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2018-09-26 08:17:40,285 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 136 [2018-09-26 08:17:40,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:40,285 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2018-09-26 08:17:40,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:17:40,285 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2018-09-26 08:17:40,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-26 08:17:40,287 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:40,287 INFO L375 BasicCegarLoop]: trace histogram [60, 48, 13, 12, 12, 1, 1, 1] [2018-09-26 08:17:40,289 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:40,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:40,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1546877777, now seen corresponding path program 15 times [2018-09-26 08:17:40,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:40,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3696 backedges. 0 proven. 3456 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-09-26 08:17:40,495 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:40,495 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:17:40,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:17:40,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:17:40,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:17:40,496 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand 15 states. [2018-09-26 08:17:40,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:40,644 INFO L93 Difference]: Finished difference Result 173 states and 187 transitions. [2018-09-26 08:17:40,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:17:40,644 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 148 [2018-09-26 08:17:40,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:40,646 INFO L225 Difference]: With dead ends: 173 [2018-09-26 08:17:40,646 INFO L226 Difference]: Without dead ends: 171 [2018-09-26 08:17:40,646 INFO L605 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-09-26 08:17:40,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-09-26 08:17:40,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 161. [2018-09-26 08:17:40,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-26 08:17:40,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 174 transitions. [2018-09-26 08:17:40,698 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 174 transitions. Word has length 148 [2018-09-26 08:17:40,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:40,699 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 174 transitions. [2018-09-26 08:17:40,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:17:40,699 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 174 transitions. [2018-09-26 08:17:40,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-26 08:17:40,707 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:40,707 INFO L375 BasicCegarLoop]: trace histogram [65, 52, 14, 13, 13, 1, 1, 1] [2018-09-26 08:17:40,707 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:40,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:40,708 INFO L82 PathProgramCache]: Analyzing trace with hash -850895379, now seen corresponding path program 16 times [2018-09-26 08:17:40,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:40,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4342 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-09-26 08:17:40,907 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:40,908 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:17:40,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:17:40,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:17:40,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:17:40,909 INFO L87 Difference]: Start difference. First operand 161 states and 174 transitions. Second operand 16 states. [2018-09-26 08:17:41,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:41,087 INFO L93 Difference]: Finished difference Result 185 states and 200 transitions. [2018-09-26 08:17:41,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:17:41,087 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 160 [2018-09-26 08:17:41,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:41,089 INFO L225 Difference]: With dead ends: 185 [2018-09-26 08:17:41,089 INFO L226 Difference]: Without dead ends: 183 [2018-09-26 08:17:41,090 INFO L605 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-09-26 08:17:41,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-26 08:17:41,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 173. [2018-09-26 08:17:41,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-26 08:17:41,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 187 transitions. [2018-09-26 08:17:41,149 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 187 transitions. Word has length 160 [2018-09-26 08:17:41,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:41,149 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 187 transitions. [2018-09-26 08:17:41,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:17:41,149 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 187 transitions. [2018-09-26 08:17:41,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-26 08:17:41,151 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:41,152 INFO L375 BasicCegarLoop]: trace histogram [70, 56, 15, 14, 14, 1, 1, 1] [2018-09-26 08:17:41,152 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:41,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:41,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1786923563, now seen corresponding path program 17 times [2018-09-26 08:17:41,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:41,386 INFO L134 CoverageAnalysis]: Checked inductivity of 5040 backedges. 0 proven. 4760 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-09-26 08:17:41,386 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:41,386 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:17:41,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:17:41,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:17:41,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:17:41,388 INFO L87 Difference]: Start difference. First operand 173 states and 187 transitions. Second operand 17 states. [2018-09-26 08:17:41,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:41,571 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2018-09-26 08:17:41,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:17:41,572 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 172 [2018-09-26 08:17:41,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:41,574 INFO L225 Difference]: With dead ends: 197 [2018-09-26 08:17:41,574 INFO L226 Difference]: Without dead ends: 195 [2018-09-26 08:17:41,574 INFO L605 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-09-26 08:17:41,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-09-26 08:17:41,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 185. [2018-09-26 08:17:41,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-09-26 08:17:41,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 200 transitions. [2018-09-26 08:17:41,636 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 200 transitions. Word has length 172 [2018-09-26 08:17:41,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:41,637 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 200 transitions. [2018-09-26 08:17:41,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:17:41,638 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 200 transitions. [2018-09-26 08:17:41,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-26 08:17:41,640 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:41,640 INFO L375 BasicCegarLoop]: trace histogram [75, 60, 16, 15, 15, 1, 1, 1] [2018-09-26 08:17:41,640 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:41,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:41,641 INFO L82 PathProgramCache]: Analyzing trace with hash -2013935255, now seen corresponding path program 18 times [2018-09-26 08:17:41,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:41,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5790 backedges. 0 proven. 5490 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-09-26 08:17:41,894 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:41,895 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:17:41,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:17:41,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:17:41,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:17:41,896 INFO L87 Difference]: Start difference. First operand 185 states and 200 transitions. Second operand 18 states. [2018-09-26 08:17:42,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:42,116 INFO L93 Difference]: Finished difference Result 209 states and 226 transitions. [2018-09-26 08:17:42,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:17:42,117 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 184 [2018-09-26 08:17:42,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:42,119 INFO L225 Difference]: With dead ends: 209 [2018-09-26 08:17:42,119 INFO L226 Difference]: Without dead ends: 207 [2018-09-26 08:17:42,120 INFO L605 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-09-26 08:17:42,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-09-26 08:17:42,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 197. [2018-09-26 08:17:42,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-26 08:17:42,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 213 transitions. [2018-09-26 08:17:42,191 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 213 transitions. Word has length 184 [2018-09-26 08:17:42,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:42,192 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 213 transitions. [2018-09-26 08:17:42,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:17:42,192 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 213 transitions. [2018-09-26 08:17:42,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-26 08:17:42,194 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:42,194 INFO L375 BasicCegarLoop]: trace histogram [80, 64, 17, 16, 16, 1, 1, 1] [2018-09-26 08:17:42,195 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:42,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:42,195 INFO L82 PathProgramCache]: Analyzing trace with hash -723625049, now seen corresponding path program 19 times [2018-09-26 08:17:42,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:42,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6592 backedges. 0 proven. 6272 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-09-26 08:17:42,499 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:42,500 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:17:42,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:17:42,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:17:42,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:17:42,501 INFO L87 Difference]: Start difference. First operand 197 states and 213 transitions. Second operand 19 states. [2018-09-26 08:17:42,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:42,747 INFO L93 Difference]: Finished difference Result 221 states and 239 transitions. [2018-09-26 08:17:42,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:17:42,748 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 196 [2018-09-26 08:17:42,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:42,749 INFO L225 Difference]: With dead ends: 221 [2018-09-26 08:17:42,750 INFO L226 Difference]: Without dead ends: 219 [2018-09-26 08:17:42,750 INFO L605 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-09-26 08:17:42,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-09-26 08:17:42,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 209. [2018-09-26 08:17:42,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-09-26 08:17:42,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 226 transitions. [2018-09-26 08:17:42,826 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 226 transitions. Word has length 196 [2018-09-26 08:17:42,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:42,827 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 226 transitions. [2018-09-26 08:17:42,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:17:42,827 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 226 transitions. [2018-09-26 08:17:42,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-26 08:17:42,830 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:42,830 INFO L375 BasicCegarLoop]: trace histogram [85, 68, 18, 17, 17, 1, 1, 1] [2018-09-26 08:17:42,830 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:42,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:42,830 INFO L82 PathProgramCache]: Analyzing trace with hash -2093514523, now seen corresponding path program 20 times [2018-09-26 08:17:42,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:43,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7446 backedges. 0 proven. 7106 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2018-09-26 08:17:43,080 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:43,080 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:17:43,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:17:43,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:17:43,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:17:43,082 INFO L87 Difference]: Start difference. First operand 209 states and 226 transitions. Second operand 20 states. [2018-09-26 08:17:43,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:43,326 INFO L93 Difference]: Finished difference Result 233 states and 252 transitions. [2018-09-26 08:17:43,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:17:43,326 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 208 [2018-09-26 08:17:43,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:43,328 INFO L225 Difference]: With dead ends: 233 [2018-09-26 08:17:43,328 INFO L226 Difference]: Without dead ends: 231 [2018-09-26 08:17:43,329 INFO L605 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-09-26 08:17:43,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-09-26 08:17:43,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 221. [2018-09-26 08:17:43,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-26 08:17:43,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 239 transitions. [2018-09-26 08:17:43,412 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 239 transitions. Word has length 208 [2018-09-26 08:17:43,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:43,413 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 239 transitions. [2018-09-26 08:17:43,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:17:43,413 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 239 transitions. [2018-09-26 08:17:43,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-26 08:17:43,415 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:43,415 INFO L375 BasicCegarLoop]: trace histogram [90, 72, 19, 18, 18, 1, 1, 1] [2018-09-26 08:17:43,416 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:43,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:43,416 INFO L82 PathProgramCache]: Analyzing trace with hash 666679587, now seen corresponding path program 21 times [2018-09-26 08:17:43,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:43,692 INFO L134 CoverageAnalysis]: Checked inductivity of 8352 backedges. 0 proven. 7992 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-09-26 08:17:43,693 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:43,693 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:17:43,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:17:43,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:17:43,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:17:43,694 INFO L87 Difference]: Start difference. First operand 221 states and 239 transitions. Second operand 21 states. [2018-09-26 08:17:43,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:43,956 INFO L93 Difference]: Finished difference Result 245 states and 265 transitions. [2018-09-26 08:17:43,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:17:43,956 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 220 [2018-09-26 08:17:43,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:43,958 INFO L225 Difference]: With dead ends: 245 [2018-09-26 08:17:43,958 INFO L226 Difference]: Without dead ends: 243 [2018-09-26 08:17:43,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:17:43,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-09-26 08:17:44,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 233. [2018-09-26 08:17:44,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-09-26 08:17:44,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 252 transitions. [2018-09-26 08:17:44,048 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 252 transitions. Word has length 220 [2018-09-26 08:17:44,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:44,049 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 252 transitions. [2018-09-26 08:17:44,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:17:44,049 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 252 transitions. [2018-09-26 08:17:44,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-09-26 08:17:44,052 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:44,052 INFO L375 BasicCegarLoop]: trace histogram [95, 76, 20, 19, 19, 1, 1, 1] [2018-09-26 08:17:44,052 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:44,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:44,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1712749471, now seen corresponding path program 22 times [2018-09-26 08:17:44,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:44,346 INFO L134 CoverageAnalysis]: Checked inductivity of 9310 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-09-26 08:17:44,346 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:44,347 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:17:44,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:17:44,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:17:44,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:17:44,351 INFO L87 Difference]: Start difference. First operand 233 states and 252 transitions. Second operand 22 states. [2018-09-26 08:17:44,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:44,619 INFO L93 Difference]: Finished difference Result 257 states and 278 transitions. [2018-09-26 08:17:44,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:17:44,619 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 232 [2018-09-26 08:17:44,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:44,621 INFO L225 Difference]: With dead ends: 257 [2018-09-26 08:17:44,621 INFO L226 Difference]: Without dead ends: 255 [2018-09-26 08:17:44,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:17:44,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-09-26 08:17:44,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 245. [2018-09-26 08:17:44,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-09-26 08:17:44,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 265 transitions. [2018-09-26 08:17:44,727 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 265 transitions. Word has length 232 [2018-09-26 08:17:44,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:44,728 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 265 transitions. [2018-09-26 08:17:44,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:17:44,728 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 265 transitions. [2018-09-26 08:17:44,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-26 08:17:44,731 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:44,732 INFO L375 BasicCegarLoop]: trace histogram [100, 80, 21, 20, 20, 1, 1, 1] [2018-09-26 08:17:44,732 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:44,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:44,732 INFO L82 PathProgramCache]: Analyzing trace with hash -738631009, now seen corresponding path program 23 times [2018-09-26 08:17:44,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:45,105 INFO L134 CoverageAnalysis]: Checked inductivity of 10320 backedges. 0 proven. 9920 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-09-26 08:17:45,106 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:45,106 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:17:45,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:17:45,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:17:45,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:17:45,108 INFO L87 Difference]: Start difference. First operand 245 states and 265 transitions. Second operand 23 states. [2018-09-26 08:17:45,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:45,386 INFO L93 Difference]: Finished difference Result 269 states and 291 transitions. [2018-09-26 08:17:45,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:17:45,387 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 244 [2018-09-26 08:17:45,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:45,389 INFO L225 Difference]: With dead ends: 269 [2018-09-26 08:17:45,389 INFO L226 Difference]: Without dead ends: 267 [2018-09-26 08:17:45,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:17:45,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-09-26 08:17:45,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 257. [2018-09-26 08:17:45,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-09-26 08:17:45,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 278 transitions. [2018-09-26 08:17:45,495 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 278 transitions. Word has length 244 [2018-09-26 08:17:45,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:45,496 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 278 transitions. [2018-09-26 08:17:45,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:17:45,496 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 278 transitions. [2018-09-26 08:17:45,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-26 08:17:45,499 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:45,500 INFO L375 BasicCegarLoop]: trace histogram [105, 84, 22, 21, 21, 1, 1, 1] [2018-09-26 08:17:45,500 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:45,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:45,500 INFO L82 PathProgramCache]: Analyzing trace with hash -756558883, now seen corresponding path program 24 times [2018-09-26 08:17:45,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:45,802 INFO L134 CoverageAnalysis]: Checked inductivity of 11382 backedges. 0 proven. 10962 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-09-26 08:17:45,802 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:45,803 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:17:45,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:17:45,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:17:45,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:17:45,804 INFO L87 Difference]: Start difference. First operand 257 states and 278 transitions. Second operand 24 states. [2018-09-26 08:17:46,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:46,109 INFO L93 Difference]: Finished difference Result 281 states and 304 transitions. [2018-09-26 08:17:46,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:17:46,109 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 256 [2018-09-26 08:17:46,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:46,111 INFO L225 Difference]: With dead ends: 281 [2018-09-26 08:17:46,112 INFO L226 Difference]: Without dead ends: 279 [2018-09-26 08:17:46,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:17:46,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-09-26 08:17:46,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 269. [2018-09-26 08:17:46,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-09-26 08:17:46,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 291 transitions. [2018-09-26 08:17:46,226 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 291 transitions. Word has length 256 [2018-09-26 08:17:46,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:46,227 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 291 transitions. [2018-09-26 08:17:46,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:17:46,227 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 291 transitions. [2018-09-26 08:17:46,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-09-26 08:17:46,230 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:46,230 INFO L375 BasicCegarLoop]: trace histogram [110, 88, 23, 22, 22, 1, 1, 1] [2018-09-26 08:17:46,230 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:46,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:46,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1987074075, now seen corresponding path program 25 times [2018-09-26 08:17:46,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:46,583 INFO L134 CoverageAnalysis]: Checked inductivity of 12496 backedges. 0 proven. 12056 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2018-09-26 08:17:46,584 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:46,584 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:17:46,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:17:46,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:17:46,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:17:46,585 INFO L87 Difference]: Start difference. First operand 269 states and 291 transitions. Second operand 25 states. [2018-09-26 08:17:46,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:46,954 INFO L93 Difference]: Finished difference Result 293 states and 317 transitions. [2018-09-26 08:17:46,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:17:46,955 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 268 [2018-09-26 08:17:46,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:46,957 INFO L225 Difference]: With dead ends: 293 [2018-09-26 08:17:46,957 INFO L226 Difference]: Without dead ends: 291 [2018-09-26 08:17:46,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:17:46,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-09-26 08:17:47,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 281. [2018-09-26 08:17:47,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-09-26 08:17:47,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 304 transitions. [2018-09-26 08:17:47,074 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 304 transitions. Word has length 268 [2018-09-26 08:17:47,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:47,074 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 304 transitions. [2018-09-26 08:17:47,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:17:47,074 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 304 transitions. [2018-09-26 08:17:47,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-09-26 08:17:47,078 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:47,078 INFO L375 BasicCegarLoop]: trace histogram [115, 92, 24, 23, 23, 1, 1, 1] [2018-09-26 08:17:47,079 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:47,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:47,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1628335961, now seen corresponding path program 26 times [2018-09-26 08:17:47,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:47,495 INFO L134 CoverageAnalysis]: Checked inductivity of 13662 backedges. 0 proven. 13202 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2018-09-26 08:17:47,495 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:47,495 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:17:47,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:17:47,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:17:47,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:17:47,497 INFO L87 Difference]: Start difference. First operand 281 states and 304 transitions. Second operand 26 states. [2018-09-26 08:17:47,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:47,911 INFO L93 Difference]: Finished difference Result 305 states and 330 transitions. [2018-09-26 08:17:47,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:17:47,911 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 280 [2018-09-26 08:17:47,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:47,914 INFO L225 Difference]: With dead ends: 305 [2018-09-26 08:17:47,914 INFO L226 Difference]: Without dead ends: 303 [2018-09-26 08:17:47,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:17:47,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-09-26 08:17:48,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 293. [2018-09-26 08:17:48,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-09-26 08:17:48,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 317 transitions. [2018-09-26 08:17:48,049 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 317 transitions. Word has length 280 [2018-09-26 08:17:48,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:48,050 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 317 transitions. [2018-09-26 08:17:48,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:17:48,050 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 317 transitions. [2018-09-26 08:17:48,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-09-26 08:17:48,055 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:48,055 INFO L375 BasicCegarLoop]: trace histogram [120, 96, 25, 24, 24, 1, 1, 1] [2018-09-26 08:17:48,055 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:48,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:48,056 INFO L82 PathProgramCache]: Analyzing trace with hash -671245929, now seen corresponding path program 27 times [2018-09-26 08:17:48,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:48,440 INFO L134 CoverageAnalysis]: Checked inductivity of 14880 backedges. 0 proven. 14400 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2018-09-26 08:17:48,441 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:48,441 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:17:48,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:17:48,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:17:48,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:17:48,443 INFO L87 Difference]: Start difference. First operand 293 states and 317 transitions. Second operand 27 states. [2018-09-26 08:17:48,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:48,820 INFO L93 Difference]: Finished difference Result 317 states and 343 transitions. [2018-09-26 08:17:48,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:17:48,821 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 292 [2018-09-26 08:17:48,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:48,823 INFO L225 Difference]: With dead ends: 317 [2018-09-26 08:17:48,823 INFO L226 Difference]: Without dead ends: 315 [2018-09-26 08:17:48,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:17:48,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-09-26 08:17:48,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 305. [2018-09-26 08:17:48,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-09-26 08:17:48,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 330 transitions. [2018-09-26 08:17:48,964 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 330 transitions. Word has length 292 [2018-09-26 08:17:48,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:48,965 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 330 transitions. [2018-09-26 08:17:48,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:17:48,965 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 330 transitions. [2018-09-26 08:17:48,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-09-26 08:17:48,970 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:48,970 INFO L375 BasicCegarLoop]: trace histogram [125, 100, 26, 25, 25, 1, 1, 1] [2018-09-26 08:17:48,971 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:48,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:48,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1556523307, now seen corresponding path program 28 times [2018-09-26 08:17:48,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:49,340 INFO L134 CoverageAnalysis]: Checked inductivity of 16150 backedges. 0 proven. 15650 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2018-09-26 08:17:49,341 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:49,341 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:17:49,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:17:49,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:17:49,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:17:49,343 INFO L87 Difference]: Start difference. First operand 305 states and 330 transitions. Second operand 28 states. [2018-09-26 08:17:49,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:49,741 INFO L93 Difference]: Finished difference Result 329 states and 356 transitions. [2018-09-26 08:17:49,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:17:49,742 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 304 [2018-09-26 08:17:49,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:49,744 INFO L225 Difference]: With dead ends: 329 [2018-09-26 08:17:49,744 INFO L226 Difference]: Without dead ends: 327 [2018-09-26 08:17:49,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:17:49,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-09-26 08:17:49,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 317. [2018-09-26 08:17:49,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-09-26 08:17:49,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 343 transitions. [2018-09-26 08:17:49,884 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 343 transitions. Word has length 304 [2018-09-26 08:17:49,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:49,885 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 343 transitions. [2018-09-26 08:17:49,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:17:49,885 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 343 transitions. [2018-09-26 08:17:49,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-09-26 08:17:49,890 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:49,890 INFO L375 BasicCegarLoop]: trace histogram [130, 104, 27, 26, 26, 1, 1, 1] [2018-09-26 08:17:49,890 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:49,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:49,891 INFO L82 PathProgramCache]: Analyzing trace with hash -310565101, now seen corresponding path program 29 times [2018-09-26 08:17:49,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:50,341 INFO L134 CoverageAnalysis]: Checked inductivity of 17472 backedges. 0 proven. 16952 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2018-09-26 08:17:50,341 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:50,341 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:17:50,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:17:50,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:17:50,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:17:50,343 INFO L87 Difference]: Start difference. First operand 317 states and 343 transitions. Second operand 29 states. [2018-09-26 08:17:50,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:50,766 INFO L93 Difference]: Finished difference Result 341 states and 369 transitions. [2018-09-26 08:17:50,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:17:50,767 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 316 [2018-09-26 08:17:50,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:50,769 INFO L225 Difference]: With dead ends: 341 [2018-09-26 08:17:50,769 INFO L226 Difference]: Without dead ends: 339 [2018-09-26 08:17:50,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:17:50,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-09-26 08:17:50,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 329. [2018-09-26 08:17:50,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-09-26 08:17:50,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 356 transitions. [2018-09-26 08:17:50,921 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 356 transitions. Word has length 316 [2018-09-26 08:17:50,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:50,922 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 356 transitions. [2018-09-26 08:17:50,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:17:50,922 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 356 transitions. [2018-09-26 08:17:50,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-09-26 08:17:50,926 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:50,926 INFO L375 BasicCegarLoop]: trace histogram [135, 108, 28, 27, 27, 1, 1, 1] [2018-09-26 08:17:50,927 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:50,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:50,927 INFO L82 PathProgramCache]: Analyzing trace with hash 608471633, now seen corresponding path program 30 times [2018-09-26 08:17:50,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:51,330 INFO L134 CoverageAnalysis]: Checked inductivity of 18846 backedges. 0 proven. 18306 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2018-09-26 08:17:51,330 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:51,330 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:17:51,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:17:51,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:17:51,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:17:51,332 INFO L87 Difference]: Start difference. First operand 329 states and 356 transitions. Second operand 30 states. [2018-09-26 08:17:51,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:51,764 INFO L93 Difference]: Finished difference Result 353 states and 382 transitions. [2018-09-26 08:17:51,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:17:51,765 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 328 [2018-09-26 08:17:51,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:51,767 INFO L225 Difference]: With dead ends: 353 [2018-09-26 08:17:51,767 INFO L226 Difference]: Without dead ends: 351 [2018-09-26 08:17:51,768 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:17:51,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-09-26 08:17:51,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 341. [2018-09-26 08:17:51,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-09-26 08:17:51,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 369 transitions. [2018-09-26 08:17:51,919 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 369 transitions. Word has length 328 [2018-09-26 08:17:51,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:51,920 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 369 transitions. [2018-09-26 08:17:51,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:17:51,920 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 369 transitions. [2018-09-26 08:17:51,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-09-26 08:17:51,925 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:51,925 INFO L375 BasicCegarLoop]: trace histogram [140, 112, 29, 28, 28, 1, 1, 1] [2018-09-26 08:17:51,925 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:51,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:51,926 INFO L82 PathProgramCache]: Analyzing trace with hash -674561905, now seen corresponding path program 31 times [2018-09-26 08:17:51,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:52,340 INFO L134 CoverageAnalysis]: Checked inductivity of 20272 backedges. 0 proven. 19712 refuted. 0 times theorem prover too weak. 560 trivial. 0 not checked. [2018-09-26 08:17:52,340 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:52,341 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:17:52,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:17:52,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:17:52,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:17:52,342 INFO L87 Difference]: Start difference. First operand 341 states and 369 transitions. Second operand 31 states. [2018-09-26 08:17:52,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:52,838 INFO L93 Difference]: Finished difference Result 365 states and 395 transitions. [2018-09-26 08:17:52,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:17:52,839 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 340 [2018-09-26 08:17:52,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:52,842 INFO L225 Difference]: With dead ends: 365 [2018-09-26 08:17:52,842 INFO L226 Difference]: Without dead ends: 363 [2018-09-26 08:17:52,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:17:52,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-09-26 08:17:53,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 353. [2018-09-26 08:17:53,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-09-26 08:17:53,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 382 transitions. [2018-09-26 08:17:53,054 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 382 transitions. Word has length 340 [2018-09-26 08:17:53,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:53,054 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 382 transitions. [2018-09-26 08:17:53,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:17:53,055 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 382 transitions. [2018-09-26 08:17:53,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-09-26 08:17:53,060 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:53,061 INFO L375 BasicCegarLoop]: trace histogram [145, 116, 30, 29, 29, 1, 1, 1] [2018-09-26 08:17:53,061 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:53,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:53,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1693709875, now seen corresponding path program 32 times [2018-09-26 08:17:53,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:53,560 INFO L134 CoverageAnalysis]: Checked inductivity of 21750 backedges. 0 proven. 21170 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2018-09-26 08:17:53,560 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:53,561 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:17:53,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:17:53,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:17:53,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:17:53,562 INFO L87 Difference]: Start difference. First operand 353 states and 382 transitions. Second operand 32 states. [2018-09-26 08:17:54,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:54,044 INFO L93 Difference]: Finished difference Result 377 states and 408 transitions. [2018-09-26 08:17:54,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:17:54,044 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 352 [2018-09-26 08:17:54,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:54,049 INFO L225 Difference]: With dead ends: 377 [2018-09-26 08:17:54,049 INFO L226 Difference]: Without dead ends: 375 [2018-09-26 08:17:54,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:17:54,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-09-26 08:17:54,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 365. [2018-09-26 08:17:54,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-09-26 08:17:54,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 395 transitions. [2018-09-26 08:17:54,242 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 395 transitions. Word has length 352 [2018-09-26 08:17:54,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:54,243 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 395 transitions. [2018-09-26 08:17:54,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:17:54,243 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 395 transitions. [2018-09-26 08:17:54,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-09-26 08:17:54,248 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:54,248 INFO L375 BasicCegarLoop]: trace histogram [150, 120, 31, 30, 30, 1, 1, 1] [2018-09-26 08:17:54,249 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:54,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:54,249 INFO L82 PathProgramCache]: Analyzing trace with hash -473750005, now seen corresponding path program 33 times [2018-09-26 08:17:54,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:54,689 INFO L134 CoverageAnalysis]: Checked inductivity of 23280 backedges. 0 proven. 22680 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2018-09-26 08:17:54,689 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:54,690 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:17:54,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:17:54,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:17:54,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:17:54,691 INFO L87 Difference]: Start difference. First operand 365 states and 395 transitions. Second operand 33 states. [2018-09-26 08:17:55,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:55,199 INFO L93 Difference]: Finished difference Result 389 states and 421 transitions. [2018-09-26 08:17:55,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:17:55,200 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 364 [2018-09-26 08:17:55,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:55,202 INFO L225 Difference]: With dead ends: 389 [2018-09-26 08:17:55,202 INFO L226 Difference]: Without dead ends: 387 [2018-09-26 08:17:55,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:17:55,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-09-26 08:17:55,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 377. [2018-09-26 08:17:55,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-09-26 08:17:55,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 408 transitions. [2018-09-26 08:17:55,400 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 408 transitions. Word has length 364 [2018-09-26 08:17:55,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:55,401 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 408 transitions. [2018-09-26 08:17:55,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:17:55,401 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 408 transitions. [2018-09-26 08:17:55,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-09-26 08:17:55,407 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:55,407 INFO L375 BasicCegarLoop]: trace histogram [155, 124, 32, 31, 31, 1, 1, 1] [2018-09-26 08:17:55,407 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:55,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:55,408 INFO L82 PathProgramCache]: Analyzing trace with hash -362031799, now seen corresponding path program 34 times [2018-09-26 08:17:55,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:55,919 INFO L134 CoverageAnalysis]: Checked inductivity of 24862 backedges. 0 proven. 24242 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2018-09-26 08:17:55,919 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:55,920 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:17:55,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:17:55,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:17:55,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:17:55,921 INFO L87 Difference]: Start difference. First operand 377 states and 408 transitions. Second operand 34 states. [2018-09-26 08:17:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:56,403 INFO L93 Difference]: Finished difference Result 401 states and 434 transitions. [2018-09-26 08:17:56,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:17:56,404 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 376 [2018-09-26 08:17:56,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:56,407 INFO L225 Difference]: With dead ends: 401 [2018-09-26 08:17:56,407 INFO L226 Difference]: Without dead ends: 399 [2018-09-26 08:17:56,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:17:56,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-09-26 08:17:56,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 389. [2018-09-26 08:17:56,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-09-26 08:17:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 421 transitions. [2018-09-26 08:17:56,609 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 421 transitions. Word has length 376 [2018-09-26 08:17:56,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:56,610 INFO L480 AbstractCegarLoop]: Abstraction has 389 states and 421 transitions. [2018-09-26 08:17:56,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:17:56,610 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 421 transitions. [2018-09-26 08:17:56,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-09-26 08:17:56,617 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:56,617 INFO L375 BasicCegarLoop]: trace histogram [160, 128, 33, 32, 32, 1, 1, 1] [2018-09-26 08:17:56,617 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:56,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:56,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1975412857, now seen corresponding path program 35 times [2018-09-26 08:17:56,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:57,078 INFO L134 CoverageAnalysis]: Checked inductivity of 26496 backedges. 0 proven. 25856 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2018-09-26 08:17:57,078 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:57,078 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:17:57,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:17:57,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:17:57,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:17:57,080 INFO L87 Difference]: Start difference. First operand 389 states and 421 transitions. Second operand 35 states. [2018-09-26 08:17:57,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:57,596 INFO L93 Difference]: Finished difference Result 413 states and 447 transitions. [2018-09-26 08:17:57,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:17:57,597 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 388 [2018-09-26 08:17:57,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:57,599 INFO L225 Difference]: With dead ends: 413 [2018-09-26 08:17:57,600 INFO L226 Difference]: Without dead ends: 411 [2018-09-26 08:17:57,600 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:17:57,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-09-26 08:17:57,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 401. [2018-09-26 08:17:57,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-09-26 08:17:57,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 434 transitions. [2018-09-26 08:17:57,808 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 434 transitions. Word has length 388 [2018-09-26 08:17:57,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:57,809 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 434 transitions. [2018-09-26 08:17:57,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:17:57,809 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 434 transitions. [2018-09-26 08:17:57,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-09-26 08:17:57,813 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:57,813 INFO L375 BasicCegarLoop]: trace histogram [165, 132, 34, 33, 33, 1, 1, 1] [2018-09-26 08:17:57,813 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:57,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:57,814 INFO L82 PathProgramCache]: Analyzing trace with hash 557837509, now seen corresponding path program 36 times [2018-09-26 08:17:57,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:58,398 INFO L134 CoverageAnalysis]: Checked inductivity of 28182 backedges. 0 proven. 27522 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-09-26 08:17:58,398 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:58,398 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:17:58,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:17:58,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:17:58,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:17:58,400 INFO L87 Difference]: Start difference. First operand 401 states and 434 transitions. Second operand 36 states. [2018-09-26 08:17:59,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:59,025 INFO L93 Difference]: Finished difference Result 425 states and 460 transitions. [2018-09-26 08:17:59,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:17:59,026 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 400 [2018-09-26 08:17:59,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:59,028 INFO L225 Difference]: With dead ends: 425 [2018-09-26 08:17:59,029 INFO L226 Difference]: Without dead ends: 423 [2018-09-26 08:17:59,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:17:59,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-09-26 08:17:59,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 413. [2018-09-26 08:17:59,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-09-26 08:17:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 447 transitions. [2018-09-26 08:17:59,256 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 447 transitions. Word has length 400 [2018-09-26 08:17:59,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:59,256 INFO L480 AbstractCegarLoop]: Abstraction has 413 states and 447 transitions. [2018-09-26 08:17:59,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:17:59,256 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 447 transitions. [2018-09-26 08:17:59,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-09-26 08:17:59,259 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:59,259 INFO L375 BasicCegarLoop]: trace histogram [170, 136, 35, 34, 34, 1, 1, 1] [2018-09-26 08:17:59,259 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:59,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:59,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1881298179, now seen corresponding path program 37 times [2018-09-26 08:17:59,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:59,789 INFO L134 CoverageAnalysis]: Checked inductivity of 29920 backedges. 0 proven. 29240 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2018-09-26 08:17:59,790 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:59,790 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:17:59,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:17:59,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:17:59,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:17:59,792 INFO L87 Difference]: Start difference. First operand 413 states and 447 transitions. Second operand 37 states. [2018-09-26 08:18:00,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:00,382 INFO L93 Difference]: Finished difference Result 437 states and 473 transitions. [2018-09-26 08:18:00,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:18:00,382 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 412 [2018-09-26 08:18:00,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:00,385 INFO L225 Difference]: With dead ends: 437 [2018-09-26 08:18:00,385 INFO L226 Difference]: Without dead ends: 435 [2018-09-26 08:18:00,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:18:00,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-09-26 08:18:00,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 425. [2018-09-26 08:18:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-09-26 08:18:00,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 460 transitions. [2018-09-26 08:18:00,608 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 460 transitions. Word has length 412 [2018-09-26 08:18:00,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:00,609 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 460 transitions. [2018-09-26 08:18:00,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:18:00,609 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 460 transitions. [2018-09-26 08:18:00,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-09-26 08:18:00,612 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:00,612 INFO L375 BasicCegarLoop]: trace histogram [175, 140, 36, 35, 35, 1, 1, 1] [2018-09-26 08:18:00,612 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:00,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:00,613 INFO L82 PathProgramCache]: Analyzing trace with hash 2053394497, now seen corresponding path program 38 times [2018-09-26 08:18:00,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:01,056 INFO L134 CoverageAnalysis]: Checked inductivity of 31710 backedges. 0 proven. 31010 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2018-09-26 08:18:01,056 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:01,057 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:18:01,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:18:01,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:18:01,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:18:01,058 INFO L87 Difference]: Start difference. First operand 425 states and 460 transitions. Second operand 38 states. [2018-09-26 08:18:01,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:01,615 INFO L93 Difference]: Finished difference Result 449 states and 486 transitions. [2018-09-26 08:18:01,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:18:01,615 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 424 [2018-09-26 08:18:01,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:01,618 INFO L225 Difference]: With dead ends: 449 [2018-09-26 08:18:01,618 INFO L226 Difference]: Without dead ends: 447 [2018-09-26 08:18:01,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:18:01,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-09-26 08:18:01,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 437. [2018-09-26 08:18:01,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-09-26 08:18:01,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 473 transitions. [2018-09-26 08:18:01,863 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 473 transitions. Word has length 424 [2018-09-26 08:18:01,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:01,863 INFO L480 AbstractCegarLoop]: Abstraction has 437 states and 473 transitions. [2018-09-26 08:18:01,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:18:01,864 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 473 transitions. [2018-09-26 08:18:01,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-09-26 08:18:01,866 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:01,867 INFO L375 BasicCegarLoop]: trace histogram [180, 144, 37, 36, 36, 1, 1, 1] [2018-09-26 08:18:01,867 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:01,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:01,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1715560063, now seen corresponding path program 39 times [2018-09-26 08:18:01,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:02,343 INFO L134 CoverageAnalysis]: Checked inductivity of 33552 backedges. 0 proven. 32832 refuted. 0 times theorem prover too weak. 720 trivial. 0 not checked. [2018-09-26 08:18:02,343 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:02,343 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:18:02,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:18:02,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:18:02,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:18:02,345 INFO L87 Difference]: Start difference. First operand 437 states and 473 transitions. Second operand 39 states. [2018-09-26 08:18:02,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:02,948 INFO L93 Difference]: Finished difference Result 461 states and 499 transitions. [2018-09-26 08:18:02,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:18:02,948 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 436 [2018-09-26 08:18:02,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:02,951 INFO L225 Difference]: With dead ends: 461 [2018-09-26 08:18:02,951 INFO L226 Difference]: Without dead ends: 459 [2018-09-26 08:18:02,952 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:18:02,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-09-26 08:18:03,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 449. [2018-09-26 08:18:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-09-26 08:18:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 486 transitions. [2018-09-26 08:18:03,193 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 486 transitions. Word has length 436 [2018-09-26 08:18:03,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:03,194 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 486 transitions. [2018-09-26 08:18:03,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:18:03,194 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 486 transitions. [2018-09-26 08:18:03,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2018-09-26 08:18:03,197 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:03,197 INFO L375 BasicCegarLoop]: trace histogram [185, 148, 38, 37, 37, 1, 1, 1] [2018-09-26 08:18:03,198 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:03,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:03,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1555365821, now seen corresponding path program 40 times [2018-09-26 08:18:03,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:03,716 INFO L134 CoverageAnalysis]: Checked inductivity of 35446 backedges. 0 proven. 34706 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2018-09-26 08:18:03,716 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:03,717 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:18:03,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:18:03,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:18:03,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:18:03,718 INFO L87 Difference]: Start difference. First operand 449 states and 486 transitions. Second operand 40 states. [2018-09-26 08:18:04,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:04,357 INFO L93 Difference]: Finished difference Result 473 states and 512 transitions. [2018-09-26 08:18:04,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:18:04,357 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 448 [2018-09-26 08:18:04,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:04,360 INFO L225 Difference]: With dead ends: 473 [2018-09-26 08:18:04,360 INFO L226 Difference]: Without dead ends: 471 [2018-09-26 08:18:04,361 INFO L605 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-09-26 08:18:04,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-09-26 08:18:04,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 461. [2018-09-26 08:18:04,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2018-09-26 08:18:04,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 499 transitions. [2018-09-26 08:18:04,662 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 499 transitions. Word has length 448 [2018-09-26 08:18:04,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:04,663 INFO L480 AbstractCegarLoop]: Abstraction has 461 states and 499 transitions. [2018-09-26 08:18:04,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:18:04,663 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 499 transitions. [2018-09-26 08:18:04,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2018-09-26 08:18:04,667 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:04,667 INFO L375 BasicCegarLoop]: trace histogram [190, 152, 39, 38, 38, 1, 1, 1] [2018-09-26 08:18:04,668 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:04,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:04,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1769649147, now seen corresponding path program 41 times [2018-09-26 08:18:04,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:05,396 INFO L134 CoverageAnalysis]: Checked inductivity of 37392 backedges. 0 proven. 36632 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-09-26 08:18:05,396 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:05,397 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:18:05,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:18:05,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:18:05,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:18:05,398 INFO L87 Difference]: Start difference. First operand 461 states and 499 transitions. Second operand 41 states. [2018-09-26 08:18:05,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:05,923 INFO L93 Difference]: Finished difference Result 485 states and 525 transitions. [2018-09-26 08:18:05,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:18:05,923 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 460 [2018-09-26 08:18:05,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:05,926 INFO L225 Difference]: With dead ends: 485 [2018-09-26 08:18:05,926 INFO L226 Difference]: Without dead ends: 483 [2018-09-26 08:18:05,927 INFO L605 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-09-26 08:18:05,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-09-26 08:18:06,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 473. [2018-09-26 08:18:06,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-09-26 08:18:06,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 512 transitions. [2018-09-26 08:18:06,181 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 512 transitions. Word has length 460 [2018-09-26 08:18:06,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:06,182 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 512 transitions. [2018-09-26 08:18:06,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:18:06,182 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 512 transitions. [2018-09-26 08:18:06,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-09-26 08:18:06,184 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:06,184 INFO L375 BasicCegarLoop]: trace histogram [195, 156, 40, 39, 39, 1, 1, 1] [2018-09-26 08:18:06,185 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:06,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:06,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1527642937, now seen corresponding path program 42 times [2018-09-26 08:18:06,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:06,704 INFO L134 CoverageAnalysis]: Checked inductivity of 39390 backedges. 0 proven. 38610 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-09-26 08:18:06,705 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:06,705 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:18:06,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:18:06,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:18:06,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:18:06,707 INFO L87 Difference]: Start difference. First operand 473 states and 512 transitions. Second operand 42 states. [2018-09-26 08:18:07,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:07,192 INFO L93 Difference]: Finished difference Result 497 states and 538 transitions. [2018-09-26 08:18:07,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:18:07,192 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 472 [2018-09-26 08:18:07,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:07,195 INFO L225 Difference]: With dead ends: 497 [2018-09-26 08:18:07,195 INFO L226 Difference]: Without dead ends: 495 [2018-09-26 08:18:07,196 INFO L605 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-09-26 08:18:07,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-09-26 08:18:07,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 485. [2018-09-26 08:18:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-09-26 08:18:07,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 525 transitions. [2018-09-26 08:18:07,427 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 525 transitions. Word has length 472 [2018-09-26 08:18:07,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:07,427 INFO L480 AbstractCegarLoop]: Abstraction has 485 states and 525 transitions. [2018-09-26 08:18:07,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:18:07,427 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 525 transitions. [2018-09-26 08:18:07,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2018-09-26 08:18:07,430 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:07,430 INFO L375 BasicCegarLoop]: trace histogram [200, 160, 41, 40, 40, 1, 1, 1] [2018-09-26 08:18:07,431 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:07,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:07,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1565895305, now seen corresponding path program 43 times [2018-09-26 08:18:07,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 41440 backedges. 0 proven. 40640 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-09-26 08:18:07,990 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:07,990 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:18:07,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:18:07,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:18:07,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:18:07,992 INFO L87 Difference]: Start difference. First operand 485 states and 525 transitions. Second operand 43 states. [2018-09-26 08:18:08,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:08,438 INFO L93 Difference]: Finished difference Result 509 states and 551 transitions. [2018-09-26 08:18:08,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:18:08,438 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 484 [2018-09-26 08:18:08,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:08,440 INFO L225 Difference]: With dead ends: 509 [2018-09-26 08:18:08,440 INFO L226 Difference]: Without dead ends: 507 [2018-09-26 08:18:08,441 INFO L605 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-09-26 08:18:08,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-09-26 08:18:08,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 497. [2018-09-26 08:18:08,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-09-26 08:18:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 538 transitions. [2018-09-26 08:18:08,744 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 538 transitions. Word has length 484 [2018-09-26 08:18:08,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:08,745 INFO L480 AbstractCegarLoop]: Abstraction has 497 states and 538 transitions. [2018-09-26 08:18:08,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:18:08,745 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 538 transitions. [2018-09-26 08:18:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2018-09-26 08:18:08,748 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:08,748 INFO L375 BasicCegarLoop]: trace histogram [205, 164, 42, 41, 41, 1, 1, 1] [2018-09-26 08:18:08,748 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:08,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:08,749 INFO L82 PathProgramCache]: Analyzing trace with hash 877347509, now seen corresponding path program 44 times [2018-09-26 08:18:08,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:09,353 INFO L134 CoverageAnalysis]: Checked inductivity of 43542 backedges. 0 proven. 42722 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-09-26 08:18:09,354 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:09,354 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:18:09,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:18:09,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:18:09,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:18:09,355 INFO L87 Difference]: Start difference. First operand 497 states and 538 transitions. Second operand 44 states. [2018-09-26 08:18:09,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:09,835 INFO L93 Difference]: Finished difference Result 521 states and 564 transitions. [2018-09-26 08:18:09,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:18:09,835 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 496 [2018-09-26 08:18:09,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:09,838 INFO L225 Difference]: With dead ends: 521 [2018-09-26 08:18:09,838 INFO L226 Difference]: Without dead ends: 519 [2018-09-26 08:18:09,839 INFO L605 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-09-26 08:18:09,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-09-26 08:18:10,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 509. [2018-09-26 08:18:10,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2018-09-26 08:18:10,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 551 transitions. [2018-09-26 08:18:10,081 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 551 transitions. Word has length 496 [2018-09-26 08:18:10,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:10,081 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 551 transitions. [2018-09-26 08:18:10,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:18:10,082 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 551 transitions. [2018-09-26 08:18:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2018-09-26 08:18:10,086 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:10,086 INFO L375 BasicCegarLoop]: trace histogram [210, 168, 43, 42, 42, 1, 1, 1] [2018-09-26 08:18:10,086 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:10,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:10,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1722565363, now seen corresponding path program 45 times [2018-09-26 08:18:10,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:10,752 INFO L134 CoverageAnalysis]: Checked inductivity of 45696 backedges. 0 proven. 44856 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2018-09-26 08:18:10,752 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:10,752 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:18:10,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:18:10,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:18:10,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:18:10,754 INFO L87 Difference]: Start difference. First operand 509 states and 551 transitions. Second operand 45 states. [2018-09-26 08:18:11,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:11,284 INFO L93 Difference]: Finished difference Result 533 states and 577 transitions. [2018-09-26 08:18:11,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:18:11,284 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 508 [2018-09-26 08:18:11,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:11,288 INFO L225 Difference]: With dead ends: 533 [2018-09-26 08:18:11,288 INFO L226 Difference]: Without dead ends: 531 [2018-09-26 08:18:11,289 INFO L605 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-09-26 08:18:11,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-09-26 08:18:11,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 521. [2018-09-26 08:18:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-09-26 08:18:11,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 564 transitions. [2018-09-26 08:18:11,547 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 564 transitions. Word has length 508 [2018-09-26 08:18:11,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:11,548 INFO L480 AbstractCegarLoop]: Abstraction has 521 states and 564 transitions. [2018-09-26 08:18:11,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:18:11,548 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 564 transitions. [2018-09-26 08:18:11,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2018-09-26 08:18:11,551 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:11,551 INFO L375 BasicCegarLoop]: trace histogram [215, 172, 44, 43, 43, 1, 1, 1] [2018-09-26 08:18:11,551 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:11,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:11,552 INFO L82 PathProgramCache]: Analyzing trace with hash -750201295, now seen corresponding path program 46 times [2018-09-26 08:18:11,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:12,084 INFO L134 CoverageAnalysis]: Checked inductivity of 47902 backedges. 0 proven. 47042 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2018-09-26 08:18:12,085 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:12,085 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:18:12,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:18:12,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:18:12,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:18:12,087 INFO L87 Difference]: Start difference. First operand 521 states and 564 transitions. Second operand 46 states. [2018-09-26 08:18:12,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:12,610 INFO L93 Difference]: Finished difference Result 545 states and 590 transitions. [2018-09-26 08:18:12,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:18:12,610 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 520 [2018-09-26 08:18:12,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:12,613 INFO L225 Difference]: With dead ends: 545 [2018-09-26 08:18:12,613 INFO L226 Difference]: Without dead ends: 543 [2018-09-26 08:18:12,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:18:12,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-09-26 08:18:12,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 533. [2018-09-26 08:18:12,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-09-26 08:18:12,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 577 transitions. [2018-09-26 08:18:12,927 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 577 transitions. Word has length 520 [2018-09-26 08:18:12,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:12,928 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 577 transitions. [2018-09-26 08:18:12,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:18:12,928 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 577 transitions. [2018-09-26 08:18:12,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2018-09-26 08:18:12,931 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:12,931 INFO L375 BasicCegarLoop]: trace histogram [220, 176, 45, 44, 44, 1, 1, 1] [2018-09-26 08:18:12,931 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:12,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:12,931 INFO L82 PathProgramCache]: Analyzing trace with hash 912030831, now seen corresponding path program 47 times [2018-09-26 08:18:12,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:13,519 INFO L134 CoverageAnalysis]: Checked inductivity of 50160 backedges. 0 proven. 49280 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2018-09-26 08:18:13,520 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:13,520 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:18:13,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:18:13,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:18:13,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:18:13,521 INFO L87 Difference]: Start difference. First operand 533 states and 577 transitions. Second operand 47 states. [2018-09-26 08:18:14,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:14,065 INFO L93 Difference]: Finished difference Result 557 states and 603 transitions. [2018-09-26 08:18:14,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:18:14,065 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 532 [2018-09-26 08:18:14,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:14,068 INFO L225 Difference]: With dead ends: 557 [2018-09-26 08:18:14,068 INFO L226 Difference]: Without dead ends: 555 [2018-09-26 08:18:14,069 INFO L605 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-09-26 08:18:14,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-09-26 08:18:14,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 545. [2018-09-26 08:18:14,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2018-09-26 08:18:14,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 590 transitions. [2018-09-26 08:18:14,353 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 590 transitions. Word has length 532 [2018-09-26 08:18:14,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:14,353 INFO L480 AbstractCegarLoop]: Abstraction has 545 states and 590 transitions. [2018-09-26 08:18:14,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:18:14,354 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 590 transitions. [2018-09-26 08:18:14,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2018-09-26 08:18:14,357 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:14,357 INFO L375 BasicCegarLoop]: trace histogram [225, 180, 46, 45, 45, 1, 1, 1] [2018-09-26 08:18:14,358 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:14,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:14,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1323480493, now seen corresponding path program 48 times [2018-09-26 08:18:14,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:15,056 INFO L134 CoverageAnalysis]: Checked inductivity of 52470 backedges. 0 proven. 51570 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2018-09-26 08:18:15,056 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:15,056 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:18:15,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:18:15,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:18:15,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:18:15,058 INFO L87 Difference]: Start difference. First operand 545 states and 590 transitions. Second operand 48 states. [2018-09-26 08:18:15,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:15,694 INFO L93 Difference]: Finished difference Result 569 states and 616 transitions. [2018-09-26 08:18:15,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:18:15,694 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 544 [2018-09-26 08:18:15,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:15,697 INFO L225 Difference]: With dead ends: 569 [2018-09-26 08:18:15,697 INFO L226 Difference]: Without dead ends: 567 [2018-09-26 08:18:15,698 INFO L605 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-09-26 08:18:15,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-09-26 08:18:16,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 557. [2018-09-26 08:18:16,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-09-26 08:18:16,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 603 transitions. [2018-09-26 08:18:16,009 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 603 transitions. Word has length 544 [2018-09-26 08:18:16,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:16,010 INFO L480 AbstractCegarLoop]: Abstraction has 557 states and 603 transitions. [2018-09-26 08:18:16,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:18:16,010 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 603 transitions. [2018-09-26 08:18:16,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2018-09-26 08:18:16,014 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:16,014 INFO L375 BasicCegarLoop]: trace histogram [230, 184, 47, 46, 46, 1, 1, 1] [2018-09-26 08:18:16,014 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:16,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:16,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1097399829, now seen corresponding path program 49 times [2018-09-26 08:18:16,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:16,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:16,667 INFO L134 CoverageAnalysis]: Checked inductivity of 54832 backedges. 0 proven. 53912 refuted. 0 times theorem prover too weak. 920 trivial. 0 not checked. [2018-09-26 08:18:16,667 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:16,667 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:18:16,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:18:16,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:18:16,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:18:16,669 INFO L87 Difference]: Start difference. First operand 557 states and 603 transitions. Second operand 49 states. [2018-09-26 08:18:17,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:17,257 INFO L93 Difference]: Finished difference Result 581 states and 629 transitions. [2018-09-26 08:18:17,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:18:17,257 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 556 [2018-09-26 08:18:17,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:17,260 INFO L225 Difference]: With dead ends: 581 [2018-09-26 08:18:17,260 INFO L226 Difference]: Without dead ends: 579 [2018-09-26 08:18:17,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:18:17,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-09-26 08:18:17,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 569. [2018-09-26 08:18:17,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2018-09-26 08:18:17,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 616 transitions. [2018-09-26 08:18:17,531 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 616 transitions. Word has length 556 [2018-09-26 08:18:17,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:17,531 INFO L480 AbstractCegarLoop]: Abstraction has 569 states and 616 transitions. [2018-09-26 08:18:17,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:18:17,532 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 616 transitions. [2018-09-26 08:18:17,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2018-09-26 08:18:17,535 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:17,536 INFO L375 BasicCegarLoop]: trace histogram [235, 188, 48, 47, 47, 1, 1, 1] [2018-09-26 08:18:17,536 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:17,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:17,536 INFO L82 PathProgramCache]: Analyzing trace with hash -369827543, now seen corresponding path program 50 times [2018-09-26 08:18:17,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:18,159 INFO L134 CoverageAnalysis]: Checked inductivity of 57246 backedges. 0 proven. 56306 refuted. 0 times theorem prover too weak. 940 trivial. 0 not checked. [2018-09-26 08:18:18,160 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:18,160 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:18:18,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:18:18,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:18:18,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:18:18,161 INFO L87 Difference]: Start difference. First operand 569 states and 616 transitions. Second operand 50 states. [2018-09-26 08:18:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:18,732 INFO L93 Difference]: Finished difference Result 593 states and 642 transitions. [2018-09-26 08:18:18,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:18:18,733 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 568 [2018-09-26 08:18:18,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:18,736 INFO L225 Difference]: With dead ends: 593 [2018-09-26 08:18:18,736 INFO L226 Difference]: Without dead ends: 591 [2018-09-26 08:18:18,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:18:18,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2018-09-26 08:18:19,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 581. [2018-09-26 08:18:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 581 states. [2018-09-26 08:18:19,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 629 transitions. [2018-09-26 08:18:19,006 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 629 transitions. Word has length 568 [2018-09-26 08:18:19,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:19,006 INFO L480 AbstractCegarLoop]: Abstraction has 581 states and 629 transitions. [2018-09-26 08:18:19,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:18:19,006 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 629 transitions. [2018-09-26 08:18:19,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2018-09-26 08:18:19,010 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:19,011 INFO L375 BasicCegarLoop]: trace histogram [240, 192, 49, 48, 48, 1, 1, 1] [2018-09-26 08:18:19,011 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:19,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:19,011 INFO L82 PathProgramCache]: Analyzing trace with hash -667430041, now seen corresponding path program 51 times [2018-09-26 08:18:19,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:19,686 INFO L134 CoverageAnalysis]: Checked inductivity of 59712 backedges. 0 proven. 58752 refuted. 0 times theorem prover too weak. 960 trivial. 0 not checked. [2018-09-26 08:18:19,687 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:19,687 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:18:19,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:18:19,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:18:19,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:18:19,688 INFO L87 Difference]: Start difference. First operand 581 states and 629 transitions. Second operand 51 states. [2018-09-26 08:18:20,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:20,395 INFO L93 Difference]: Finished difference Result 605 states and 655 transitions. [2018-09-26 08:18:20,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:18:20,395 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 580 [2018-09-26 08:18:20,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:20,398 INFO L225 Difference]: With dead ends: 605 [2018-09-26 08:18:20,398 INFO L226 Difference]: Without dead ends: 603 [2018-09-26 08:18:20,398 INFO L605 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-09-26 08:18:20,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-09-26 08:18:20,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 593. [2018-09-26 08:18:20,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-09-26 08:18:20,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 642 transitions. [2018-09-26 08:18:20,703 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 642 transitions. Word has length 580 [2018-09-26 08:18:20,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:20,703 INFO L480 AbstractCegarLoop]: Abstraction has 593 states and 642 transitions. [2018-09-26 08:18:20,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:18:20,703 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 642 transitions. [2018-09-26 08:18:20,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2018-09-26 08:18:20,706 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:20,706 INFO L375 BasicCegarLoop]: trace histogram [245, 196, 50, 49, 49, 1, 1, 1] [2018-09-26 08:18:20,707 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:20,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:20,707 INFO L82 PathProgramCache]: Analyzing trace with hash 324753573, now seen corresponding path program 52 times [2018-09-26 08:18:20,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:21,433 INFO L134 CoverageAnalysis]: Checked inductivity of 62230 backedges. 0 proven. 61250 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2018-09-26 08:18:21,433 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:21,434 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:18:21,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:18:21,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:18:21,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:18:21,434 INFO L87 Difference]: Start difference. First operand 593 states and 642 transitions. Second operand 52 states. [2018-09-26 08:18:22,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:22,124 INFO L93 Difference]: Finished difference Result 617 states and 668 transitions. [2018-09-26 08:18:22,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:18:22,124 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 592 [2018-09-26 08:18:22,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:22,127 INFO L225 Difference]: With dead ends: 617 [2018-09-26 08:18:22,127 INFO L226 Difference]: Without dead ends: 615 [2018-09-26 08:18:22,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:18:22,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-09-26 08:18:22,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 605. [2018-09-26 08:18:22,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-09-26 08:18:22,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 655 transitions. [2018-09-26 08:18:22,429 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 655 transitions. Word has length 592 [2018-09-26 08:18:22,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:22,429 INFO L480 AbstractCegarLoop]: Abstraction has 605 states and 655 transitions. [2018-09-26 08:18:22,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:18:22,430 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 655 transitions. [2018-09-26 08:18:22,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2018-09-26 08:18:22,434 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:22,434 INFO L375 BasicCegarLoop]: trace histogram [250, 200, 51, 50, 50, 1, 1, 1] [2018-09-26 08:18:22,434 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:22,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:22,435 INFO L82 PathProgramCache]: Analyzing trace with hash -2011500317, now seen corresponding path program 53 times [2018-09-26 08:18:22,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:23,101 INFO L134 CoverageAnalysis]: Checked inductivity of 64800 backedges. 0 proven. 63800 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2018-09-26 08:18:23,102 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:23,102 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:18:23,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:18:23,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:18:23,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:18:23,103 INFO L87 Difference]: Start difference. First operand 605 states and 655 transitions. Second operand 53 states. [2018-09-26 08:18:23,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:23,827 INFO L93 Difference]: Finished difference Result 629 states and 681 transitions. [2018-09-26 08:18:23,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:18:23,827 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 604 [2018-09-26 08:18:23,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:23,830 INFO L225 Difference]: With dead ends: 629 [2018-09-26 08:18:23,830 INFO L226 Difference]: Without dead ends: 627 [2018-09-26 08:18:23,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:18:23,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-09-26 08:18:24,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 617. [2018-09-26 08:18:24,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-09-26 08:18:24,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 668 transitions. [2018-09-26 08:18:24,182 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 668 transitions. Word has length 604 [2018-09-26 08:18:24,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:24,183 INFO L480 AbstractCegarLoop]: Abstraction has 617 states and 668 transitions. [2018-09-26 08:18:24,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:18:24,183 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 668 transitions. [2018-09-26 08:18:24,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2018-09-26 08:18:24,187 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:24,187 INFO L375 BasicCegarLoop]: trace histogram [255, 204, 52, 51, 51, 1, 1, 1] [2018-09-26 08:18:24,188 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:24,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:24,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1710365729, now seen corresponding path program 54 times [2018-09-26 08:18:24,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:24,926 INFO L134 CoverageAnalysis]: Checked inductivity of 67422 backedges. 0 proven. 66402 refuted. 0 times theorem prover too weak. 1020 trivial. 0 not checked. [2018-09-26 08:18:24,927 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:24,927 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:18:24,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:18:24,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:18:24,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:18:24,928 INFO L87 Difference]: Start difference. First operand 617 states and 668 transitions. Second operand 54 states. [2018-09-26 08:18:25,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:25,655 INFO L93 Difference]: Finished difference Result 641 states and 694 transitions. [2018-09-26 08:18:25,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:18:25,655 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 616 [2018-09-26 08:18:25,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:25,658 INFO L225 Difference]: With dead ends: 641 [2018-09-26 08:18:25,658 INFO L226 Difference]: Without dead ends: 639 [2018-09-26 08:18:25,659 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:18:25,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-09-26 08:18:25,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 629. [2018-09-26 08:18:25,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2018-09-26 08:18:25,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 681 transitions. [2018-09-26 08:18:25,988 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 681 transitions. Word has length 616 [2018-09-26 08:18:25,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:25,988 INFO L480 AbstractCegarLoop]: Abstraction has 629 states and 681 transitions. [2018-09-26 08:18:25,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:18:25,989 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 681 transitions. [2018-09-26 08:18:25,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2018-09-26 08:18:25,992 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:25,993 INFO L375 BasicCegarLoop]: trace histogram [260, 208, 53, 52, 52, 1, 1, 1] [2018-09-26 08:18:25,993 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:25,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:25,993 INFO L82 PathProgramCache]: Analyzing trace with hash -14919073, now seen corresponding path program 55 times [2018-09-26 08:18:25,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:26,721 INFO L134 CoverageAnalysis]: Checked inductivity of 70096 backedges. 0 proven. 69056 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2018-09-26 08:18:26,721 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:26,721 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:18:26,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:18:26,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:18:26,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:18:26,722 INFO L87 Difference]: Start difference. First operand 629 states and 681 transitions. Second operand 55 states. [2018-09-26 08:18:27,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:27,511 INFO L93 Difference]: Finished difference Result 653 states and 707 transitions. [2018-09-26 08:18:27,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:18:27,511 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 628 [2018-09-26 08:18:27,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:27,514 INFO L225 Difference]: With dead ends: 653 [2018-09-26 08:18:27,514 INFO L226 Difference]: Without dead ends: 651 [2018-09-26 08:18:27,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:18:27,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-09-26 08:18:27,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 641. [2018-09-26 08:18:27,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2018-09-26 08:18:27,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 694 transitions. [2018-09-26 08:18:27,882 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 694 transitions. Word has length 628 [2018-09-26 08:18:27,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:27,882 INFO L480 AbstractCegarLoop]: Abstraction has 641 states and 694 transitions. [2018-09-26 08:18:27,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:18:27,882 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 694 transitions. [2018-09-26 08:18:27,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2018-09-26 08:18:27,886 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:27,886 INFO L375 BasicCegarLoop]: trace histogram [265, 212, 54, 53, 53, 1, 1, 1] [2018-09-26 08:18:27,887 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:27,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:27,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1466618979, now seen corresponding path program 56 times [2018-09-26 08:18:27,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:28,678 INFO L134 CoverageAnalysis]: Checked inductivity of 72822 backedges. 0 proven. 71762 refuted. 0 times theorem prover too weak. 1060 trivial. 0 not checked. [2018-09-26 08:18:28,678 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:28,678 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:18:28,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:18:28,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:18:28,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:18:28,680 INFO L87 Difference]: Start difference. First operand 641 states and 694 transitions. Second operand 56 states. [2018-09-26 08:18:29,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:29,519 INFO L93 Difference]: Finished difference Result 665 states and 720 transitions. [2018-09-26 08:18:29,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:18:29,520 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 640 [2018-09-26 08:18:29,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:29,524 INFO L225 Difference]: With dead ends: 665 [2018-09-26 08:18:29,524 INFO L226 Difference]: Without dead ends: 663 [2018-09-26 08:18:29,525 INFO L605 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-09-26 08:18:29,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-09-26 08:18:29,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 653. [2018-09-26 08:18:29,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2018-09-26 08:18:29,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 707 transitions. [2018-09-26 08:18:29,966 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 707 transitions. Word has length 640 [2018-09-26 08:18:29,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:29,967 INFO L480 AbstractCegarLoop]: Abstraction has 653 states and 707 transitions. [2018-09-26 08:18:29,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:18:29,967 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 707 transitions. [2018-09-26 08:18:29,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2018-09-26 08:18:29,970 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:29,970 INFO L375 BasicCegarLoop]: trace histogram [270, 216, 55, 54, 54, 1, 1, 1] [2018-09-26 08:18:29,971 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:29,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:29,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1709699109, now seen corresponding path program 57 times [2018-09-26 08:18:29,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:30,769 INFO L134 CoverageAnalysis]: Checked inductivity of 75600 backedges. 0 proven. 74520 refuted. 0 times theorem prover too weak. 1080 trivial. 0 not checked. [2018-09-26 08:18:30,770 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:30,770 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:18:30,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:18:30,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:18:30,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:18:30,771 INFO L87 Difference]: Start difference. First operand 653 states and 707 transitions. Second operand 57 states. [2018-09-26 08:18:31,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:31,537 INFO L93 Difference]: Finished difference Result 677 states and 733 transitions. [2018-09-26 08:18:31,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:18:31,537 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 652 [2018-09-26 08:18:31,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:31,539 INFO L225 Difference]: With dead ends: 677 [2018-09-26 08:18:31,539 INFO L226 Difference]: Without dead ends: 675 [2018-09-26 08:18:31,540 INFO L605 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-09-26 08:18:31,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2018-09-26 08:18:31,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 665. [2018-09-26 08:18:31,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2018-09-26 08:18:31,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 720 transitions. [2018-09-26 08:18:31,904 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 720 transitions. Word has length 652 [2018-09-26 08:18:31,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:31,905 INFO L480 AbstractCegarLoop]: Abstraction has 665 states and 720 transitions. [2018-09-26 08:18:31,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:18:31,905 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 720 transitions. [2018-09-26 08:18:31,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2018-09-26 08:18:31,908 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:31,908 INFO L375 BasicCegarLoop]: trace histogram [275, 220, 56, 55, 55, 1, 1, 1] [2018-09-26 08:18:31,908 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:31,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:31,909 INFO L82 PathProgramCache]: Analyzing trace with hash -836729063, now seen corresponding path program 58 times [2018-09-26 08:18:31,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:32,680 INFO L134 CoverageAnalysis]: Checked inductivity of 78430 backedges. 0 proven. 77330 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2018-09-26 08:18:32,681 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:32,681 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:18:32,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:18:32,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:18:32,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:18:32,682 INFO L87 Difference]: Start difference. First operand 665 states and 720 transitions. Second operand 58 states. [2018-09-26 08:18:33,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:33,479 INFO L93 Difference]: Finished difference Result 689 states and 746 transitions. [2018-09-26 08:18:33,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:18:33,479 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 664 [2018-09-26 08:18:33,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:33,482 INFO L225 Difference]: With dead ends: 689 [2018-09-26 08:18:33,482 INFO L226 Difference]: Without dead ends: 687 [2018-09-26 08:18:33,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:18:33,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-09-26 08:18:33,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 677. [2018-09-26 08:18:33,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2018-09-26 08:18:33,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 733 transitions. [2018-09-26 08:18:33,881 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 733 transitions. Word has length 664 [2018-09-26 08:18:33,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:33,881 INFO L480 AbstractCegarLoop]: Abstraction has 677 states and 733 transitions. [2018-09-26 08:18:33,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:18:33,882 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 733 transitions. [2018-09-26 08:18:33,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2018-09-26 08:18:33,885 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:33,885 INFO L375 BasicCegarLoop]: trace histogram [280, 224, 57, 56, 56, 1, 1, 1] [2018-09-26 08:18:33,885 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:33,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:33,886 INFO L82 PathProgramCache]: Analyzing trace with hash -504753833, now seen corresponding path program 59 times [2018-09-26 08:18:33,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:34,764 INFO L134 CoverageAnalysis]: Checked inductivity of 81312 backedges. 0 proven. 80192 refuted. 0 times theorem prover too weak. 1120 trivial. 0 not checked. [2018-09-26 08:18:34,764 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:34,764 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:18:34,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:18:34,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:18:34,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:18:34,766 INFO L87 Difference]: Start difference. First operand 677 states and 733 transitions. Second operand 59 states. [2018-09-26 08:18:35,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:35,673 INFO L93 Difference]: Finished difference Result 701 states and 759 transitions. [2018-09-26 08:18:35,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:18:35,674 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 676 [2018-09-26 08:18:35,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:35,677 INFO L225 Difference]: With dead ends: 701 [2018-09-26 08:18:35,677 INFO L226 Difference]: Without dead ends: 699 [2018-09-26 08:18:35,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:18:35,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2018-09-26 08:18:36,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 689. [2018-09-26 08:18:36,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2018-09-26 08:18:36,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 746 transitions. [2018-09-26 08:18:36,123 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 746 transitions. Word has length 676 [2018-09-26 08:18:36,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:36,127 INFO L480 AbstractCegarLoop]: Abstraction has 689 states and 746 transitions. [2018-09-26 08:18:36,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:18:36,127 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 746 transitions. [2018-09-26 08:18:36,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2018-09-26 08:18:36,132 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:36,133 INFO L375 BasicCegarLoop]: trace histogram [285, 228, 58, 57, 57, 1, 1, 1] [2018-09-26 08:18:36,133 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:36,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:36,134 INFO L82 PathProgramCache]: Analyzing trace with hash -177197419, now seen corresponding path program 60 times [2018-09-26 08:18:36,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:37,046 INFO L134 CoverageAnalysis]: Checked inductivity of 84246 backedges. 0 proven. 83106 refuted. 0 times theorem prover too weak. 1140 trivial. 0 not checked. [2018-09-26 08:18:37,046 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:37,046 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:18:37,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:18:37,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:18:37,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:18:37,047 INFO L87 Difference]: Start difference. First operand 689 states and 746 transitions. Second operand 60 states. [2018-09-26 08:18:37,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:37,932 INFO L93 Difference]: Finished difference Result 713 states and 772 transitions. [2018-09-26 08:18:37,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:18:37,933 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 688 [2018-09-26 08:18:37,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:37,935 INFO L225 Difference]: With dead ends: 713 [2018-09-26 08:18:37,935 INFO L226 Difference]: Without dead ends: 711 [2018-09-26 08:18:37,936 INFO L605 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-09-26 08:18:37,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2018-09-26 08:18:38,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 701. [2018-09-26 08:18:38,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2018-09-26 08:18:38,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 759 transitions. [2018-09-26 08:18:38,331 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 759 transitions. Word has length 688 [2018-09-26 08:18:38,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:38,332 INFO L480 AbstractCegarLoop]: Abstraction has 701 states and 759 transitions. [2018-09-26 08:18:38,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:18:38,332 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 759 transitions. [2018-09-26 08:18:38,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2018-09-26 08:18:38,335 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:38,335 INFO L375 BasicCegarLoop]: trace histogram [290, 232, 59, 58, 58, 1, 1, 1] [2018-09-26 08:18:38,335 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:38,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:38,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1955701037, now seen corresponding path program 61 times [2018-09-26 08:18:38,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:39,215 INFO L134 CoverageAnalysis]: Checked inductivity of 87232 backedges. 0 proven. 86072 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2018-09-26 08:18:39,215 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:39,215 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:18:39,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:18:39,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:18:39,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:18:39,217 INFO L87 Difference]: Start difference. First operand 701 states and 759 transitions. Second operand 61 states. [2018-09-26 08:18:40,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:40,194 INFO L93 Difference]: Finished difference Result 725 states and 785 transitions. [2018-09-26 08:18:40,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:18:40,194 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 700 [2018-09-26 08:18:40,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:40,196 INFO L225 Difference]: With dead ends: 725 [2018-09-26 08:18:40,196 INFO L226 Difference]: Without dead ends: 723 [2018-09-26 08:18:40,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:18:40,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2018-09-26 08:18:40,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 713. [2018-09-26 08:18:40,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-09-26 08:18:40,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 772 transitions. [2018-09-26 08:18:40,610 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 772 transitions. Word has length 700 [2018-09-26 08:18:40,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:40,610 INFO L480 AbstractCegarLoop]: Abstraction has 713 states and 772 transitions. [2018-09-26 08:18:40,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:18:40,610 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 772 transitions. [2018-09-26 08:18:40,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 713 [2018-09-26 08:18:40,614 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:40,614 INFO L375 BasicCegarLoop]: trace histogram [295, 236, 60, 59, 59, 1, 1, 1] [2018-09-26 08:18:40,615 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:40,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:40,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1767907857, now seen corresponding path program 62 times [2018-09-26 08:18:40,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:41,540 INFO L134 CoverageAnalysis]: Checked inductivity of 90270 backedges. 0 proven. 89090 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-09-26 08:18:41,540 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:41,540 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:18:41,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:18:41,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:18:41,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:18:41,542 INFO L87 Difference]: Start difference. First operand 713 states and 772 transitions. Second operand 62 states. [2018-09-26 08:18:42,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:42,547 INFO L93 Difference]: Finished difference Result 737 states and 798 transitions. [2018-09-26 08:18:42,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:18:42,547 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 712 [2018-09-26 08:18:42,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:42,550 INFO L225 Difference]: With dead ends: 737 [2018-09-26 08:18:42,550 INFO L226 Difference]: Without dead ends: 735 [2018-09-26 08:18:42,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:18:42,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2018-09-26 08:18:43,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 725. [2018-09-26 08:18:43,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-09-26 08:18:43,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 785 transitions. [2018-09-26 08:18:43,019 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 785 transitions. Word has length 712 [2018-09-26 08:18:43,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:43,019 INFO L480 AbstractCegarLoop]: Abstraction has 725 states and 785 transitions. [2018-09-26 08:18:43,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:18:43,020 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 785 transitions. [2018-09-26 08:18:43,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 725 [2018-09-26 08:18:43,023 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:43,024 INFO L375 BasicCegarLoop]: trace histogram [300, 240, 61, 60, 60, 1, 1, 1] [2018-09-26 08:18:43,024 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:43,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:43,024 INFO L82 PathProgramCache]: Analyzing trace with hash 2004940879, now seen corresponding path program 63 times [2018-09-26 08:18:43,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:43,988 INFO L134 CoverageAnalysis]: Checked inductivity of 93360 backedges. 0 proven. 92160 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-09-26 08:18:43,988 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:43,988 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:18:43,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:18:43,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:18:43,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:18:43,989 INFO L87 Difference]: Start difference. First operand 725 states and 785 transitions. Second operand 63 states. [2018-09-26 08:18:44,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:44,932 INFO L93 Difference]: Finished difference Result 749 states and 811 transitions. [2018-09-26 08:18:44,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:18:44,933 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 724 [2018-09-26 08:18:44,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:44,935 INFO L225 Difference]: With dead ends: 749 [2018-09-26 08:18:44,935 INFO L226 Difference]: Without dead ends: 747 [2018-09-26 08:18:44,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:18:44,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2018-09-26 08:18:45,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 737. [2018-09-26 08:18:45,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2018-09-26 08:18:45,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 798 transitions. [2018-09-26 08:18:45,378 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 798 transitions. Word has length 724 [2018-09-26 08:18:45,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:45,378 INFO L480 AbstractCegarLoop]: Abstraction has 737 states and 798 transitions. [2018-09-26 08:18:45,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:18:45,379 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 798 transitions. [2018-09-26 08:18:45,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 737 [2018-09-26 08:18:45,383 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:45,383 INFO L375 BasicCegarLoop]: trace histogram [305, 244, 62, 61, 61, 1, 1, 1] [2018-09-26 08:18:45,383 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:45,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:45,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1597218419, now seen corresponding path program 64 times [2018-09-26 08:18:45,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:46,358 INFO L134 CoverageAnalysis]: Checked inductivity of 96502 backedges. 0 proven. 95282 refuted. 0 times theorem prover too weak. 1220 trivial. 0 not checked. [2018-09-26 08:18:46,358 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:46,358 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:18:46,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:18:46,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:18:46,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:18:46,360 INFO L87 Difference]: Start difference. First operand 737 states and 798 transitions. Second operand 64 states. [2018-09-26 08:18:47,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:47,466 INFO L93 Difference]: Finished difference Result 761 states and 824 transitions. [2018-09-26 08:18:47,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:18:47,466 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 736 [2018-09-26 08:18:47,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:47,470 INFO L225 Difference]: With dead ends: 761 [2018-09-26 08:18:47,470 INFO L226 Difference]: Without dead ends: 759 [2018-09-26 08:18:47,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:18:47,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-09-26 08:18:48,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 749. [2018-09-26 08:18:48,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2018-09-26 08:18:48,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 811 transitions. [2018-09-26 08:18:48,007 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 811 transitions. Word has length 736 [2018-09-26 08:18:48,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:48,007 INFO L480 AbstractCegarLoop]: Abstraction has 749 states and 811 transitions. [2018-09-26 08:18:48,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:18:48,007 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 811 transitions. [2018-09-26 08:18:48,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 749 [2018-09-26 08:18:48,011 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:48,011 INFO L375 BasicCegarLoop]: trace histogram [310, 248, 63, 62, 62, 1, 1, 1] [2018-09-26 08:18:48,012 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:48,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:48,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1291985461, now seen corresponding path program 65 times [2018-09-26 08:18:48,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:48,959 INFO L134 CoverageAnalysis]: Checked inductivity of 99696 backedges. 0 proven. 98456 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2018-09-26 08:18:48,960 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:48,960 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:18:48,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:18:48,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:18:48,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:18:48,961 INFO L87 Difference]: Start difference. First operand 749 states and 811 transitions. Second operand 65 states. [2018-09-26 08:18:49,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:49,998 INFO L93 Difference]: Finished difference Result 773 states and 837 transitions. [2018-09-26 08:18:49,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:18:49,998 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 748 [2018-09-26 08:18:49,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:50,001 INFO L225 Difference]: With dead ends: 773 [2018-09-26 08:18:50,001 INFO L226 Difference]: Without dead ends: 771 [2018-09-26 08:18:50,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:18:50,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-09-26 08:18:50,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 761. [2018-09-26 08:18:50,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2018-09-26 08:18:50,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 824 transitions. [2018-09-26 08:18:50,494 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 824 transitions. Word has length 748 [2018-09-26 08:18:50,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:50,494 INFO L480 AbstractCegarLoop]: Abstraction has 761 states and 824 transitions. [2018-09-26 08:18:50,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:18:50,494 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 824 transitions. [2018-09-26 08:18:50,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2018-09-26 08:18:50,498 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:50,498 INFO L375 BasicCegarLoop]: trace histogram [315, 252, 64, 63, 63, 1, 1, 1] [2018-09-26 08:18:50,498 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:50,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:50,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1049685257, now seen corresponding path program 66 times [2018-09-26 08:18:50,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:51,506 INFO L134 CoverageAnalysis]: Checked inductivity of 102942 backedges. 0 proven. 101682 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2018-09-26 08:18:51,506 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:51,507 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:18:51,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:18:51,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:18:51,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:18:51,508 INFO L87 Difference]: Start difference. First operand 761 states and 824 transitions. Second operand 66 states. [2018-09-26 08:18:52,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:52,565 INFO L93 Difference]: Finished difference Result 785 states and 850 transitions. [2018-09-26 08:18:52,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:18:52,565 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 760 [2018-09-26 08:18:52,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:52,568 INFO L225 Difference]: With dead ends: 785 [2018-09-26 08:18:52,568 INFO L226 Difference]: Without dead ends: 783 [2018-09-26 08:18:52,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:18:52,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-09-26 08:18:53,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 773. [2018-09-26 08:18:53,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2018-09-26 08:18:53,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 837 transitions. [2018-09-26 08:18:53,059 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 837 transitions. Word has length 760 [2018-09-26 08:18:53,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:53,059 INFO L480 AbstractCegarLoop]: Abstraction has 773 states and 837 transitions. [2018-09-26 08:18:53,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:18:53,060 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 837 transitions. [2018-09-26 08:18:53,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 773 [2018-09-26 08:18:53,063 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:53,064 INFO L375 BasicCegarLoop]: trace histogram [320, 256, 65, 64, 64, 1, 1, 1] [2018-09-26 08:18:53,064 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:53,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:53,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1992363847, now seen corresponding path program 67 times [2018-09-26 08:18:53,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:54,142 INFO L134 CoverageAnalysis]: Checked inductivity of 106240 backedges. 0 proven. 104960 refuted. 0 times theorem prover too weak. 1280 trivial. 0 not checked. [2018-09-26 08:18:54,142 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:54,143 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:18:54,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:18:54,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:18:54,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:18:54,144 INFO L87 Difference]: Start difference. First operand 773 states and 837 transitions. Second operand 67 states. [2018-09-26 08:18:55,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:55,257 INFO L93 Difference]: Finished difference Result 797 states and 863 transitions. [2018-09-26 08:18:55,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:18:55,257 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 772 [2018-09-26 08:18:55,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:55,259 INFO L225 Difference]: With dead ends: 797 [2018-09-26 08:18:55,260 INFO L226 Difference]: Without dead ends: 795 [2018-09-26 08:18:55,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:18:55,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-09-26 08:18:55,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 785. [2018-09-26 08:18:55,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2018-09-26 08:18:55,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 850 transitions. [2018-09-26 08:18:55,765 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 850 transitions. Word has length 772 [2018-09-26 08:18:55,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:55,765 INFO L480 AbstractCegarLoop]: Abstraction has 785 states and 850 transitions. [2018-09-26 08:18:55,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:18:55,766 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 850 transitions. [2018-09-26 08:18:55,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2018-09-26 08:18:55,770 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:55,770 INFO L375 BasicCegarLoop]: trace histogram [325, 260, 66, 65, 65, 1, 1, 1] [2018-09-26 08:18:55,770 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:55,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:55,771 INFO L82 PathProgramCache]: Analyzing trace with hash 294241413, now seen corresponding path program 68 times [2018-09-26 08:18:55,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:56,825 INFO L134 CoverageAnalysis]: Checked inductivity of 109590 backedges. 0 proven. 108290 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2018-09-26 08:18:56,825 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:56,825 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:18:56,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:18:56,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:18:56,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:18:56,826 INFO L87 Difference]: Start difference. First operand 785 states and 850 transitions. Second operand 68 states. [2018-09-26 08:18:57,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:18:57,963 INFO L93 Difference]: Finished difference Result 809 states and 876 transitions. [2018-09-26 08:18:57,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:18:57,963 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 784 [2018-09-26 08:18:57,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:18:57,966 INFO L225 Difference]: With dead ends: 809 [2018-09-26 08:18:57,966 INFO L226 Difference]: Without dead ends: 807 [2018-09-26 08:18:57,966 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:18:57,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2018-09-26 08:18:58,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 797. [2018-09-26 08:18:58,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-09-26 08:18:58,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 863 transitions. [2018-09-26 08:18:58,572 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 863 transitions. Word has length 784 [2018-09-26 08:18:58,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:18:58,572 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 863 transitions. [2018-09-26 08:18:58,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:18:58,572 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 863 transitions. [2018-09-26 08:18:58,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 797 [2018-09-26 08:18:58,576 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:18:58,577 INFO L375 BasicCegarLoop]: trace histogram [330, 264, 67, 66, 66, 1, 1, 1] [2018-09-26 08:18:58,577 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:18:58,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:18:58,577 INFO L82 PathProgramCache]: Analyzing trace with hash 665226435, now seen corresponding path program 69 times [2018-09-26 08:18:58,577 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:18:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:18:59,668 INFO L134 CoverageAnalysis]: Checked inductivity of 112992 backedges. 0 proven. 111672 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2018-09-26 08:18:59,669 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:18:59,669 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:18:59,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:18:59,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:18:59,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:18:59,670 INFO L87 Difference]: Start difference. First operand 797 states and 863 transitions. Second operand 69 states. [2018-09-26 08:19:00,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:00,881 INFO L93 Difference]: Finished difference Result 821 states and 889 transitions. [2018-09-26 08:19:00,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:19:00,882 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 796 [2018-09-26 08:19:00,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:00,884 INFO L225 Difference]: With dead ends: 821 [2018-09-26 08:19:00,885 INFO L226 Difference]: Without dead ends: 819 [2018-09-26 08:19:00,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:19:00,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2018-09-26 08:19:01,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 809. [2018-09-26 08:19:01,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-09-26 08:19:01,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 876 transitions. [2018-09-26 08:19:01,435 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 876 transitions. Word has length 796 [2018-09-26 08:19:01,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:01,436 INFO L480 AbstractCegarLoop]: Abstraction has 809 states and 876 transitions. [2018-09-26 08:19:01,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:19:01,436 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 876 transitions. [2018-09-26 08:19:01,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 809 [2018-09-26 08:19:01,441 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:01,441 INFO L375 BasicCegarLoop]: trace histogram [335, 268, 68, 67, 67, 1, 1, 1] [2018-09-26 08:19:01,441 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:01,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:01,442 INFO L82 PathProgramCache]: Analyzing trace with hash 345171969, now seen corresponding path program 70 times [2018-09-26 08:19:01,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:02,616 INFO L134 CoverageAnalysis]: Checked inductivity of 116446 backedges. 0 proven. 115106 refuted. 0 times theorem prover too weak. 1340 trivial. 0 not checked. [2018-09-26 08:19:02,617 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:02,617 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:19:02,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:19:02,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:19:02,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:19:02,618 INFO L87 Difference]: Start difference. First operand 809 states and 876 transitions. Second operand 70 states. [2018-09-26 08:19:03,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:03,876 INFO L93 Difference]: Finished difference Result 833 states and 902 transitions. [2018-09-26 08:19:03,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:19:03,876 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 808 [2018-09-26 08:19:03,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:03,880 INFO L225 Difference]: With dead ends: 833 [2018-09-26 08:19:03,880 INFO L226 Difference]: Without dead ends: 831 [2018-09-26 08:19:03,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:19:03,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-09-26 08:19:04,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 821. [2018-09-26 08:19:04,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-09-26 08:19:04,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 889 transitions. [2018-09-26 08:19:04,449 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 889 transitions. Word has length 808 [2018-09-26 08:19:04,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:04,449 INFO L480 AbstractCegarLoop]: Abstraction has 821 states and 889 transitions. [2018-09-26 08:19:04,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:19:04,450 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 889 transitions. [2018-09-26 08:19:04,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 821 [2018-09-26 08:19:04,454 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:04,454 INFO L375 BasicCegarLoop]: trace histogram [340, 272, 69, 68, 68, 1, 1, 1] [2018-09-26 08:19:04,454 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:04,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:04,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1451906623, now seen corresponding path program 71 times [2018-09-26 08:19:04,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:05,586 INFO L134 CoverageAnalysis]: Checked inductivity of 119952 backedges. 0 proven. 118592 refuted. 0 times theorem prover too weak. 1360 trivial. 0 not checked. [2018-09-26 08:19:05,586 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:05,586 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:19:05,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:19:05,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:19:05,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:19:05,587 INFO L87 Difference]: Start difference. First operand 821 states and 889 transitions. Second operand 71 states. [2018-09-26 08:19:06,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:06,884 INFO L93 Difference]: Finished difference Result 845 states and 915 transitions. [2018-09-26 08:19:06,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:19:06,885 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 820 [2018-09-26 08:19:06,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:06,888 INFO L225 Difference]: With dead ends: 845 [2018-09-26 08:19:06,888 INFO L226 Difference]: Without dead ends: 843 [2018-09-26 08:19:06,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:19:06,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2018-09-26 08:19:07,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 833. [2018-09-26 08:19:07,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2018-09-26 08:19:07,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 902 transitions. [2018-09-26 08:19:07,539 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 902 transitions. Word has length 820 [2018-09-26 08:19:07,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:07,539 INFO L480 AbstractCegarLoop]: Abstraction has 833 states and 902 transitions. [2018-09-26 08:19:07,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:19:07,539 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 902 transitions. [2018-09-26 08:19:07,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 833 [2018-09-26 08:19:07,544 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:07,544 INFO L375 BasicCegarLoop]: trace histogram [345, 276, 70, 69, 69, 1, 1, 1] [2018-09-26 08:19:07,544 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:07,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:07,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1854429053, now seen corresponding path program 72 times [2018-09-26 08:19:07,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:08,809 INFO L134 CoverageAnalysis]: Checked inductivity of 123510 backedges. 0 proven. 122130 refuted. 0 times theorem prover too weak. 1380 trivial. 0 not checked. [2018-09-26 08:19:08,809 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:08,809 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:19:08,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:19:08,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:19:08,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:19:08,810 INFO L87 Difference]: Start difference. First operand 833 states and 902 transitions. Second operand 72 states. [2018-09-26 08:19:10,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:10,124 INFO L93 Difference]: Finished difference Result 857 states and 928 transitions. [2018-09-26 08:19:10,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:19:10,124 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 832 [2018-09-26 08:19:10,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:10,126 INFO L225 Difference]: With dead ends: 857 [2018-09-26 08:19:10,126 INFO L226 Difference]: Without dead ends: 855 [2018-09-26 08:19:10,127 INFO L605 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-09-26 08:19:10,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2018-09-26 08:19:10,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 845. [2018-09-26 08:19:10,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-09-26 08:19:10,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 915 transitions. [2018-09-26 08:19:10,730 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 915 transitions. Word has length 832 [2018-09-26 08:19:10,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:10,730 INFO L480 AbstractCegarLoop]: Abstraction has 845 states and 915 transitions. [2018-09-26 08:19:10,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:19:10,730 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 915 transitions. [2018-09-26 08:19:10,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 845 [2018-09-26 08:19:10,735 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:10,735 INFO L375 BasicCegarLoop]: trace histogram [350, 280, 71, 70, 70, 1, 1, 1] [2018-09-26 08:19:10,735 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:10,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:10,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1068995653, now seen corresponding path program 73 times [2018-09-26 08:19:10,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:11,978 INFO L134 CoverageAnalysis]: Checked inductivity of 127120 backedges. 0 proven. 125720 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2018-09-26 08:19:11,979 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:11,979 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:19:11,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:19:11,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:19:11,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:19:11,980 INFO L87 Difference]: Start difference. First operand 845 states and 915 transitions. Second operand 73 states. [2018-09-26 08:19:13,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:13,290 INFO L93 Difference]: Finished difference Result 869 states and 941 transitions. [2018-09-26 08:19:13,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:19:13,290 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 844 [2018-09-26 08:19:13,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:13,292 INFO L225 Difference]: With dead ends: 869 [2018-09-26 08:19:13,292 INFO L226 Difference]: Without dead ends: 867 [2018-09-26 08:19:13,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:19:13,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-09-26 08:19:13,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 857. [2018-09-26 08:19:13,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2018-09-26 08:19:13,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 928 transitions. [2018-09-26 08:19:13,912 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 928 transitions. Word has length 844 [2018-09-26 08:19:13,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:13,912 INFO L480 AbstractCegarLoop]: Abstraction has 857 states and 928 transitions. [2018-09-26 08:19:13,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:19:13,912 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 928 transitions. [2018-09-26 08:19:13,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 857 [2018-09-26 08:19:13,917 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:13,917 INFO L375 BasicCegarLoop]: trace histogram [355, 284, 72, 71, 71, 1, 1, 1] [2018-09-26 08:19:13,917 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:13,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:13,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1917195001, now seen corresponding path program 74 times [2018-09-26 08:19:13,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:15,217 INFO L134 CoverageAnalysis]: Checked inductivity of 130782 backedges. 0 proven. 129362 refuted. 0 times theorem prover too weak. 1420 trivial. 0 not checked. [2018-09-26 08:19:15,218 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:15,218 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:19:15,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:19:15,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:19:15,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:19:15,219 INFO L87 Difference]: Start difference. First operand 857 states and 928 transitions. Second operand 74 states. [2018-09-26 08:19:16,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:16,527 INFO L93 Difference]: Finished difference Result 881 states and 954 transitions. [2018-09-26 08:19:16,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:19:16,527 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 856 [2018-09-26 08:19:16,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:16,529 INFO L225 Difference]: With dead ends: 881 [2018-09-26 08:19:16,529 INFO L226 Difference]: Without dead ends: 879 [2018-09-26 08:19:16,530 INFO L605 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-09-26 08:19:16,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2018-09-26 08:19:17,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 869. [2018-09-26 08:19:17,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2018-09-26 08:19:17,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 941 transitions. [2018-09-26 08:19:17,170 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 941 transitions. Word has length 856 [2018-09-26 08:19:17,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:17,171 INFO L480 AbstractCegarLoop]: Abstraction has 869 states and 941 transitions. [2018-09-26 08:19:17,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:19:17,171 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 941 transitions. [2018-09-26 08:19:17,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 869 [2018-09-26 08:19:17,176 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:17,176 INFO L375 BasicCegarLoop]: trace histogram [360, 288, 73, 72, 72, 1, 1, 1] [2018-09-26 08:19:17,176 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:17,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:17,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1304218935, now seen corresponding path program 75 times [2018-09-26 08:19:17,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:18,428 INFO L134 CoverageAnalysis]: Checked inductivity of 134496 backedges. 0 proven. 133056 refuted. 0 times theorem prover too weak. 1440 trivial. 0 not checked. [2018-09-26 08:19:18,429 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:18,429 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:19:18,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:19:18,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:19:18,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:19:18,430 INFO L87 Difference]: Start difference. First operand 869 states and 941 transitions. Second operand 75 states. [2018-09-26 08:19:19,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:19,763 INFO L93 Difference]: Finished difference Result 893 states and 967 transitions. [2018-09-26 08:19:19,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:19:19,763 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 868 [2018-09-26 08:19:19,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:19,765 INFO L225 Difference]: With dead ends: 893 [2018-09-26 08:19:19,765 INFO L226 Difference]: Without dead ends: 891 [2018-09-26 08:19:19,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:19:19,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2018-09-26 08:19:20,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 881. [2018-09-26 08:19:20,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2018-09-26 08:19:20,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 954 transitions. [2018-09-26 08:19:20,446 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 954 transitions. Word has length 868 [2018-09-26 08:19:20,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:20,447 INFO L480 AbstractCegarLoop]: Abstraction has 881 states and 954 transitions. [2018-09-26 08:19:20,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:19:20,447 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 954 transitions. [2018-09-26 08:19:20,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 881 [2018-09-26 08:19:20,451 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:20,452 INFO L375 BasicCegarLoop]: trace histogram [365, 292, 74, 73, 73, 1, 1, 1] [2018-09-26 08:19:20,452 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:20,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:20,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1633150347, now seen corresponding path program 76 times [2018-09-26 08:19:20,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:21,799 INFO L134 CoverageAnalysis]: Checked inductivity of 138262 backedges. 0 proven. 136802 refuted. 0 times theorem prover too weak. 1460 trivial. 0 not checked. [2018-09-26 08:19:21,799 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:21,800 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:19:21,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:19:21,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:19:21,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:19:21,801 INFO L87 Difference]: Start difference. First operand 881 states and 954 transitions. Second operand 76 states. [2018-09-26 08:19:23,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:23,265 INFO L93 Difference]: Finished difference Result 905 states and 980 transitions. [2018-09-26 08:19:23,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:19:23,265 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 880 [2018-09-26 08:19:23,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:23,267 INFO L225 Difference]: With dead ends: 905 [2018-09-26 08:19:23,267 INFO L226 Difference]: Without dead ends: 903 [2018-09-26 08:19:23,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:19:23,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2018-09-26 08:19:24,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 893. [2018-09-26 08:19:24,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2018-09-26 08:19:24,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 967 transitions. [2018-09-26 08:19:24,029 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 967 transitions. Word has length 880 [2018-09-26 08:19:24,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:24,030 INFO L480 AbstractCegarLoop]: Abstraction has 893 states and 967 transitions. [2018-09-26 08:19:24,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:19:24,030 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 967 transitions. [2018-09-26 08:19:24,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 893 [2018-09-26 08:19:24,037 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:24,037 INFO L375 BasicCegarLoop]: trace histogram [370, 296, 75, 74, 74, 1, 1, 1] [2018-09-26 08:19:24,038 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:24,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:24,038 INFO L82 PathProgramCache]: Analyzing trace with hash 331578035, now seen corresponding path program 77 times [2018-09-26 08:19:24,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:25,460 INFO L134 CoverageAnalysis]: Checked inductivity of 142080 backedges. 0 proven. 140600 refuted. 0 times theorem prover too weak. 1480 trivial. 0 not checked. [2018-09-26 08:19:25,460 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:25,460 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:19:25,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:19:25,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:19:25,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:19:25,461 INFO L87 Difference]: Start difference. First operand 893 states and 967 transitions. Second operand 77 states. [2018-09-26 08:19:27,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:27,001 INFO L93 Difference]: Finished difference Result 917 states and 993 transitions. [2018-09-26 08:19:27,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:19:27,001 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 892 [2018-09-26 08:19:27,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:27,003 INFO L225 Difference]: With dead ends: 917 [2018-09-26 08:19:27,003 INFO L226 Difference]: Without dead ends: 915 [2018-09-26 08:19:27,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:19:27,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-09-26 08:19:27,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 905. [2018-09-26 08:19:27,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2018-09-26 08:19:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 980 transitions. [2018-09-26 08:19:27,713 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 980 transitions. Word has length 892 [2018-09-26 08:19:27,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:27,713 INFO L480 AbstractCegarLoop]: Abstraction has 905 states and 980 transitions. [2018-09-26 08:19:27,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:19:27,713 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 980 transitions. [2018-09-26 08:19:27,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 905 [2018-09-26 08:19:27,718 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:27,718 INFO L375 BasicCegarLoop]: trace histogram [375, 300, 76, 75, 75, 1, 1, 1] [2018-09-26 08:19:27,719 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:27,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:27,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1635095055, now seen corresponding path program 78 times [2018-09-26 08:19:27,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:29,112 INFO L134 CoverageAnalysis]: Checked inductivity of 145950 backedges. 0 proven. 144450 refuted. 0 times theorem prover too weak. 1500 trivial. 0 not checked. [2018-09-26 08:19:29,113 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:29,113 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:19:29,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:19:29,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:19:29,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:19:29,114 INFO L87 Difference]: Start difference. First operand 905 states and 980 transitions. Second operand 78 states. [2018-09-26 08:19:30,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:30,710 INFO L93 Difference]: Finished difference Result 929 states and 1006 transitions. [2018-09-26 08:19:30,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:19:30,710 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 904 [2018-09-26 08:19:30,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:30,712 INFO L225 Difference]: With dead ends: 929 [2018-09-26 08:19:30,712 INFO L226 Difference]: Without dead ends: 927 [2018-09-26 08:19:30,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:19:30,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-09-26 08:19:31,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 917. [2018-09-26 08:19:31,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 917 states. [2018-09-26 08:19:31,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 993 transitions. [2018-09-26 08:19:31,435 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 993 transitions. Word has length 904 [2018-09-26 08:19:31,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:31,436 INFO L480 AbstractCegarLoop]: Abstraction has 917 states and 993 transitions. [2018-09-26 08:19:31,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:19:31,436 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 993 transitions. [2018-09-26 08:19:31,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 917 [2018-09-26 08:19:31,442 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:31,442 INFO L375 BasicCegarLoop]: trace histogram [380, 304, 77, 76, 76, 1, 1, 1] [2018-09-26 08:19:31,442 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:31,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:31,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1396208687, now seen corresponding path program 79 times [2018-09-26 08:19:31,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:32,849 INFO L134 CoverageAnalysis]: Checked inductivity of 149872 backedges. 0 proven. 148352 refuted. 0 times theorem prover too weak. 1520 trivial. 0 not checked. [2018-09-26 08:19:32,849 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:32,849 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:19:32,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:19:32,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:19:32,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:19:32,850 INFO L87 Difference]: Start difference. First operand 917 states and 993 transitions. Second operand 79 states. [2018-09-26 08:19:34,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:34,534 INFO L93 Difference]: Finished difference Result 941 states and 1019 transitions. [2018-09-26 08:19:34,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:19:34,535 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 916 [2018-09-26 08:19:34,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:34,536 INFO L225 Difference]: With dead ends: 941 [2018-09-26 08:19:34,536 INFO L226 Difference]: Without dead ends: 939 [2018-09-26 08:19:34,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:19:34,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2018-09-26 08:19:35,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 929. [2018-09-26 08:19:35,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2018-09-26 08:19:35,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1006 transitions. [2018-09-26 08:19:35,293 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1006 transitions. Word has length 916 [2018-09-26 08:19:35,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:35,293 INFO L480 AbstractCegarLoop]: Abstraction has 929 states and 1006 transitions. [2018-09-26 08:19:35,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:19:35,294 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1006 transitions. [2018-09-26 08:19:35,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 929 [2018-09-26 08:19:35,299 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:35,299 INFO L375 BasicCegarLoop]: trace histogram [385, 308, 78, 77, 77, 1, 1, 1] [2018-09-26 08:19:35,299 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:35,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:35,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1221135725, now seen corresponding path program 80 times [2018-09-26 08:19:35,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:36,792 INFO L134 CoverageAnalysis]: Checked inductivity of 153846 backedges. 0 proven. 152306 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-09-26 08:19:36,792 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:36,792 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:19:36,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:19:36,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:19:36,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:19:36,793 INFO L87 Difference]: Start difference. First operand 929 states and 1006 transitions. Second operand 80 states. [2018-09-26 08:19:38,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:38,426 INFO L93 Difference]: Finished difference Result 953 states and 1032 transitions. [2018-09-26 08:19:38,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:19:38,426 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 928 [2018-09-26 08:19:38,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:38,428 INFO L225 Difference]: With dead ends: 953 [2018-09-26 08:19:38,428 INFO L226 Difference]: Without dead ends: 951 [2018-09-26 08:19:38,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:19:38,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-09-26 08:19:39,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 941. [2018-09-26 08:19:39,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 941 states. [2018-09-26 08:19:39,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1019 transitions. [2018-09-26 08:19:39,279 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1019 transitions. Word has length 928 [2018-09-26 08:19:39,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:39,279 INFO L480 AbstractCegarLoop]: Abstraction has 941 states and 1019 transitions. [2018-09-26 08:19:39,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:19:39,280 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1019 transitions. [2018-09-26 08:19:39,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 941 [2018-09-26 08:19:39,285 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:39,285 INFO L375 BasicCegarLoop]: trace histogram [390, 312, 79, 78, 78, 1, 1, 1] [2018-09-26 08:19:39,286 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:39,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:39,286 INFO L82 PathProgramCache]: Analyzing trace with hash 2029500843, now seen corresponding path program 81 times [2018-09-26 08:19:39,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:40,828 INFO L134 CoverageAnalysis]: Checked inductivity of 157872 backedges. 0 proven. 156312 refuted. 0 times theorem prover too weak. 1560 trivial. 0 not checked. [2018-09-26 08:19:40,829 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:40,829 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:19:40,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:19:40,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:19:40,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:19:40,830 INFO L87 Difference]: Start difference. First operand 941 states and 1019 transitions. Second operand 81 states. [2018-09-26 08:19:42,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:42,557 INFO L93 Difference]: Finished difference Result 965 states and 1045 transitions. [2018-09-26 08:19:42,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:19:42,557 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 940 [2018-09-26 08:19:42,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:42,559 INFO L225 Difference]: With dead ends: 965 [2018-09-26 08:19:42,559 INFO L226 Difference]: Without dead ends: 963 [2018-09-26 08:19:42,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:19:42,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-09-26 08:19:43,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 953. [2018-09-26 08:19:43,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2018-09-26 08:19:43,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1032 transitions. [2018-09-26 08:19:43,482 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1032 transitions. Word has length 940 [2018-09-26 08:19:43,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:43,483 INFO L480 AbstractCegarLoop]: Abstraction has 953 states and 1032 transitions. [2018-09-26 08:19:43,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:19:43,483 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1032 transitions. [2018-09-26 08:19:43,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 953 [2018-09-26 08:19:43,488 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:43,489 INFO L375 BasicCegarLoop]: trace histogram [395, 316, 80, 79, 79, 1, 1, 1] [2018-09-26 08:19:43,489 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:43,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:43,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1606420247, now seen corresponding path program 82 times [2018-09-26 08:19:43,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:44,995 INFO L134 CoverageAnalysis]: Checked inductivity of 161950 backedges. 0 proven. 160370 refuted. 0 times theorem prover too weak. 1580 trivial. 0 not checked. [2018-09-26 08:19:44,996 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:44,996 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:19:44,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:19:44,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:19:44,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:19:44,997 INFO L87 Difference]: Start difference. First operand 953 states and 1032 transitions. Second operand 82 states. [2018-09-26 08:19:46,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:46,778 INFO L93 Difference]: Finished difference Result 977 states and 1058 transitions. [2018-09-26 08:19:46,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:19:46,778 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 952 [2018-09-26 08:19:46,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:46,780 INFO L225 Difference]: With dead ends: 977 [2018-09-26 08:19:46,780 INFO L226 Difference]: Without dead ends: 975 [2018-09-26 08:19:46,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:19:46,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-09-26 08:19:47,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 965. [2018-09-26 08:19:47,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2018-09-26 08:19:47,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1045 transitions. [2018-09-26 08:19:47,609 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1045 transitions. Word has length 952 [2018-09-26 08:19:47,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:47,610 INFO L480 AbstractCegarLoop]: Abstraction has 965 states and 1045 transitions. [2018-09-26 08:19:47,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:19:47,610 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1045 transitions. [2018-09-26 08:19:47,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 965 [2018-09-26 08:19:47,618 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:47,619 INFO L375 BasicCegarLoop]: trace histogram [400, 320, 81, 80, 80, 1, 1, 1] [2018-09-26 08:19:47,619 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:47,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:47,620 INFO L82 PathProgramCache]: Analyzing trace with hash 501041959, now seen corresponding path program 83 times [2018-09-26 08:19:47,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:49,241 INFO L134 CoverageAnalysis]: Checked inductivity of 166080 backedges. 0 proven. 164480 refuted. 0 times theorem prover too weak. 1600 trivial. 0 not checked. [2018-09-26 08:19:49,242 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:49,242 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:19:49,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:19:49,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:19:49,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:19:49,243 INFO L87 Difference]: Start difference. First operand 965 states and 1045 transitions. Second operand 83 states. [2018-09-26 08:19:51,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:51,050 INFO L93 Difference]: Finished difference Result 989 states and 1071 transitions. [2018-09-26 08:19:51,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:19:51,050 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 964 [2018-09-26 08:19:51,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:51,052 INFO L225 Difference]: With dead ends: 989 [2018-09-26 08:19:51,053 INFO L226 Difference]: Without dead ends: 987 [2018-09-26 08:19:51,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:19:51,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2018-09-26 08:19:51,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 977. [2018-09-26 08:19:51,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2018-09-26 08:19:51,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1058 transitions. [2018-09-26 08:19:51,960 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1058 transitions. Word has length 964 [2018-09-26 08:19:51,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:51,960 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 1058 transitions. [2018-09-26 08:19:51,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:19:51,960 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1058 transitions. [2018-09-26 08:19:51,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 977 [2018-09-26 08:19:51,966 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:51,967 INFO L375 BasicCegarLoop]: trace histogram [405, 324, 82, 81, 81, 1, 1, 1] [2018-09-26 08:19:51,967 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:51,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:51,967 INFO L82 PathProgramCache]: Analyzing trace with hash -741658523, now seen corresponding path program 84 times [2018-09-26 08:19:51,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:53,612 INFO L134 CoverageAnalysis]: Checked inductivity of 170262 backedges. 0 proven. 168642 refuted. 0 times theorem prover too weak. 1620 trivial. 0 not checked. [2018-09-26 08:19:53,612 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:53,612 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:19:53,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:19:53,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:19:53,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:19:53,614 INFO L87 Difference]: Start difference. First operand 977 states and 1058 transitions. Second operand 84 states. [2018-09-26 08:19:55,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:55,445 INFO L93 Difference]: Finished difference Result 1001 states and 1084 transitions. [2018-09-26 08:19:55,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:19:55,445 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 976 [2018-09-26 08:19:55,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:55,447 INFO L225 Difference]: With dead ends: 1001 [2018-09-26 08:19:55,447 INFO L226 Difference]: Without dead ends: 999 [2018-09-26 08:19:55,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:19:55,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2018-09-26 08:19:56,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 989. [2018-09-26 08:19:56,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2018-09-26 08:19:56,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1071 transitions. [2018-09-26 08:19:56,376 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1071 transitions. Word has length 976 [2018-09-26 08:19:56,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:56,377 INFO L480 AbstractCegarLoop]: Abstraction has 989 states and 1071 transitions. [2018-09-26 08:19:56,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:19:56,377 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1071 transitions. [2018-09-26 08:19:56,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 989 [2018-09-26 08:19:56,383 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:56,383 INFO L375 BasicCegarLoop]: trace histogram [410, 328, 83, 82, 82, 1, 1, 1] [2018-09-26 08:19:56,383 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:56,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:56,384 INFO L82 PathProgramCache]: Analyzing trace with hash 113584291, now seen corresponding path program 85 times [2018-09-26 08:19:56,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:58,012 INFO L134 CoverageAnalysis]: Checked inductivity of 174496 backedges. 0 proven. 172856 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-09-26 08:19:58,012 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:58,012 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:19:58,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:19:58,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:19:58,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:19:58,014 INFO L87 Difference]: Start difference. First operand 989 states and 1071 transitions. Second operand 85 states. [2018-09-26 08:19:59,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:59,888 INFO L93 Difference]: Finished difference Result 1013 states and 1097 transitions. [2018-09-26 08:19:59,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:19:59,888 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 988 [2018-09-26 08:19:59,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:59,891 INFO L225 Difference]: With dead ends: 1013 [2018-09-26 08:19:59,891 INFO L226 Difference]: Without dead ends: 1011 [2018-09-26 08:19:59,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:19:59,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2018-09-26 08:20:00,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1001. [2018-09-26 08:20:00,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2018-09-26 08:20:00,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1084 transitions. [2018-09-26 08:20:00,907 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1084 transitions. Word has length 988 [2018-09-26 08:20:00,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:00,908 INFO L480 AbstractCegarLoop]: Abstraction has 1001 states and 1084 transitions. [2018-09-26 08:20:00,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:20:00,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1084 transitions. [2018-09-26 08:20:00,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1001 [2018-09-26 08:20:00,914 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:00,914 INFO L375 BasicCegarLoop]: trace histogram [415, 332, 84, 83, 83, 1, 1, 1] [2018-09-26 08:20:00,915 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:00,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:00,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1044820961, now seen corresponding path program 86 times [2018-09-26 08:20:00,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:02,876 INFO L134 CoverageAnalysis]: Checked inductivity of 178782 backedges. 0 proven. 177122 refuted. 0 times theorem prover too weak. 1660 trivial. 0 not checked. [2018-09-26 08:20:02,877 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:02,877 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:20:02,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:20:02,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:20:02,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:20:02,878 INFO L87 Difference]: Start difference. First operand 1001 states and 1084 transitions. Second operand 86 states. [2018-09-26 08:20:04,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:04,739 INFO L93 Difference]: Finished difference Result 1025 states and 1110 transitions. [2018-09-26 08:20:04,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:20:04,740 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 1000 [2018-09-26 08:20:04,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:04,741 INFO L225 Difference]: With dead ends: 1025 [2018-09-26 08:20:04,741 INFO L226 Difference]: Without dead ends: 1023 [2018-09-26 08:20:04,742 INFO L605 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-09-26 08:20:04,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2018-09-26 08:20:05,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1013. [2018-09-26 08:20:05,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2018-09-26 08:20:05,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1097 transitions. [2018-09-26 08:20:05,658 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1097 transitions. Word has length 1000 [2018-09-26 08:20:05,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:05,658 INFO L480 AbstractCegarLoop]: Abstraction has 1013 states and 1097 transitions. [2018-09-26 08:20:05,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:20:05,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1097 transitions. [2018-09-26 08:20:05,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1013 [2018-09-26 08:20:05,664 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:05,664 INFO L375 BasicCegarLoop]: trace histogram [420, 336, 85, 84, 84, 1, 1, 1] [2018-09-26 08:20:05,665 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:05,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:05,665 INFO L82 PathProgramCache]: Analyzing trace with hash 613110303, now seen corresponding path program 87 times [2018-09-26 08:20:05,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:07,389 INFO L134 CoverageAnalysis]: Checked inductivity of 183120 backedges. 0 proven. 181440 refuted. 0 times theorem prover too weak. 1680 trivial. 0 not checked. [2018-09-26 08:20:07,390 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:07,390 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:20:07,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:20:07,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:20:07,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:20:07,391 INFO L87 Difference]: Start difference. First operand 1013 states and 1097 transitions. Second operand 87 states. [2018-09-26 08:20:09,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:09,287 INFO L93 Difference]: Finished difference Result 1037 states and 1123 transitions. [2018-09-26 08:20:09,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:20:09,287 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 1012 [2018-09-26 08:20:09,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:09,288 INFO L225 Difference]: With dead ends: 1037 [2018-09-26 08:20:09,289 INFO L226 Difference]: Without dead ends: 1035 [2018-09-26 08:20:09,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:20:09,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2018-09-26 08:20:10,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1025. [2018-09-26 08:20:10,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1025 states. [2018-09-26 08:20:10,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1110 transitions. [2018-09-26 08:20:10,335 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1110 transitions. Word has length 1012 [2018-09-26 08:20:10,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:10,336 INFO L480 AbstractCegarLoop]: Abstraction has 1025 states and 1110 transitions. [2018-09-26 08:20:10,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:20:10,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1110 transitions. [2018-09-26 08:20:10,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1025 [2018-09-26 08:20:10,342 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:10,343 INFO L375 BasicCegarLoop]: trace histogram [425, 340, 86, 85, 85, 1, 1, 1] [2018-09-26 08:20:10,343 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:10,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:10,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1720615773, now seen corresponding path program 88 times [2018-09-26 08:20:10,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:12,210 INFO L134 CoverageAnalysis]: Checked inductivity of 187510 backedges. 0 proven. 185810 refuted. 0 times theorem prover too weak. 1700 trivial. 0 not checked. [2018-09-26 08:20:12,210 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:12,210 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:20:12,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:20:12,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:20:12,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:20:12,212 INFO L87 Difference]: Start difference. First operand 1025 states and 1110 transitions. Second operand 88 states. [2018-09-26 08:20:14,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:14,098 INFO L93 Difference]: Finished difference Result 1049 states and 1136 transitions. [2018-09-26 08:20:14,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:20:14,098 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 1024 [2018-09-26 08:20:14,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:14,099 INFO L225 Difference]: With dead ends: 1049 [2018-09-26 08:20:14,099 INFO L226 Difference]: Without dead ends: 1047 [2018-09-26 08:20:14,100 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:20:14,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2018-09-26 08:20:15,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1037. [2018-09-26 08:20:15,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2018-09-26 08:20:15,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1123 transitions. [2018-09-26 08:20:15,050 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1123 transitions. Word has length 1024 [2018-09-26 08:20:15,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:15,051 INFO L480 AbstractCegarLoop]: Abstraction has 1037 states and 1123 transitions. [2018-09-26 08:20:15,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:20:15,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1123 transitions. [2018-09-26 08:20:15,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1037 [2018-09-26 08:20:15,057 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:15,057 INFO L375 BasicCegarLoop]: trace histogram [430, 344, 87, 86, 86, 1, 1, 1] [2018-09-26 08:20:15,058 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:15,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:15,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1811167333, now seen corresponding path program 89 times [2018-09-26 08:20:15,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:16,862 INFO L134 CoverageAnalysis]: Checked inductivity of 191952 backedges. 0 proven. 190232 refuted. 0 times theorem prover too weak. 1720 trivial. 0 not checked. [2018-09-26 08:20:16,863 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:16,863 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:20:16,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:20:16,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:20:16,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:20:16,864 INFO L87 Difference]: Start difference. First operand 1037 states and 1123 transitions. Second operand 89 states. [2018-09-26 08:20:18,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:18,957 INFO L93 Difference]: Finished difference Result 1061 states and 1149 transitions. [2018-09-26 08:20:18,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:20:18,957 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 1036 [2018-09-26 08:20:18,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:18,959 INFO L225 Difference]: With dead ends: 1061 [2018-09-26 08:20:18,959 INFO L226 Difference]: Without dead ends: 1059 [2018-09-26 08:20:18,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:20:18,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2018-09-26 08:20:19,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1049. [2018-09-26 08:20:19,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1049 states. [2018-09-26 08:20:19,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1136 transitions. [2018-09-26 08:20:19,957 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1136 transitions. Word has length 1036 [2018-09-26 08:20:19,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:19,958 INFO L480 AbstractCegarLoop]: Abstraction has 1049 states and 1136 transitions. [2018-09-26 08:20:19,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:20:19,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1136 transitions. [2018-09-26 08:20:19,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1049 [2018-09-26 08:20:19,964 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:19,964 INFO L375 BasicCegarLoop]: trace histogram [435, 348, 88, 87, 87, 1, 1, 1] [2018-09-26 08:20:19,965 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:19,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:19,965 INFO L82 PathProgramCache]: Analyzing trace with hash -8479015, now seen corresponding path program 90 times [2018-09-26 08:20:19,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:21,779 INFO L134 CoverageAnalysis]: Checked inductivity of 196446 backedges. 0 proven. 194706 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2018-09-26 08:20:21,779 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:21,780 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:20:21,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:20:21,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:20:21,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:20:21,781 INFO L87 Difference]: Start difference. First operand 1049 states and 1136 transitions. Second operand 90 states. [2018-09-26 08:20:23,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:23,780 INFO L93 Difference]: Finished difference Result 1073 states and 1162 transitions. [2018-09-26 08:20:23,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:20:23,781 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 1048 [2018-09-26 08:20:23,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:23,782 INFO L225 Difference]: With dead ends: 1073 [2018-09-26 08:20:23,782 INFO L226 Difference]: Without dead ends: 1071 [2018-09-26 08:20:23,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:20:23,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2018-09-26 08:20:24,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1061. [2018-09-26 08:20:24,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061 states. [2018-09-26 08:20:24,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1149 transitions. [2018-09-26 08:20:24,840 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1149 transitions. Word has length 1048 [2018-09-26 08:20:24,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:24,841 INFO L480 AbstractCegarLoop]: Abstraction has 1061 states and 1149 transitions. [2018-09-26 08:20:24,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:20:24,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1149 transitions. [2018-09-26 08:20:24,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1061 [2018-09-26 08:20:24,847 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:24,847 INFO L375 BasicCegarLoop]: trace histogram [440, 352, 89, 88, 88, 1, 1, 1] [2018-09-26 08:20:24,848 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:24,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:24,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1641903849, now seen corresponding path program 91 times [2018-09-26 08:20:24,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:26,734 INFO L134 CoverageAnalysis]: Checked inductivity of 200992 backedges. 0 proven. 199232 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2018-09-26 08:20:26,735 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:26,735 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:20:26,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:20:26,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:20:26,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:20:26,736 INFO L87 Difference]: Start difference. First operand 1061 states and 1149 transitions. Second operand 91 states. [2018-09-26 08:20:28,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:28,815 INFO L93 Difference]: Finished difference Result 1085 states and 1175 transitions. [2018-09-26 08:20:28,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:20:28,815 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 1060 [2018-09-26 08:20:28,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:28,816 INFO L225 Difference]: With dead ends: 1085 [2018-09-26 08:20:28,816 INFO L226 Difference]: Without dead ends: 1083 [2018-09-26 08:20:28,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:20:28,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2018-09-26 08:20:29,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1073. [2018-09-26 08:20:29,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1073 states. [2018-09-26 08:20:29,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1162 transitions. [2018-09-26 08:20:29,847 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1162 transitions. Word has length 1060 [2018-09-26 08:20:29,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:29,847 INFO L480 AbstractCegarLoop]: Abstraction has 1073 states and 1162 transitions. [2018-09-26 08:20:29,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:20:29,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1162 transitions. [2018-09-26 08:20:29,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1073 [2018-09-26 08:20:29,854 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:29,854 INFO L375 BasicCegarLoop]: trace histogram [445, 356, 90, 89, 89, 1, 1, 1] [2018-09-26 08:20:29,854 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:29,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:29,855 INFO L82 PathProgramCache]: Analyzing trace with hash -403503531, now seen corresponding path program 92 times [2018-09-26 08:20:29,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:31,756 INFO L134 CoverageAnalysis]: Checked inductivity of 205590 backedges. 0 proven. 203810 refuted. 0 times theorem prover too weak. 1780 trivial. 0 not checked. [2018-09-26 08:20:31,757 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:31,757 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:20:31,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:20:31,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:20:31,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:20:31,758 INFO L87 Difference]: Start difference. First operand 1073 states and 1162 transitions. Second operand 92 states. [2018-09-26 08:20:34,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:34,006 INFO L93 Difference]: Finished difference Result 1097 states and 1188 transitions. [2018-09-26 08:20:34,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:20:34,006 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 1072 [2018-09-26 08:20:34,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:34,008 INFO L225 Difference]: With dead ends: 1097 [2018-09-26 08:20:34,008 INFO L226 Difference]: Without dead ends: 1095 [2018-09-26 08:20:34,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:20:34,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2018-09-26 08:20:35,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1085. [2018-09-26 08:20:35,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1085 states. [2018-09-26 08:20:35,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1175 transitions. [2018-09-26 08:20:35,215 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1175 transitions. Word has length 1072 [2018-09-26 08:20:35,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:35,215 INFO L480 AbstractCegarLoop]: Abstraction has 1085 states and 1175 transitions. [2018-09-26 08:20:35,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:20:35,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1175 transitions. [2018-09-26 08:20:35,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1085 [2018-09-26 08:20:35,222 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:35,222 INFO L375 BasicCegarLoop]: trace histogram [450, 360, 91, 90, 90, 1, 1, 1] [2018-09-26 08:20:35,222 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:35,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:35,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1213491565, now seen corresponding path program 93 times [2018-09-26 08:20:35,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:37,174 INFO L134 CoverageAnalysis]: Checked inductivity of 210240 backedges. 0 proven. 208440 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2018-09-26 08:20:37,175 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:37,175 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:20:37,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:20:37,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:20:37,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:20:37,176 INFO L87 Difference]: Start difference. First operand 1085 states and 1175 transitions. Second operand 93 states. [2018-09-26 08:20:39,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:39,281 INFO L93 Difference]: Finished difference Result 1109 states and 1201 transitions. [2018-09-26 08:20:39,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:20:39,281 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 1084 [2018-09-26 08:20:39,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:39,283 INFO L225 Difference]: With dead ends: 1109 [2018-09-26 08:20:39,283 INFO L226 Difference]: Without dead ends: 1107 [2018-09-26 08:20:39,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:20:39,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2018-09-26 08:20:40,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1097. [2018-09-26 08:20:40,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2018-09-26 08:20:40,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1188 transitions. [2018-09-26 08:20:40,360 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1188 transitions. Word has length 1084 [2018-09-26 08:20:40,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:40,361 INFO L480 AbstractCegarLoop]: Abstraction has 1097 states and 1188 transitions. [2018-09-26 08:20:40,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:20:40,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1188 transitions. [2018-09-26 08:20:40,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1097 [2018-09-26 08:20:40,368 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:40,368 INFO L375 BasicCegarLoop]: trace histogram [455, 364, 92, 91, 91, 1, 1, 1] [2018-09-26 08:20:40,368 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:40,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:40,369 INFO L82 PathProgramCache]: Analyzing trace with hash 717732305, now seen corresponding path program 94 times [2018-09-26 08:20:40,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:42,366 INFO L134 CoverageAnalysis]: Checked inductivity of 214942 backedges. 0 proven. 213122 refuted. 0 times theorem prover too weak. 1820 trivial. 0 not checked. [2018-09-26 08:20:42,367 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:42,367 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:20:42,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:20:42,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:20:42,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:20:42,369 INFO L87 Difference]: Start difference. First operand 1097 states and 1188 transitions. Second operand 94 states. [2018-09-26 08:20:44,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:44,560 INFO L93 Difference]: Finished difference Result 1121 states and 1214 transitions. [2018-09-26 08:20:44,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:20:44,560 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 1096 [2018-09-26 08:20:44,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:44,561 INFO L225 Difference]: With dead ends: 1121 [2018-09-26 08:20:44,561 INFO L226 Difference]: Without dead ends: 1119 [2018-09-26 08:20:44,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:20:44,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-09-26 08:20:45,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1109. [2018-09-26 08:20:45,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1109 states. [2018-09-26 08:20:45,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1201 transitions. [2018-09-26 08:20:45,681 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1201 transitions. Word has length 1096 [2018-09-26 08:20:45,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:45,681 INFO L480 AbstractCegarLoop]: Abstraction has 1109 states and 1201 transitions. [2018-09-26 08:20:45,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:20:45,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1201 transitions. [2018-09-26 08:20:45,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1109 [2018-09-26 08:20:45,689 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:45,690 INFO L375 BasicCegarLoop]: trace histogram [460, 368, 93, 92, 92, 1, 1, 1] [2018-09-26 08:20:45,690 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:45,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:45,691 INFO L82 PathProgramCache]: Analyzing trace with hash -2122125297, now seen corresponding path program 95 times [2018-09-26 08:20:45,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:47,709 INFO L134 CoverageAnalysis]: Checked inductivity of 219696 backedges. 0 proven. 217856 refuted. 0 times theorem prover too weak. 1840 trivial. 0 not checked. [2018-09-26 08:20:47,709 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:47,709 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:20:47,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:20:47,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:20:47,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:20:47,711 INFO L87 Difference]: Start difference. First operand 1109 states and 1201 transitions. Second operand 95 states. [2018-09-26 08:20:49,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:49,998 INFO L93 Difference]: Finished difference Result 1133 states and 1227 transitions. [2018-09-26 08:20:49,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:20:49,998 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 1108 [2018-09-26 08:20:49,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:49,999 INFO L225 Difference]: With dead ends: 1133 [2018-09-26 08:20:49,999 INFO L226 Difference]: Without dead ends: 1131 [2018-09-26 08:20:50,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:20:50,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2018-09-26 08:20:51,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1121. [2018-09-26 08:20:51,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1121 states. [2018-09-26 08:20:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1214 transitions. [2018-09-26 08:20:51,145 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1214 transitions. Word has length 1108 [2018-09-26 08:20:51,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:51,145 INFO L480 AbstractCegarLoop]: Abstraction has 1121 states and 1214 transitions. [2018-09-26 08:20:51,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:20:51,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1214 transitions. [2018-09-26 08:20:51,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1121 [2018-09-26 08:20:51,152 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:51,153 INFO L375 BasicCegarLoop]: trace histogram [465, 372, 94, 93, 93, 1, 1, 1] [2018-09-26 08:20:51,153 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:51,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:51,153 INFO L82 PathProgramCache]: Analyzing trace with hash -19351219, now seen corresponding path program 96 times [2018-09-26 08:20:51,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:53,223 INFO L134 CoverageAnalysis]: Checked inductivity of 224502 backedges. 0 proven. 222642 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2018-09-26 08:20:53,223 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:53,224 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:20:53,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:20:53,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:20:53,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:20:53,225 INFO L87 Difference]: Start difference. First operand 1121 states and 1214 transitions. Second operand 96 states. [2018-09-26 08:20:55,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:55,495 INFO L93 Difference]: Finished difference Result 1145 states and 1240 transitions. [2018-09-26 08:20:55,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:20:55,496 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 1120 [2018-09-26 08:20:55,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:55,497 INFO L225 Difference]: With dead ends: 1145 [2018-09-26 08:20:55,497 INFO L226 Difference]: Without dead ends: 1143 [2018-09-26 08:20:55,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:20:55,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2018-09-26 08:20:56,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1133. [2018-09-26 08:20:56,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2018-09-26 08:20:56,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1227 transitions. [2018-09-26 08:20:56,679 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1227 transitions. Word has length 1120 [2018-09-26 08:20:56,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:56,679 INFO L480 AbstractCegarLoop]: Abstraction has 1133 states and 1227 transitions. [2018-09-26 08:20:56,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:20:56,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1227 transitions. [2018-09-26 08:20:56,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1133 [2018-09-26 08:20:56,687 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:56,687 INFO L375 BasicCegarLoop]: trace histogram [470, 376, 95, 94, 94, 1, 1, 1] [2018-09-26 08:20:56,687 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:56,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:56,688 INFO L82 PathProgramCache]: Analyzing trace with hash -930835061, now seen corresponding path program 97 times [2018-09-26 08:20:56,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:58,782 INFO L134 CoverageAnalysis]: Checked inductivity of 229360 backedges. 0 proven. 227480 refuted. 0 times theorem prover too weak. 1880 trivial. 0 not checked. [2018-09-26 08:20:58,782 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:58,782 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:20:58,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:20:58,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:20:58,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:20:58,783 INFO L87 Difference]: Start difference. First operand 1133 states and 1227 transitions. Second operand 97 states. [2018-09-26 08:21:01,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:01,099 INFO L93 Difference]: Finished difference Result 1157 states and 1253 transitions. [2018-09-26 08:21:01,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:21:01,099 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 1132 [2018-09-26 08:21:01,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:01,101 INFO L225 Difference]: With dead ends: 1157 [2018-09-26 08:21:01,101 INFO L226 Difference]: Without dead ends: 1155 [2018-09-26 08:21:01,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:21:01,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2018-09-26 08:21:02,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1145. [2018-09-26 08:21:02,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2018-09-26 08:21:02,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1240 transitions. [2018-09-26 08:21:02,315 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1240 transitions. Word has length 1132 [2018-09-26 08:21:02,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:02,315 INFO L480 AbstractCegarLoop]: Abstraction has 1145 states and 1240 transitions. [2018-09-26 08:21:02,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:21:02,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1240 transitions. [2018-09-26 08:21:02,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1145 [2018-09-26 08:21:02,322 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:02,323 INFO L375 BasicCegarLoop]: trace histogram [475, 380, 96, 95, 95, 1, 1, 1] [2018-09-26 08:21:02,323 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:02,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:02,324 INFO L82 PathProgramCache]: Analyzing trace with hash -956169015, now seen corresponding path program 98 times [2018-09-26 08:21:02,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:04,488 INFO L134 CoverageAnalysis]: Checked inductivity of 234270 backedges. 0 proven. 232370 refuted. 0 times theorem prover too weak. 1900 trivial. 0 not checked. [2018-09-26 08:21:04,488 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:04,489 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:21:04,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:21:04,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:21:04,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:21:04,490 INFO L87 Difference]: Start difference. First operand 1145 states and 1240 transitions. Second operand 98 states. [2018-09-26 08:21:06,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:06,928 INFO L93 Difference]: Finished difference Result 1169 states and 1266 transitions. [2018-09-26 08:21:06,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:21:06,928 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 1144 [2018-09-26 08:21:06,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:06,930 INFO L225 Difference]: With dead ends: 1169 [2018-09-26 08:21:06,930 INFO L226 Difference]: Without dead ends: 1167 [2018-09-26 08:21:06,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:21:06,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2018-09-26 08:21:08,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1157. [2018-09-26 08:21:08,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2018-09-26 08:21:08,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1253 transitions. [2018-09-26 08:21:08,186 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1253 transitions. Word has length 1144 [2018-09-26 08:21:08,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:08,186 INFO L480 AbstractCegarLoop]: Abstraction has 1157 states and 1253 transitions. [2018-09-26 08:21:08,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:21:08,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1253 transitions. [2018-09-26 08:21:08,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1157 [2018-09-26 08:21:08,196 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:08,197 INFO L375 BasicCegarLoop]: trace histogram [480, 384, 97, 96, 96, 1, 1, 1] [2018-09-26 08:21:08,197 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:08,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:08,198 INFO L82 PathProgramCache]: Analyzing trace with hash -2054387961, now seen corresponding path program 99 times [2018-09-26 08:21:08,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:10,410 INFO L134 CoverageAnalysis]: Checked inductivity of 239232 backedges. 0 proven. 237312 refuted. 0 times theorem prover too weak. 1920 trivial. 0 not checked. [2018-09-26 08:21:10,411 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:10,411 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:21:10,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:21:10,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:21:10,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:21:10,412 INFO L87 Difference]: Start difference. First operand 1157 states and 1253 transitions. Second operand 99 states. [2018-09-26 08:21:12,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:12,875 INFO L93 Difference]: Finished difference Result 1181 states and 1279 transitions. [2018-09-26 08:21:12,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:21:12,875 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 1156 [2018-09-26 08:21:12,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:12,878 INFO L225 Difference]: With dead ends: 1181 [2018-09-26 08:21:12,878 INFO L226 Difference]: Without dead ends: 1179 [2018-09-26 08:21:12,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:21:12,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2018-09-26 08:21:14,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1169. [2018-09-26 08:21:14,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1169 states. [2018-09-26 08:21:14,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1266 transitions. [2018-09-26 08:21:14,166 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1266 transitions. Word has length 1156 [2018-09-26 08:21:14,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:14,166 INFO L480 AbstractCegarLoop]: Abstraction has 1169 states and 1266 transitions. [2018-09-26 08:21:14,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:21:14,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1266 transitions. [2018-09-26 08:21:14,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1169 [2018-09-26 08:21:14,174 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:14,174 INFO L375 BasicCegarLoop]: trace histogram [485, 388, 98, 97, 97, 1, 1, 1] [2018-09-26 08:21:14,174 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:14,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:14,175 INFO L82 PathProgramCache]: Analyzing trace with hash 304061509, now seen corresponding path program 100 times [2018-09-26 08:21:14,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:16,429 INFO L134 CoverageAnalysis]: Checked inductivity of 244246 backedges. 0 proven. 242306 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked. [2018-09-26 08:21:16,429 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:16,429 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:21:16,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:21:16,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:21:16,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:21:16,431 INFO L87 Difference]: Start difference. First operand 1169 states and 1266 transitions. Second operand 100 states. [2018-09-26 08:21:19,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:19,071 INFO L93 Difference]: Finished difference Result 1193 states and 1292 transitions. [2018-09-26 08:21:19,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:21:19,071 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 1168 [2018-09-26 08:21:19,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:19,073 INFO L225 Difference]: With dead ends: 1193 [2018-09-26 08:21:19,073 INFO L226 Difference]: Without dead ends: 1191 [2018-09-26 08:21:19,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:21:19,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2018-09-26 08:21:20,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1181. [2018-09-26 08:21:20,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2018-09-26 08:21:20,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1279 transitions. [2018-09-26 08:21:20,382 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1279 transitions. Word has length 1168 [2018-09-26 08:21:20,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:20,383 INFO L480 AbstractCegarLoop]: Abstraction has 1181 states and 1279 transitions. [2018-09-26 08:21:20,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:21:20,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1279 transitions. [2018-09-26 08:21:20,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1181 [2018-09-26 08:21:20,390 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:20,390 INFO L375 BasicCegarLoop]: trace histogram [490, 392, 99, 98, 98, 1, 1, 1] [2018-09-26 08:21:20,391 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:20,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:20,391 INFO L82 PathProgramCache]: Analyzing trace with hash -579419005, now seen corresponding path program 101 times [2018-09-26 08:21:20,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:22,660 INFO L134 CoverageAnalysis]: Checked inductivity of 249312 backedges. 0 proven. 247352 refuted. 0 times theorem prover too weak. 1960 trivial. 0 not checked. [2018-09-26 08:21:22,660 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:22,660 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:21:22,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:21:22,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:21:22,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:21:22,662 INFO L87 Difference]: Start difference. First operand 1181 states and 1279 transitions. Second operand 101 states. [2018-09-26 08:21:25,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:25,238 INFO L93 Difference]: Finished difference Result 1205 states and 1305 transitions. [2018-09-26 08:21:25,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:21:25,238 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 1180 [2018-09-26 08:21:25,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:25,240 INFO L225 Difference]: With dead ends: 1205 [2018-09-26 08:21:25,240 INFO L226 Difference]: Without dead ends: 1203 [2018-09-26 08:21:25,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:21:25,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2018-09-26 08:21:26,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1193. [2018-09-26 08:21:26,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2018-09-26 08:21:26,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1292 transitions. [2018-09-26 08:21:26,686 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1292 transitions. Word has length 1180 [2018-09-26 08:21:26,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:26,686 INFO L480 AbstractCegarLoop]: Abstraction has 1193 states and 1292 transitions. [2018-09-26 08:21:26,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:21:26,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1292 transitions. [2018-09-26 08:21:26,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1193 [2018-09-26 08:21:26,694 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:26,694 INFO L375 BasicCegarLoop]: trace histogram [495, 396, 100, 99, 99, 1, 1, 1] [2018-09-26 08:21:26,694 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:26,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:26,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1693614143, now seen corresponding path program 102 times [2018-09-26 08:21:26,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 254430 backedges. 0 proven. 252450 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2018-09-26 08:21:29,135 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:29,135 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:21:29,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:21:29,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:21:29,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:21:29,137 INFO L87 Difference]: Start difference. First operand 1193 states and 1292 transitions. Second operand 102 states. [2018-09-26 08:21:31,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:31,930 INFO L93 Difference]: Finished difference Result 1217 states and 1318 transitions. [2018-09-26 08:21:31,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:21:31,930 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 1192 [2018-09-26 08:21:31,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:31,932 INFO L225 Difference]: With dead ends: 1217 [2018-09-26 08:21:31,932 INFO L226 Difference]: Without dead ends: 1215 [2018-09-26 08:21:31,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:21:31,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2018-09-26 08:21:33,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1205. [2018-09-26 08:21:33,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1205 states. [2018-09-26 08:21:33,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1305 transitions. [2018-09-26 08:21:33,333 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1305 transitions. Word has length 1192 [2018-09-26 08:21:33,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:33,334 INFO L480 AbstractCegarLoop]: Abstraction has 1205 states and 1305 transitions. [2018-09-26 08:21:33,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:21:33,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1305 transitions. [2018-09-26 08:21:33,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1205 [2018-09-26 08:21:33,341 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:33,342 INFO L375 BasicCegarLoop]: trace histogram [500, 400, 101, 100, 100, 1, 1, 1] [2018-09-26 08:21:33,342 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:33,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:33,342 INFO L82 PathProgramCache]: Analyzing trace with hash 555699711, now seen corresponding path program 103 times [2018-09-26 08:21:33,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:35,733 INFO L134 CoverageAnalysis]: Checked inductivity of 259600 backedges. 0 proven. 257600 refuted. 0 times theorem prover too weak. 2000 trivial. 0 not checked. [2018-09-26 08:21:35,734 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:35,734 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-09-26 08:21:35,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:21:35,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:21:35,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:21:35,735 INFO L87 Difference]: Start difference. First operand 1205 states and 1305 transitions. Second operand 103 states. [2018-09-26 08:21:38,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:38,633 INFO L93 Difference]: Finished difference Result 1229 states and 1331 transitions. [2018-09-26 08:21:38,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:21:38,634 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 1204 [2018-09-26 08:21:38,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:38,635 INFO L225 Difference]: With dead ends: 1229 [2018-09-26 08:21:38,636 INFO L226 Difference]: Without dead ends: 1227 [2018-09-26 08:21:38,636 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:21:38,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2018-09-26 08:21:40,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1217. [2018-09-26 08:21:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2018-09-26 08:21:40,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1318 transitions. [2018-09-26 08:21:40,054 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1318 transitions. Word has length 1204 [2018-09-26 08:21:40,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:40,055 INFO L480 AbstractCegarLoop]: Abstraction has 1217 states and 1318 transitions. [2018-09-26 08:21:40,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:21:40,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1318 transitions. [2018-09-26 08:21:40,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1217 [2018-09-26 08:21:40,063 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:40,063 INFO L375 BasicCegarLoop]: trace histogram [505, 404, 102, 101, 101, 1, 1, 1] [2018-09-26 08:21:40,063 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:40,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:40,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1218948925, now seen corresponding path program 104 times [2018-09-26 08:21:40,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:42,608 INFO L134 CoverageAnalysis]: Checked inductivity of 264822 backedges. 0 proven. 262802 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2018-09-26 08:21:42,609 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:42,609 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:21:42,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:21:42,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:21:42,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:21:42,610 INFO L87 Difference]: Start difference. First operand 1217 states and 1318 transitions. Second operand 104 states. [2018-09-26 08:21:45,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:45,507 INFO L93 Difference]: Finished difference Result 1241 states and 1344 transitions. [2018-09-26 08:21:45,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:21:45,507 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 1216 [2018-09-26 08:21:45,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:45,509 INFO L225 Difference]: With dead ends: 1241 [2018-09-26 08:21:45,509 INFO L226 Difference]: Without dead ends: 1239 [2018-09-26 08:21:45,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:21:45,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2018-09-26 08:21:46,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1229. [2018-09-26 08:21:46,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1229 states. [2018-09-26 08:21:46,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1331 transitions. [2018-09-26 08:21:46,932 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1331 transitions. Word has length 1216 [2018-09-26 08:21:46,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:46,933 INFO L480 AbstractCegarLoop]: Abstraction has 1229 states and 1331 transitions. [2018-09-26 08:21:46,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:21:46,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1331 transitions. [2018-09-26 08:21:46,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1229 [2018-09-26 08:21:46,941 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:46,941 INFO L375 BasicCegarLoop]: trace histogram [510, 408, 103, 102, 102, 1, 1, 1] [2018-09-26 08:21:46,941 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:46,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:46,941 INFO L82 PathProgramCache]: Analyzing trace with hash -849206405, now seen corresponding path program 105 times [2018-09-26 08:21:46,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:49,389 INFO L134 CoverageAnalysis]: Checked inductivity of 270096 backedges. 0 proven. 268056 refuted. 0 times theorem prover too weak. 2040 trivial. 0 not checked. [2018-09-26 08:21:49,390 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:49,390 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-09-26 08:21:49,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-09-26 08:21:49,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-09-26 08:21:49,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:21:49,391 INFO L87 Difference]: Start difference. First operand 1229 states and 1331 transitions. Second operand 105 states. Received shutdown request... [2018-09-26 08:21:51,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:21:51,941 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 08:21:51,946 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 08:21:51,947 INFO L202 PluginConnector]: Adding new model nested1.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:21:51 BoogieIcfgContainer [2018-09-26 08:21:51,947 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:21:51,948 INFO L168 Benchmark]: Toolchain (without parser) took 255503.12 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.7 GB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -351.8 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-09-26 08:21:51,949 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-09-26 08:21:51,950 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.48 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-09-26 08:21:51,950 INFO L168 Benchmark]: Boogie Preprocessor took 19.98 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-09-26 08:21:51,951 INFO L168 Benchmark]: RCFGBuilder took 258.02 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-09-26 08:21:51,951 INFO L168 Benchmark]: TraceAbstraction took 255172.73 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.7 GB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -362.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-09-26 08:21:51,954 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.48 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 19.98 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 258.02 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 255172.73 ms. Allocated memory was 1.5 GB in the beginning and 3.3 GB in the end (delta: 1.7 GB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -362.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 34]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 34). Cancelled while BasicCegarLoop was constructing difference of abstraction (1229states) and FLOYD_HOARE automaton (currently 101 states, 105 states before enhancement), while ReachableStatesComputation was computing reachable states (1186 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. TIMEOUT Result, 255.1s OverallTime, 107 OverallIterations, 510 TraceHistogramMax, 105.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16397 SDtfs, 310 SDslu, 1096707 SDs, 0 SdLazy, 748866 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 36.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5477 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5366 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1229occurred in iteration=106, 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: 49.8s AutomataMinimizationTime, 106 MinimizatonAttempts, 1006 StatesRemovedByMinimization, 102 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 5.3s SatisfiabilityAnalysisTime, 29.5s InterpolantComputationTime, 63512 NumberOfCodeBlocks, 63512 NumberOfCodeBlocksAsserted, 107 NumberOfCheckSat, 63405 ConstructedInterpolants, 0 QuantifiedInterpolants, 364102639 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 107 InterpolantComputations, 2 PerfectInterpolantSequences, 105196/9311956 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/nested1.i_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-21-51-972.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/nested1.i_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-21-51-972.csv Completed graceful shutdown